Methodology for quantum logic gate constructions

Abstract

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 {\bf 402}, 390, 1999) and leads to straightforward and systematic construction of many fault-tolerant encoded operations, including the $\pi /8$ and Toffoli gates. The technique can also be applied to the construction of remote quantum operations that cannot be directly performed.

17 pages, mypsfig2, revtex. Revised with a different title, a new appendix for clarifying fault-tolerant preparation of quantum states, and various minor changes

References in corpus (1)

• Quantum Teleportation is a Universal Computational Primitive

Cited by in corpus (181)

• Photonic quantum technologies
• Encoding a qubit in an oscillator
• Quantum Error Correction for Quantum Memories
• Quantum Computing with Very Noisy Devices
• Universal Quantum Computation with Continuous-Variable Cluster States
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Restrictions on Transversal Encoded Quantum Gate Sets
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Cluster-state quantum computation
• Distributed Quantum Computation Based-on Small Quantum Registers
• Quantum Repeater with Encoding
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state
• Novel constructions for the fault-tolerant Toffoli gate
• Fault-tolerant quantum computation against biased noise
• Quantum computing on encrypted data
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Unified derivations of measurement-based schemes for quantum computation
• Discrete Wigner functions and quantum computational speedup
• Quantifying the magic of quantum channels
• Machine learning for long-distance quantum communication
• Efficiently computable bounds for magic state distillation
• Quantum accuracy threshold for concatenated distance-3 codes
• Architectures for quantum simulation showing a quantum speedup
• Demonstration of deterministic and high fidelity squeezing of quantum information
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Error-corrected gates on an encoded qubit
• Stabilizer entropies are monotones for magic-state resource theory
• Benchmarking a Teleportation Protocol realized in Superconducting Circuits
• Entangling power and operator entanglement in qudit systems
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Noise thresholds for optical cluster-state quantum computation
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• Principles of Quantum Communication Theory: A Modern Approach
• Quantum-Assisted Telescope Arrays
• Computation by measurements: a unifying picture
• Quantum homomorphic encryption from quantum codes
• Universal linear Bogoliubov transformations through one-way quantum computation
• Simulation of many-body interactions by conditional geometric phases
• How to Verify a Quantum Computation
• Dynamical Magic Transitions in Monitored Clifford+T Circuits
• Optimized compiler for Distributed Quantum Computing
• Demonstration of a universal one-way quantum quadratic phase gate
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Delegating Private Quantum Computations
• Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
• Continuous-variable and hybrid quantum gates
• Fault-Tolerant Logical Gate Networks for CSS Codes
• Comparing the Overhead of Topological and Concatenated Quantum Error Correction
• Semi-Clifford operations, structure of ${\mathcal{C}}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation
• Examples of Gaussian cluster computation
• Lower bound for the T count via unitary stabilizer nullity
• Two-qubit Projective Measurements are Universal for Quantum Computation
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Fault-tolerant gates on hypergraph product codes
• Error mitigation and quantum-assisted simulation in the error corrected regime
• Level Reduction and the Quantum Threshold Theorem
• Partitioning qubits in hypergraph product codes to implement logical gates
• T-count and T-depth of any multi-qubit unitary
• Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
• Designing a Million-Qubit Quantum Computer Using Resource Performance Simulator
• Fast estimation of outcome probabilities for quantum circuits
• Qudit quantum computation on matrix product states with global symmetry
• Gauge color codes in two dimensions
• Entanglement-efficient bipartite-distributed quantum computing
• Measurement-Based Quantum Computation
• Quantum transduction with adaptive control
• Scalable Networking of Neutral-Atom Qubits: Nanofiber-Based Approach for Multiprocessor Fault-Tolerant Quantum Computer
• Universal quantum computation by holonomic and nonlocal gates with imperfections
• Imaging stars with quantum error correction
• Types of quantum information
• Avoiding coherent errors with rotated concatenated stabilizer codes
• Quantum Circuit Design for Objective Function Maximization in Gate-Model Quantum Computers
• Overcoming the Coherence Time Barrier in Quantum Machine Learning on Temporal Data
• Permutation-invariant quantum coding for quantum deletion channels
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Secret key rates for an encoded quantum repeater
• Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Non-Clifford gate on optical qubits by nonlinear feedforward
• Towards Robust Quantum Computation
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Decomposition of bipartite and multipartite unitary gates into the product of controlled unitary gates
• Computing on quantum shared secrets
• Circuit-based leakage-to-erasure conversion in a neutral atom quantum processor
• Universal fault-tolerant quantum computation with Bacon-Shor codes
• Measurement-Based Quantum Computing with Valence-Bond-Solids
• One-Shot Yield-Cost Relations in General Quantum Resource Theories
• Quantum Error Correction with the GKP Code and Concatenation with Stabilizer Codes
• Cluster-based architecture for fault-tolerant quantum computation
• Secure assisted quantum computation
• Scheme for fault-tolerant holonomic computation on stabilizer codes
• Error rates and resource overheads of encoded three-qubit gates
• State-injection schemes of quantum computation in Spekkens' toy theory
• Efficient quantum gate teleportation in higher dimensions
• Un-Weyl-ing the Clifford Hierarchy
• Logic Synthesis for Fault-Tolerant Quantum Computers
• Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
• Quantum Internet: Technologies, Protocols, and Research Challenges
• Holographic Software for Quantum Networks
• Quantum circuit compilation and hybrid computation using Pauli-based computation
• A Regular Representation of Quantum Circuits
• Thresholds for Linear Optics Quantum Computing with Photon Loss at the Detectors
• An introduction to one-way quantum computing in distributed architectures
• Continuous-variable quantum non-demolishing interaction at a distance
• Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes
• Bipartite Entanglement in Continuous-Variable Cluster States
• Stabilizer Quantum Error Correction with Qubus Computation
• State Stabilization for Gate-Model Quantum Computers
• Quantum Circuit Mapping for Universal and Scalable Computing in MZI-based Integrated Photonics
• Simulation of a Dynamic, RuleSet-based Quantum Network
• Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
• T-count Optimized Design of Quantum Integer Multiplication
• Scalable Quantum Networks based on Few-Qubit Registers
• Choi states, symmetry-based quantum gate teleportation, and stored-program quantum computing
• Computation with Coherent States via Teleportations to and from a Quantum Bus
• Quantum Logical Gates with Linear Quadripartite Cluster States of Continuous Variables
• Constructive Simulation and Topological Design of Protocols
• Transversality versus Universality for Additive Quantum Codes
• Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
• Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation
• Systematic Design and Optimization of Quantum Circuits for Stabilizer Codes
• Efficient Clifford+T approximation of single-qubit operators
• Limitations of Classically-Simulable Measurements for Quantum State Discrimination
• Optically Loaded Semiconductor Quantum Memory Register
• Pauli-based model of quantum computation with higher-dimensional systems
• Local implementations of non-local quantum gates in linear entangled channel
• Implementation of bipartite or remote unitary gates with repeater nodes
• Everything You Always Wanted to Know About Quantum Circuits
• Code switching revisited: Low-overhead magic state preparation using color codes
• Accelerating Quantum Algorithms with Precomputation
• Entanglement and non-locality in quantum protocols with identical particles
• Computing on Quantum Shared Secrets for General Quantum Access Structures
• Graphical rule of transforming continuous-variable graph states by local homodyne detection
• Feynman-path type simulation using stabilizer projector decomposition of unitaries
• Cost-optimal single-qubit gate synthesis in the Clifford hierarchy
• T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead Adder
• Reliable channel-adapted error correction: Bacon-Shor code recovery from amplitude damping
• Quantum computation by teleportation and symmetry
• Outcome determinism in measurement-based quantum computation with qudits
• Automatic Test Pattern Generation for Robust Quantum Circuit Testing
• Distributed Encoding and Decoding of Quantum Information over Networks
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• Fault-tolerant quantum computing with the parity code and noise-biased qubits
• Port-based entanglement teleportation via noisy resource states
• Wigner distribution on a double cylinder phase space for studying quantum error correction protocol
• T-count Optimized Quantum Circuits for Bilinear Interpolation
• Certifying nonstabilizerness in quantum processors
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• Efficient atomic quantum memory for photonic qubits in cavity QED
• Magic Mirror on the Wall, How to Benchmark Quantum Error Correction Codes, Overall ?
• Polynomial T-depth Quantum Solvability of Noisy Binary Linear Problem: From Quantum-Sample Preparation to Main Computation
• Decoding general error correcting codes and the role of complementarity
• Entanglement Assisted Non-local Optical Interferometry in a Quantum Network
• Quantum Computing with sine-Gordon Qubits
• Finding maximal quantum resources
• An Optimized Nearest Neighbor Compliant Quantum Circuit for 5-qubit Code
• Non-stabilizerness and entanglement from cat-state injection
• A Quantum Performance Simulator based on fidelity and fault-path counting
• Classical Coding Approaches to Quantum Applications
• Perfect Cluster States from Imperfect Global Entanglement
• Secure Two-Party Quantum Computation Over Classical Channels
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• Asymptotic teleportation schemes bridging between standard and port-based teleportation
• Enhancement of non-Stabilizerness within Indefinite Causal Order
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• State-adaptive quantum error correction and fault-tolerant quantum computing
• Quantum security computation on shared secrets
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Sampling and the complexity of nature
• Quantum Speedup of Monte Carlo Integration with respect to the Number of Dimensions and its Application to Finance
• Codeword Stabilized Codes from m-Uniform Graph States
• Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates
• Running a Quantum Circuit at the Speed of Data
• Transversal architecture for megaquop-scale quantum simulation with neutral atoms
• Performance and Error Analysis of Knill's Postselection Scheme in a Two-Dimensional Architecture
• Covert Quantum Internet
• Optical Quantum Computing
• Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code
• Flexible Fault Tolerant Gate Gadgets