Towards Large-Scale Quantum Computation
arXiv:quant-ph/0506126
Abstract
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-qubit fault-tolerant gates is described and applied to the specific case of the remaining rotation gates required by Shor's algorithm.
PhD thesis, 185 pages, 59 figures, combination of articles quant-ph/0207103, quant-ph/0306018, quant-ph/0311116, quant-ph/0402077, quant-ph/0402196, quant-ph/0411206 and other research together with additional discussion and review material
References in corpus (124)
- Fault-tolerant quantum computation by anyons
- Quantum Computation with Quantum Dots
- Mixed State Entanglement and Quantum Error Correction
- Entanglement of a Pair of Quantum Bits
- Good Quantum Error-Correcting Codes Exist
- The Physical Implementation of Quantum Computation
- Quantum state transfer and entanglement distribution among distant nodes in a quantum network
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Persistent entanglement in arrays of interacting particles
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Measurement-based quantum computation with cluster states
- Coupled quantum dots as quantum gates
- Measurement of conditional phase shifts for quantum logic
- Security of quantum key distribution using d-level systems
- Quantum Algorithms Revisited
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Quantum Computing with Very Noisy Devices
- Controlling Spin Exchange Interactions of Ultracold Atoms in Optical Lattices
- Two-Bit Gates are Universal for Quantum Computation
- Multi-party entanglement in graph states
- A Theory of Fault-Tolerant Quantum Computation
- Electron Spin Resonance Transistors for Quantum Computing in Silicon-Germanium Heterostructures
- Quantum Networks for Elementary Arithmetic Operations
- Geometric quantum computation with NMR
- Entanglement of atoms via cold controlled collisions
- Time Optimal Control in Spin Systems
- Josephson-Junction Qubits with Controlled Couplings
- Quantum Logic Gates in Optical Lattices
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Optical quantum computation using cluster states
- Quantum measurements and the Abelian Stabilizer Problem
- Optimal Creation of Entanglement Using a Two--Qubit Gate
- Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
- A geometric theory of non-local two-qubit operations
- Electron Spin-Relaxation Times of Phosphorus Donors in Silicon
- Efficient Simulation of Quantum Systems by Quantum Computers
- Overhead and noise threshold of fault-tolerant quantum error correction
- Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
- An approximate Fourier transform useful in quantum factoring
- Charge-based quantum computing using single donors in semiconductors
- A practical scheme for quantum computation with any two-qubit entangling gate
- Exchange in silicon-based quantum computer architecture
- An all silicon quantum computer
- Efficient Networks for Quantum Factoring
- 1/2-Anyons in small atomic Bose-Einstein condensates
- Approximate quantum error correction can lead to better codes
- Multiparticle entanglement purification for graph states
- Implementation of the Five Qubit Error Correction Benchmark
- Addition on a Quantum Computer
- Hydrogenic Spin Quantum Computing in Silicon: A Digital Approach
- Fast Quantum Modular Exponentiation
- Quantum Computation in Quantum-Hall Systems
- Geometric quantum gates robust against stochastic control errors
- Quantum computation based on d-level cluster states
- Fault-tolerant quantum computation with cluster states
- Spintronics and Quantum Dots for Quantum Computing and Quantum Communication
- Quantum Computation with a One-Dimensional Optical Lattice
- Electron spin coherence in semiconductors: Considerations for a spin-based solid state quantum computer architecture
- Anyon computers with smaller groups
- Efficient factorization with a single pure qubit and mixed qubits
- Semiconductor-based Geometrical Quantum Gates
- Decoherence and dissipation during a quantum XOR gate operation
- Anyons from non-solvable finite groups are sufficient for universal quantum computation
- Fault-Tolerant Quantum Computation with Local Gates
- Local Fault-tolerant Quantum Computation
- Polynomial-Time Simulation of Pairing Models on a Quantum Computer
- Quantum key distribution for d-level systems with generalized Bell states
- Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes
- Pattern recognition on a quantum computer
- Silicon quantum computation based on magnetic dipolar coupling
- Characterization of non-local gates
- Global control and fast solid-state donor electron spin quantum computing
- Fault-Tolerant Postselected Quantum Computation: Schemes
- Fast versions of Shor's quantum factoring algorithm
- Electron Exchange Coupling for Single Donor Solid-State Qubits
- Scalability of Shor's algorithm with a limited set of rotation gates
- Quantum Error Correction on Linear Nearest Neighbor Qubit Arrays
- Scalable solid-state quantum processor using subradiant two-atom states
- Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
- Quantum Sub-Gaussian Mean Estimator
- Fast quantum algorithms for numerical integrals and stochastic processes
- Implementation of a quantum algorithm to solve Bernstein-Vazirani's parity problem without entanglement on an ensemble quantum computer
- Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
- Numerical study of hydrogenic effective mass theory for an impurity P donor in Si in the presence of an electric field and interfaces
- Two-electron quantum dots as scalable qubits
- Quantum Carry-Save Arithmetic
- Eigenvector Approximation Leading to Exponential Speedup of Quantum Eigenvalue Calculation
- Qudit Entanglement
- Single-spin readout for buried dopant semiconductor qubits
- Quantum Computing with Atomic Josephson Junction Arrays
- Improved ancilla preparation scheme increases fault-tolerant threshold
- Perfect quantum error correction coding in 24 laser pulses
- Lower bounds on the complexity of simulating quantum gates
- Time Scales of Phonon Induced Decoherence of Semiconductor Spin Qubits
- Effects of noise on quantum error correction algorithms
- Faithful Teleportation with Partially Entangled States
- Inequivalent classes of interference experiments with non-abelian anyons
- Spin Dephasing in the Extended Strong Collision Approximation
- Electrical readout of a spin qubit without double occupancy
- Fast Non-Adiabatic Two Qubit Gates for the Kane Quantum Computer
- Fast fault-tolerant filtering of quantum codewords
- Decoherence and dephasing in spin-based solid state quantum computers
- Quantum searching with continuous variables
- Error Rate of the Kane Quantum Computer CNOT Gate in the Presence of Dephasing
- Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control
- Stabilizer Codes for Continuous-variable Quantum Error Correction
- Gates for the Kane Quantum Computer in the Presence of Dephasing
- Voltage Control of Exchange Coupling in Phosphorus Doped Silicon
- Quantum Computing of Poincare Recurrences and Periodic Orbits
- Simulations of the adiabatic quantum optimization for the Set Partition Problem
- Effects of J-gate potential and interfaces on donor exchange coupling in the Kane quantum computer architecture
- Dynamics of quantum adiabatic evolution algorithm for Number Partitioning
- Quantum Computation of Jones' Polynomials
- Acceptor-based silicon quantum computing
- Generalization of the Deutsch algorithm using two qudits
- Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices with Fewer CNOTs
- Charge based quantum computer without charge transfer
- Simulating the Effects of Quantum Error-correction Schemes
- Solid-state NMR quantum computer with individual access to qubits and some its ensemble developments
- The Continuous Variable Quantum Teleportation Controversy
- Quantum teleportation using cluster states
- Algorithms on Ensemble Quantum Computers
- On implementation of ferrite magnetostatic/magnetoelectric particles for quantum computation
- Quantum error correcting codes and one-way quantum computing: Towards a quantum memory
Cited by in corpus (7)
- Quantum Error Correction for Beginners
- Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target
- Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
- Improved quantum hypergraph-product LDPC codes
- Low-complexity quantum codes designed via codeword-stabilized framework
- Adaptation of the Alicki-Fannes-Winter method for the set of states with bounded energy and its use
- Structured Error Recovery for Codeword-Stabilized Quantum Codes