Scalability of Shor's algorithm with a limited set of rotation gates
Austin G. Fowler, Lloyd C. L. Hollenberg
备注：
Substantially revised version, twice as long as original. Two tables converted into one 8-part figure, new section added on the construction of arbitrary single-qubit rotations using only the fault-tolerant gate set. Substantial additional discussion and explanatory figures added throughout. (8 pages, 6 figures)
Typical circuit implementations of Shor's algorithm involve controlled rotation gates of magnitude $π/2^{2L}$ where $L$ is the binary length of the integer N to be factored. Such gates cannot be implemented exactly using existing fault-tolerant techniques. Approximating a given controlled $π/2^{d}$ rotation gate to within $δ=O(1/2^{d})$ currently requires both a number of qubits and number of fault-tolerant gates that grows polynomially with $d$. In this paper we show that this additional growth in space and time complexity would severely limit the applicability of Shor's algorithm to large integers. Consequently, we study in detail the effect of using only controlled rotation gates with $d$ less than or equal to some $d_{\rm max}$. It is found that integers up to length $L_{\rm max} = O(4^{d_{\rm max}})$ can be factored without significant performance penalty implying that the cumbersome techniques of fault-tolerant computation only need to be used to create controlled rotation gates of magnitude $π/64$ if integers thousands of bits long are desired factored. Explicit fault-tolerant constructions of such gates are also discussed.
High-quality two-qubit gate operations are crucial for scalable quantum information processing. Often, the gate fidelity is compromised when the system becomes more integrated. Therefore, a low-error-rate, easy-to-scale two-qubit gate scheme is highly desirable. Here, we experimentally demonstrate a new two-qubit gate scheme that exploits fixed-frequency qubits and a tunable coupler in a superconducting quantum circuit. The scheme requires less control lines, reduces crosstalk effect, simplifies calibration procedures, yet produces a controlled-Z gate in 30ns with a high fidelity of 99.5%, der…
We make a detailed analysis of error mechanisms, gate fidelity, and scalability of proposals for quantum computation with neutral atoms in addressable (large lattice constant) optical lattices. We have identified possible limits to the size of quantum computations, arising in 3D optical lattices from current limitations on the ability to perform single qubit gates in parallel and in 2D lattices from constraints on laser power. Our results suggest that 3D arrays as large as 100 x 100 x 100 sites (i.e., $\sim 10^6$ qubits) may be achievable, provided two-qubit gates can be performed with suffici…
Large-scale digital quantum simulations require thousands of fundamental entangling gates to construct the simulated dynamics. Despite success in a variety of small-scale simulations, quantum information processing platforms have hitherto failed to demonstrate the combination of precise control and scalability required to systematically outmatch classical simulators. We analyse how fast gates could enable trapped-ion quantum processors to achieve the requisite scalability to outperform classical computers without error correction. We analyze the performance of a large-scale digital simulator, …
Scalability of today's superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature. One active research area in both industry and academia is to push the classical controllers to the dilution refrigerator in order to increase the scalability of quantum computers. Superconducting Single Flux Quantum (SFQ) is a classical logic technology with low power consumption and ultra-high speed, and thus is a promising candidate for in-fridge classical controllers with maximized scalability. Prior work has demonstrated h…
We report an experimental evaluation of the "input-output surface" for a biochemical AND gate. The obtained data are modeled within the rate-equation approach, with the aim to map out the gate function and cast it in the language of logic variables appropriate for analysis of Boolean logic for scalability. In order to minimize "analog" noise, we consider a theoretical approach for determining an optimal set for the process parameters to minimize "analog" noise amplification for gate concatenation. We establish that under optimized conditions, presently studied biochemical gates can be concaten…
We propose an alternative scheme of shortcuts to quantum phase gate in a much shorter time based on the approach of Lewis-Riesenfeld invariants in cavity quantum electronic dynamics (QED) systems. This scheme can be used to perform one-qubit phase gate, two-qubit controlled phase gate and also multiqubit controlled phase gate. The strict numerical simulation for some quantum gates are given, and demonstrate that the total operation time of our scheme is shorter than previous schemes and very robustness against decoherence.
The Toffoli gate serving as a basic building block for reversible quantum computation, has manifested its great potentials in improving the error-tolerant rate in quantum communication. While current route to the creation of Toffoli gate requires implementing sequential single- and two-qubit gates, limited by longer operation time and lower average fidelity. We develop a new theoretical protocol to construct a universal $(n+1)$-qubit Toffoli gate sphere based on the Rydberg blockade mechanism, by constraining the behavior of one central target atom with $n$ surrounding control atoms. Its merit…
The effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with combined errors. It is found that Shor's algorithm is robust against the systematic errors but is vulnerable to the random errors. Error threshold is given to the algorithm for a given number $N$ to be factorized.
The effects of imperfect gate operations in implementation of Shor's prime factorization algorithm are investigated. The gate imperfections may be classified into three categories: the systematic error, the random error, and the one with combined errors. It is found that Shor's algorithm is robust against the systematic errors but is vulnerable to the random errors. Error threshold is given to the algorithm for a given number $N$ to be factorized.
Fault-tolerant quantum computation using quantum error-correcting codes requires fault-tolerant constructions of nontransversal gates. Shor proposed a fault-tolerant construction of a nontransversal gate, i.e., the Toffoli gate for a family of the Calderbank-Shor-Steane codes which has even-weight stabilizer generators and odd-weight logical operators. In fact, as shown in this paper, error propagations in the ancilla preparation of Shor's construction lead to logical errors. This work provides a solution to this problem through the insertion of bit flip error correction. Finally, error rates …
For a frequency-tunable two-qubit system, a controlled-Z (CZ) gate can be realized by adiabatically driving the qubit system through an avoided level crossing between an auxiliary state and computational levels. Here, we theoretically propose a fast CZ gate using a shortcut-to-adiabaticity (STA). Experimentally, the STA CZ gate is implemented with a 52 ns control pulse for two coupled superconducting Xmon qubits. Measured fidelity of the STA CZ gate is higher than 96.0%, in both quantum process tomography and randomized benchmarking. The protocol allows a flexible design of the evolution time …
We analyse the design and optimisation of quantum logic circuits suitable for the experimental demonstration of a three-qubit quantum computation prototype based on optically-controlled, solid-state quantum logic gates. In these gates, the interaction between two qubits carried by the electron-spin of donors is mediated by the optical excitation of a control particle placed in their proximity. First, we use a geometrical approach for analysing the entangling characteristics of these quantum gates. Then, using a genetic programming algorithm, we develop circuits for the refined Deutsch-Jozsa al…
Quantum information science addresses how the processing and transmission of information are affected by uniquely quantum mechanical phenomena. Combination of two-qubit gates has been used to realize quantum circuits, however, scalability is becoming a critical problem. The use of three-qubit gates may simplify the structure of quantum circuits dramatically. Among them, the controlled-SWAP (Fredkin) gates are essential since they can be directly applied to important protocols, e.g., error correction, fingerprinting, and optimal cloning. Here we report a realization of the Fredkin gate for phot…
The scalability of solid state quantum computation relies on the ability of connecting the qubits to the macroscopic world. Quantum chains can be used as quantum wires to keep regions of external control at a distance. However even in the absence of external noise their transfer fidelity is too low to assure reliable connections. We propose a method of optimizing the fidelity by minimal usage of the available resources, consisting of applying a suitable sequence of two-qubit gates at the end of the chain. Our scheme allows also the preparation of states in the first excitation sector as well a…
We present a fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes. Transversal non-Clifford gates on these codes are intriguing in that higher levels of the Clifford hierarchy become accessible as the code becomes more asymmetric. For instance, in an appropriate gauge, Bacon-Shor codes on an $m\times m^k$ lattice have transversal $k$-qubit-controlled $Z$. Through a variety of tricks, including intermediate error-correction and non-Pauli recovery, we reduce the overhead required for fault-tolerant CCZ. We calculate pseudothresh…
In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should assumed to be failure prone. In the logical limit of this architecture each component contains only one qubit. Here we derive thresholds for fault tolerant quantum computation under such extreme paradigms. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded,…
We propose various composite $π$-pulse sequences for implementing robust z-axis rotation gates widely used in quantum information processing (QIP) scenarios, and discuss their error tolerance of the pulse strength error (PSE) and off-resonance error (ORE), i.e., two typical systematic errors in NMR systems. Compared to existing composite gates, our designed composite pulses exhibit higher gate fidelity and shorter sequence time cost. Furthermore, such short pulse sequences are generalized by simple analytic formulas which can suppress these errors to any desired order simultaneously with linea…
We develop a scheme for fault-tolerant quantum computation based on asymmetric Bacon-Shor codes, which works effectively against highly biased noise dominated by dephasing. We find the optimal Bacon-Shor block size as a function of the noise strength and the noise bias, and estimate the logical error rate and overhead cost achieved by this optimal code. Our fault-tolerant gadgets, based on gate teleportation, are well suited for hardware platforms with geometrically local gates in two dimensions.
Quantum computation may well be performed with the use of electric circuits. Especially, the Schrödinger equation can be simulated by the lumped-element model of transmission lines, which is applicable to low-frequency electric circuits. In this paper, we show that the Dirac equation is simulated by the distributed-element model, which is applicable to high-frequency electric circuits. Then, a set of universal quantum gates (the Hadamard, phase-shift and CNOT gates) are constructed by networks made of transmission lines. We demonstrate Shor's prime factorization based on electric circuits. It …
This thesis deals with a series of quantum computer implementation issues from the Kane 31P in 28Si architecture to Shor's integer factoring algorithm and beyond. The discussion begins with simulations of the adiabatic Kane CNOT and readout gates, followed by linear nearest neighbor implementations of 5-qubit quantum error correction with and without fast measurement. A linear nearest neighbor circuit implementing Shor's algorithm is presented, then modified to remove the need for exponentially small rotation gates. Finally, a method of constructing optimal approximations of arbitrary single-q…
It has been proved that surface plasmon polariton (SPP) can well conserve and transmit the quantum nature of entangled photons. Therefore, further utilization and manipulation of such quantum nature of SPP in a plasmonic chip will be the next task for scientists in this field. In quantum logic circuits, the controlled-NOT (CNOT) gate is the key building block. Here, we implement the first plasmonic quantum CNOT gate with several-micrometer footprint by utilizing a single polarization-dependent beam-splitter (PDBS) fabricated on the dielectric-loaded SPP waveguide (DLSPPW). The quantum logic fu…
Current quantum programs are mostly synthesized and compiled on the gate-level, where quantum circuits are composed of quantum gates. The gate-level workflow, however, introduces significant redundancy when quantum gates are eventually transformed into control signals and applied on quantum devices. For superconducting quantum computers, the control signals are microwave pulses. Therefore, pulse-level optimization has gained more attention from researchers due to their advantages in terms of circuit duration. Recent works, however, are limited by their poor scalability brought by the large par…
Photonic integrated circuits play a central role in current and future applications such as communications, sensing, ranging, and information processing. Photonic quantum computing will also likely require an integrated optics architecture for improved stability, scalability, and performance. Fault-tolerant quantum computing mandates very accurate and robust quantum gates. In this work, we demonstrate high-fidelity directional couplers for single-qubit gates in photonic integrated waveguides, utilizing a novel scheme of detuning-modulated composite segments. Specific designs for reduced sensit…
We present a theoretical analysis of the selective darkening method for implementing quantum controlled-NOT (CNOT) gates. This method, which we recently proposed and demonstrated, consists of driving two transversely-coupled quantum bits (qubits) with a driving field that is resonant with one of the two qubits. For specific relative amplitudes and phases of the driving field felt by the two qubits, one of the two transitions in the degenerate pair is darkened, or in other words, becomes forbidden by effective selection rules. At these driving conditions, the evolution of the two-qubit state re…
