DOCSLIB.ORG

A Common Algorithm of Construction a New Quantum Logic Gate for Exact Minimization of Quantum Circuits

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Common Algorithm of Construction a New Quantum Logic Gate for Exact Minimization of Quantum Circuits Zhi-qiang LI, Sai CHEN*, Wei ZHU, Han-wu CHEN A Common Algorithm of Construction a New Quantum Logic Gate for Exact Minimization of Quantum Circuits Abstract: Sincenon-permutative quantum gates have more complex rules than permutative quantum gates, direct use of non-permutative quantum gates should be avoided in the efficient synthesis algorithm because it is very hard to synthesize. The key method is using quantum gates to create new permutative quantum gates to replace non-permutative quantum gates. In this paper, we propose an algorithm using CNOT and non-permutative quantum gates to construct new optimal quantum logic gates library automatically. Our method based on the idea of exhaustion finds the all combinations of quantum logic gates with lower quantum cost no matter how many the quantum lines are. Keywords: automatically; non-permutative quantum gates; exhaustive 1 Introduction Cascading and combining the quantum logical gates are the basic elements of reversible quantum logic circuits, and then, a quantum computer is constructed by quantum reversible logic circuits. According to the characteristics of the input and the output, quantum gates can be divided into non-permutative quantum gates and permutative quantum gates. In a quantum logic circuit, if the input is logical, the output must be logical and vice versa. But when the input and output are all logical, the internal circuit allows the superposition of quantum information and quantum entanglement that is non-permutative values. If only using quantum logic gates in a quantum logic circuit, the synthesis algorithms of the circuits are like the classic reversible logic synthesis algorithm. In addition, non-permutative quantum gates are also used, the superposition of information will make the process of synthesis more complicated and low-performance. Non-permutative quantum gates, such as NCV quantum gates library (including NOT gates [1], controll-NOT gates and controlled- square-root-of-NOT gates [2]), are used to construct new quantum permutative gates and gate libraries. *Corresponding author: Sai CHEN, College of Information Engineering, Yangzhou University Yangzhou, China, E-mail: [email protected] Zhi-qiang LI, Wei ZHU, College of Information Engineering, Yangzhou University, Yangzhou, China Han-wu CHEN, School of Computer Science and Engineering, Southeast University,Nanjing, China 372 A Common Algorithm of Construction a New Quantum Logic Gate To reduce the cost of the circuits, an excellent combination and optimization techniques is the key. The essence of constructing less cost quantum logic gates is the reversible logic synthesis [3]. With the further research of reversible circuit, many synthesis methods of reversible circuits also appeared [4-8]. The ultimate goal of quantum reversible logic synthesis algorithms is to efficiently construct optimum quantum logic circuits and automatically design reversible quantum logic circuits with less cost. However, these methods generally were designed for the entire logic circuits optimization. And the research of the foundational quantum logic gates construction is less. The optimization of quantum logic gates will directly affect the entire quantum logic circuits optimization. If the quantum logic gates can be optimized automatically, the synthesize algorithm which using this gates will have better performance and minimum cost. This will play an important role in the optimization of the entire circuits. People have done a lot of research and put forward many quantum circuits synthesis algorithms in which most of 3-qubit synthesis algorithms based on quantum logic gates have been presented [9-13]. However, the algorithms based on non-permutative quantum gates are few. There are several synthesis algorithm based on NCV gates right now [14-17]. Although a variety of 4-qubit algorithms have been proposed, these algorithms still based on quantum logic gates. In [18], new quantum logic gates can be constructed by using NVC gate library to compose four types Peres- like gates. But this method is not universal, and can only be used when the number of lines is fewer. If the quantum lines are increased, such as the number of lines greater than five, this method cannot be realized. Therefore, in this paper we proposed a universal algorithm to generate any lines of optimal new quantum logic gates automatically. Here the optimum means that in the new quantum logic gates can be no longer broken down into several cascading quantum logic gates with equivalent quantum cost. 2 Backgroung A quantum gate is the basic unit of quantum information processing and its cascade constitutes a quantum circuit. A quantum circuit is reversible. In the quantum computation, a quantum gate is corresponding to a unitary transformation. It is well known that the operation of each gate in an n-line reversible or quantum circuit can be represented by a square matrix of dimension 2n. The matrix of the NOT 0 1 1 0 = I = gate is N false, and 0 1 false represents the identity circuit. 1 0 As shown in Figure 1 is the NOT gates, control-NOT gates and Toffoli gates [19]. They are all typical permutative quantum gates. A Common Algorithm of Construction a New Quantum Logic Gate 373 x3 x3 x2 x2 x2 x2 ⊕ x x⊕ xx x1 x1 x1 xx121 1 23 ()a ()b ()c Figure 1. The permutative quantum gates. The Controlled-square-root-of-NOT gates contain a controlled-V (CV) gate and a controlled-V+ (CV+) gate as shown in Figure 2. They are all typical non-permutative quantum gates. Figure 2. Basic quantum algebra rules for CV/CV† gates. If the input and the output are logical, the gate must be a permutative quantum gate. If the input is not logical and the output is logic, the gate must not be a permutative quantum gate andvice versa. If the input and output are all not logical, the gate cannot be sure a permutative quantum gate. For example, control-NOT gate in Figure 1 (b), 1111+−ii 1 1 + i 01 11 1+−ii 1 = xx12⊕= × = set x2 to 1 and x1to v0 which v0 is 2211−+ii 0 1 − i false, then 10 22 1−+ii 1 false. We can clearly see the result is not logic. If the gate is replaced by a controlled-V gate, 01+ 1 11+−ii01+ 2 × set x2 to 1 and x1to false, the result is 2211−+ii false. It is clearly also not logical. 3 The common algorithm ofr ealizing an ewquantum logic gate In [18], new quantum logic gates were constructed by using NVC gate library to compose four types Peres-like gates. The new quantum logic gates along with the NOT gates and control-NOT gates together constituted the new quantum logic gate library (NCP4). The NCP4 gate library can construct optimal 3-qubit quantum logic circuit which the NCV gate library can also construct the equivalent. That means the function of the two methods are the same, but the construction methods are different. We can also say that the two gate libraries are equivalent when they synthesize 3-qubit logic circuits. In Figure 4, the new quantum logic gate was constructed by our hands when the quantum lines were five. This method totally spent 11 CNOT gates. The Table 374 A Common Algorithm of Construction a New Quantum Logic Gate 1 is the all kinds of inputs. We can clearly see that each line only eight U gates are to be used. So we can sure the U gates are controlled-Kth-root-of-NOT when K=8. Table 1. All kinds of inputs in fig. 4 X3X2X1X0 U1 U2 U3 U4 U5 U6 U7 U8 U9 U10 U11 U12 U13 U14 U15 0000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0001 1 0 0 0 0 0 1 0 0 1 1 1 1 1 1 0010 0 1 0 0 0 1 0 1 1 0 0 1 1 1 1 0011 1 1 0 0 0 1 1 1 1 1 1 0 0 0 0 0100 0 0 1 0 1 0 0 1 1 1 1 0 0 1 1 0101 1 0 1 0 1 0 1 1 1 0 0 1 1 0 0 0110 0 1 1 0 1 1 0 0 0 1 1 1 1 0 0 0111 1 1 1 0 1 1 1 0 0 0 0 0 0 1 1 1000 0 0 0 1 1 1 1 0 1 0 1 0 1 0 1 1001 1 0 0 1 1 1 0 0 1 1 0 1 0 1 0 1010 0 1 0 1 1 0 1 1 0 0 1 1 0 1 0 1011 1 1 0 1 1 0 0 1 0 1 0 0 1 0 1 1100 0 0 1 1 0 1 1 1 0 1 0 0 1 0 1 1101 1 0 1 1 0 1 0 1 0 0 1 1 0 0 1 1110 0 1 1 1 0 0 1 0 1 1 0 1 0 0 1 1111 1 1 1 1 0 0 0 0 1 0 1 0 1 0 1 x3 x3 x2 x2 x1 x1 x0 x0 z U1 U2 U3 U4 U5 U6 U7 U8 U9 U10 U11 U12 U13 U14 U15 z' Figure 4. The new quantum logic gate with four control lines was constructed by hands. Because the lines of the circuits are few and there are certain rules in the circuits, we can construct these circuits by our hands. But when the lines of the new quantum logic gates are increased, this method is difficult to implement. We must find a common algorithm. In [20], non-permutative quantum gates constructed new permutative quantum gates by using controlled-Kth -root-of-NOT gates.
Load more

Recommended publications
  • Quantum Inductive Learning and Quantum Logic Synthesis
    Portland State University PDXScholar Dissertations and Theses Dissertations and Theses 2009 Quantum Inductive Learning and Quantum Logic Synthesis Martin Lukac Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/open_access_etds Part of the Electrical and Computer Engineering Commons Let us know how access to this document benefits ou.y Recommended Citation Lukac, Martin, "Quantum Inductive Learning and Quantum Logic Synthesis" (2009). Dissertations and Theses. Paper 2319. https://doi.org/10.15760/etd.2316 This Dissertation is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. For more information, please contact [email protected]. QUANTUM INDUCTIVE LEARNING AND QUANTUM LOGIC SYNTHESIS by MARTIN LUKAC A dissertation submitted in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY in ELECTRICAL AND COMPUTER ENGINEERING. Portland State University 2009 DISSERTATION APPROVAL The abstract and dissertation of Martin Lukac for the Doctor of Philosophy in Electrical and Computer Engineering were presented January 9, 2009, and accepted by the dissertation committee and the doctoral program. COMMITTEE APPROVALS: Irek Perkowski, Chair GarrisoH-Xireenwood -George ^Lendaris 5artM ?teven Bleiler Representative of the Office of Graduate Studies DOCTORAL PROGRAM APPROVAL: Malgorza /ska-Jeske7~Director Electrical Computer Engineering Ph.D. Program ABSTRACT An abstract of the dissertation of Martin Lukac for the Doctor of Philosophy in Electrical and Computer Engineering presented January 9, 2009. Title: Quantum Inductive Learning and Quantum Logic Synhesis Since Quantum Computer is almost realizable on large scale and Quantum Technology is one of the main solutions to the Moore Limit, Quantum Logic Synthesis (QLS) has become a required theory and tool for designing Quantum Logic Circuits.
    [Show full text]
  • Arxiv:Quant-Ph/0002039V2 1 Aug 2000
    Methodology for quantum logic gate construction 1,2 3,2 2 Xinlan Zhou ∗, Debbie W. Leung †, and Isaac L. Chuang ‡ 1 Department of Applied Physics, Stanford University, Stanford, California 94305-4090 2 IBM Almaden Research Center, 650 Harry Road, San Jose, California 95120 3 Quantum Entanglement Project, ICORP, JST Edward Ginzton Laboratory, Stanford University, Stanford, California 94305-4085 (October 29, 2018) We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on traditional quantum teleportation (Gottesman and Chuang, Nature 402, 390, 1999) and leads to straightforward and systematic construction of many fault-tolerant encoded operations, including the π/8 and Toffoli gates. The technique can also be applied to the construction of remote quantum operations that cannot be directly performed. I. INTRODUCTION Practical realization of quantum information processing requires specific types of quantum operations that may be difficult to construct. In particular, to perform quantum computation robustly in the presence of noise, one needs fault-tolerant implementation of quantum gates acting on states that are block-encoded using quantum error correcting codes [1–4]. Fault-tolerant quantum gates must prevent propagation of single qubit errors to multiple qubits within any code block so that small correctable errors will not grow to exceed the correction capability of the code. This requirement greatly restricts the types of unitary operations that can be performed on the encoded qubits. Certain fault-tolerant operations can be implemented easily by performing direct transversal operations on the encoded qubits, in which each qubit in a block interacts only with one corresponding qubit, either in another block or in a specialized ancilla.
    [Show full text]
  • Fault-Tolerant Interface Between Quantum Memories and Quantum Processors
    ARTICLE DOI: 10.1038/s41467-017-01418-2 OPEN Fault-tolerant interface between quantum memories and quantum processors Hendrik Poulsen Nautrup 1, Nicolai Friis 1,2 & Hans J. Briegel1 Topological error correction codes are promising candidates to protect quantum computa- tions from the deteriorating effects of noise. While some codes provide high noise thresholds suitable for robust quantum memories, others allow straightforward gate implementation 1234567890 needed for data processing. To exploit the particular advantages of different topological codes for fault-tolerant quantum computation, it is necessary to be able to switch between them. Here we propose a practical solution, subsystem lattice surgery, which requires only two-body nearest-neighbor interactions in a fixed layout in addition to the indispensable error correction. This method can be used for the fault-tolerant transfer of quantum information between arbitrary topological subsystem codes in two dimensions and beyond. In particular, it can be employed to create a simple interface, a quantum bus, between noise resilient surface code memories and flexible color code processors. 1 Institute for Theoretical Physics, University of Innsbruck, Technikerstr. 21a, 6020 Innsbruck, Austria. 2 Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, 1090 Vienna, Austria. Correspondence and requests for materials should be addressed to H.P.N. (email: [email protected]) NATURE COMMUNICATIONS | 8: 1321 | DOI: 10.1038/s41467-017-01418-2 | www.nature.com/naturecommunications 1 ARTICLE NATURE COMMUNICATIONS | DOI: 10.1038/s41467-017-01418-2 oise and decoherence can be considered as the major encoding k = n − s qubits. We denote the normalizer of S by Nobstacles for large-scale quantum information processing.
    [Show full text]
  • Realization of the Quantum Toffoli Gate
    Realization of the quantum Toffoli gate Realization of the quantum Toffoli gate Based on: Monz, T; Kim, K; Haensel, W; et al Realization of the quantum Toffoli gate with trapped ions Phys. Rev. Lett. 102, 040501 (2009) Lanyon, BP; Barbieri, M; Almeida, MP; et al. Simplifying quantum logic using higher dimensional Hilbert spaces Nat. Phys. 5, 134 (2009) Realization of the quantum Toffoli gate Outline 1. Motivation 2. Principles of the quantum Toffoli gate 3. Implementation with trapped ions 4. Implementation with photons 5. Comparison and conclusion 6. Summary 6. Dezember 2010 Jakob Buhmann Jeffrey Gehrig 1 Realization of the quantum Toffoli gate 1. Motivation • Universal quantum logic gate sets are needed to implement algorithms • Implementation of algorithms is difficult due to the finite fidelity and large amount of gates • Use of other degrees of freedom to store information • Reduction of complexity and runtime 6. Dezember 2010 Jakob Buhmann Jeffrey Gehrig 2 Realization of the quantum Toffoli gate 2. Principles of the Toffoli gate • Three-qubit gate (C1, C2, T) • Logic flip of T depending on (C1 AND C2) Truth table Matrix form Input Output C1 C2 T C1 C2 T 0 0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 1 0 1 1 1 0 1 1 1 1 1 1 1 1 0 6. Dezember 2010 Jakob Buhmann Jeffrey Gehrig 3 Realization of the quantum Toffoli gate 2. Principles of the Toffoli gate • Qubit Implementation • Qutrit Implementation Qutrit states: and 6.
    [Show full text]
  • Machine Learning for Designing Fast Quantum Gates
    University of Calgary PRISM: University of Calgary's Digital Repository Graduate Studies The Vault: Electronic Theses and Dissertations 2016-01-26 Machine Learning for Designing Fast Quantum Gates Zahedinejad, Ehsan Zahedinejad, E. (2016). Machine Learning for Designing Fast Quantum Gates (Unpublished doctoral thesis). University of Calgary, Calgary, AB. doi:10.11575/PRISM/26805 http://hdl.handle.net/11023/2780 doctoral thesis University of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission. Downloaded from PRISM: https://prism.ucalgary.ca UNIVERSITY OF CALGARY Machine Learning for Designing Fast Quantum Gates by Ehsan Zahedinejad A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY GRADUATE PROGRAM IN PHYSICS AND ASTRONOMY CALGARY, ALBERTA January, 2016 c Ehsan Zahedinejad 2016 Abstract Fault-tolerant quantum computing requires encoding the quantum information into logical qubits and performing the quantum information processing in a code-space. Quantum error correction codes, then, can be employed to diagnose and remove the possible errors in the quantum information, thereby avoiding the loss of information. Although a series of single- and two-qubit gates can be employed to construct a quan- tum error correcting circuit, however this decomposition approach is not practically desirable because it leads to circuits with long operation times. An alternative ap- proach to designing a fast quantum circuit is to design quantum gates that act on a multi-qubit gate.
    [Show full text]
  • Arxiv:2010.00046V2 [Hep-Ph] 13 Oct 2020
    IPPP/20/41 Towards a Quantum Computing Algorithm for Helicity Amplitudes and Parton Showers Khadeejah Bepari,a Sarah Malik,b Michael Spannowskya and Simon Williamsb aInstitute for Particle Physics Phenomenology, Department of Physics, Durham University, Durham DH1 3LE, U.K. bHigh Energy Physics Group, Blackett Laboratory, Imperial College, Prince Consort Road, London, SW7 2AZ, United Kingdom E-mail: [email protected], [email protected], [email protected], [email protected] Abstract: The interpretation of measurements of high-energy particle collisions relies heavily on the performance of full event generators. By far the largest amount of time to predict the kinematics of multi-particle final states is dedicated to the calculation of the hard process and the subsequent parton shower step. With the continuous improvement of quantum devices, dedicated algorithms are needed to exploit the potential quantum computers can provide. We propose general and extendable algorithms for quantum gate computers to facilitate calculations of helicity amplitudes and the parton shower process. The helicity amplitude calculation exploits the equivalence between spinors and qubits and the unique features of a quantum computer to compute the helicities of each particle in- volved simultaneously, thus fully utilising the quantum nature of the computation. This advantage over classical computers is further exploited by the simultaneous computation of s and t-channel amplitudes for a 2 2 process. The parton shower algorithm simulates ! collinear emission for a two-step, discrete parton shower. In contrast to classical imple- mentations, the quantum algorithm constructs a wavefunction with a superposition of all shower histories for the whole parton shower process, thus removing the need to explicitly keep track of individual shower histories.
    [Show full text]
  • Design of Regular Reversible Quantum Circuits
    Portland State University PDXScholar Dissertations and Theses Dissertations and Theses 1-1-2010 Design of Regular Reversible Quantum Circuits Dipal Shah Portland State University Follow this and additional works at: https://pdxscholar.library.pdx.edu/open_access_etds Let us know how access to this document benefits ou.y Recommended Citation Shah, Dipal, "Design of Regular Reversible Quantum Circuits" (2010). Dissertations and Theses. Paper 129. https://doi.org/10.15760/etd.129 This Dissertation is brought to you for free and open access. It has been accepted for inclusion in Dissertations and Theses by an authorized administrator of PDXScholar. Please contact us if we can make this document more accessible: [email protected]. Design of Regular Reversible Quantum Circuits by Dipal Shah A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering Dissertation Committee: Marek A. Perkowski, Chair Garrison Greenwood Xiaoyu Song Cynthia Brown Laszlo Csanky Portland State University © 2010 ABSTRACT The computing power in terms of speed and capacity of today's digital computers has improved tremendously in the last decade. This improvement came mainly due to a revolution in manufacturing technology by developing the ability to manufacture smaller devices and by integrating more devices on a single die. Further development of the current technology will be restricted by physical limits since it won't be possible to shrink devices beyond a certain size. Eventually, classical electrical circuits will encounter the barrier of quantum mechanics. The laws of quantum mechanics can be used for building computing systems that work on the principles of quantum mechanics.
    [Show full text]
  • Reinforcement Learning for Optimization of Variational Quantum Circuit Architectures”
    REINFORCEMENT LEARNING FOR OPTIMIZATION OF VARIATIONAL QUANTUM CIRCUIT ARCHITECTURES Mateusz Ostaszewski Lea M. Trenkwalder Institute of Theoretical and Applied Informatics, Institute for Theoretical Physics, Polish Academy of Sciences, University of Innsbruck Gliwice, Poland Innsbruck, Austria [email protected], [email protected], Wojciech Masarczyk Warsaw University of Technology, Warsaw, Poland [email protected], Eleanor Scerri Vedran Dunjko Leiden University, Leiden University, Leiden, The Netherlands Leiden, The Netherlands [email protected], [email protected] March 31, 2021 ABSTRACT The study of Variational Quantum Eigensolvers (VQEs) has been in the spotlight in recent times as they may lead to real-world applications of near term quantum devices. However, their perfor- mance depends on the structure of the used variational ansatz, which requires balancing the depth and expressivity of the corresponding circuit. In recent years, various methods for VQE structure optimization have been introduced but capacities of machine learning to aid with this problem has not yet been fully investigated. In this work, we propose a reinforcement learning algorithm that autonomously explores the space of possible ansatze,¨ identifying economic circuits which still yield accurate ground energy estimates. The algorithm is intrinsically motivated, and it incrementally im- proves the accuracy of the result while minimizing the circuit depth. We showcase the performance or our algorithm on the problem of estimating the ground-state energy of lithium hydride (LiH). In this well-known benchmark problem, we achieve chemical accuracy, as well as state-of-the-art results in terms of circuit depth. arXiv:2103.16089v1 [quant-ph] 30 Mar 2021 1 Introduction As we are entering the so called Noisy Intermediate Scale Quantum (NISQ) [1] technology era, the search for more suitable algorithms under NISQ restrictions is becoming ever more important.
    [Show full text]
  • An Extended Approach for Generating Unitary Matrices for Quantum Circuits
    Computers, Materials & Continua CMC, vol.62, no.3, pp.1413-1421, 2020 An Extended Approach for Generating Unitary Matrices for Quantum Circuits Zhiqiang Li1, *, Wei Zhang1, Gaoman Zhang1, Juan Dai1, Jiajia Hu1, Marek Perkowski2 and Xiaoyu Song2 Abstract: In this paper, we do research on generating unitary matrices for quantum circuits automatically. We consider that quantum circuits are divided into six types, and the unitary operator expressions for each type are offered. Based on this, we propose an algorithm for computing the circuit unitary matrices in detail. Then, for quantum logic circuits composed of quantum logic gates, a faster method to compute unitary matrices of quantum circuits with truth table is introduced as a supplement. Finally, we apply the proposed algorithm to different reversible benchmark circuits based on NCT library (including NOT gate, Controlled-NOT gate, Toffoli gate) and generalized Toffoli (GT) library and provide our experimental results. Keywords: Quantum circuit, unitary matrix, quantum logic gate, reversible circuit, truth table. 1 Introduction Quantum computation has become a very active and promising field of research and machine learning has been transformed a lot through the introduction of quantum computing [Liu, Gao, Wang et al. (2019)]. Quantum computation has gained a lot of advances in experimental physics and engineering which have made possible to build the quantum computer prototypes. A quantum computer is built from a quantum circuit containing wires and elementary quantum gates to carry around and manipulate the quantum information. In this respect, quantum gates and quantum circuits play an essential role in quantum computation. Usually, we utilize a unitary matrix to describe the quantum gate.
    [Show full text]
  • A Quantum-Logic Gate Between Distant Quantum-Network Modules
    A Quantum-Logic Gate between Distant Quantum-Network Modules Severin Daiss,1, ∗, y Stefan Langenfeld,1, y Stephan Welte,1 Emanuele Distante,1, 2 Philip Thomas,1 Lukas Hartung,1 Olivier Morin,1 and Gerhard Rempe1 1Max-Planck-Institut fur¨ Quantenoptik, Hans-Kopfermann-Strasse 1, 85748 Garching, Germany 2ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Mediterranean Technology Park, 08860 Castelldefels (Barcelona), Spain The big challenge in quantum computing is to realize scalable multi-qubit systems with cross-talk free addressability and efficient coupling of arbitrarily selected qubits. Quantum networks promise a solution by integrating smaller qubit modules to a larger computing cluster. Such a distributed architecture, however, requires the capability to execute quantum-logic gates between distant qubits. Here we experimentally realize such a gate over a distance of 60m. We employ an ancillary photon that we successively reflect from two remote qubit modules, followed by a heralding photon detection which triggers a final qubit rotation. We use the gate for remote entanglement creation of all four Bell states. Our non-local quantum-logic gate could be extended both to multiple qubits and many modules for a tailor-made multi-qubit computing register. Quantum computers promise the capability to solve problems classical communication [15]. The general working principle that cannot be dealt with by classical machines [1]. Despite re- has first been demonstrated with photonic systems based on cent progress with local qubit arrays [2–4], foreseeable imple- linear optical quantum computing [16, 17] and, more recently, mentations of quantum computers are limited in the number of in isolated setups with material qubits like superconductors in individually controllable and mutually coupleable qubits held a single cryostat [18] and ions in a single Paul trap [19].
    [Show full text]
  • Chapter 2 Quantum Gates
    Chapter 2 Quantum Gates “When we get to the very, very small world—say circuits of seven atoms—we have a lot of new things that would happen that represent completely new opportunities for design. Atoms on a small scale behave like nothing on a large scale, for they satisfy the laws of quantum mechanics. So, as we go down and fiddle around with the atoms down there, we are working with different laws, and we can expect to do different things. We can manufacture in different ways. We can use, not just circuits, but some system involving the quantized energy levels, or the interactions of quantized spins.” – Richard P. Feynman1 Currently, the circuit model of a computer is the most useful abstraction of the computing process and is widely used in the computer industry in the design and construction of practical computing hardware. In the circuit model, computer scien- tists regard any computation as being equivalent to the action of a circuit built out of a handful of different types of Boolean logic gates acting on some binary (i.e., bit string) input. Each logic gate transforms its input bits into one or more output bits in some deterministic fashion according to the definition of the gate. By compos- ing the gates in a graph such that the outputs from earlier gates feed into the inputs of later gates, computer scientists can prove that any feasible computation can be performed. In this chapter we will look at the types of logic gates used within circuits and how the notions of logic gates need to be modified in the quantum context.
    [Show full text]
  • Quantum Information Technology Based on Single Electron Dynamics
    Selected Papers Quantum Information Technology based on Single Electron Dynamics Toshimasa Fujisawa† Abstract Quantum information technology promises powerful information processing based on the control of the dynamics of individual particles. Research on single electron dynamics aiming at the coherent elec- trical manipulation of single electron charge and spin in semiconductor quantum dots is expected to pro- vide practical quantum information technology. A single electron charge quantum bit (qubit), which has recently been realized in a double quantum dot, is advantageous for flexible control of the quantum state by a high-speed electrical signal, while a single electron spin qubit is expected to have a sufficiently long decoherence time. This paper reviews our research on single electron dynamics for quantum information processing. 1. Introduction Although the potential of quantum computing is fascinating, only a few small-scale quantum comput- Quantum information technology seeks to manipu- ers have been built. Practical quantum computing late quantum states by coherent time evolution, in hardware with a large number of qubits is strongly which the bases of the quantum state are regarded as desired. Recently, coherent control of quantum states digital information. By analogy to a bit, the unit of in a nanostructure has been attracting growing inter- classical digital information, the unit of quantum est for flexible control of many qubits [2]. Single information is a quantum bit (qubit), which can basi- electron dynamics, which describes the dynamical cally be realized in any single two-level system. Var- response of a single-electron in nanostructures, is one ious types of information processing based on qubits of the best candidates for useful quantum information have been proposed and demonstrated [1].
    [Show full text]