Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
arXiv:1609.06628
Abstract
The task of programming a quantum computer is just as strange as quantum mechanics itself. But it now looks like a simple 3D puzzle may be the future tool of quantum software engineers.
arXiv comment10 Pages, 4 figures. Article for ACM-XRDS, Magazine for students. Fall Issue on Quantum Computing. Expanded Reference List
References in corpus (45)
- Fault-tolerant quantum computation by anyons
- Quantum Computation with Quantum Dots
- Mixed State Entanglement and Quantum Error Correction
- Surface codes: Towards practical large-scale quantum computation
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- A Theory of Fault-Tolerant Quantum Computation
- Fault-tolerant quantum computation with high threshold in two dimensions
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- Quantum Error Correction for Beginners
- Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
- Topological fault-tolerance in cluster state quantum computation
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- High threshold universal quantum computation on the surface code
- Overhead and noise threshold of fault-tolerant quantum error correction
- Magic state distillation with low overhead
- Fault-Tolerant Error Correction with Efficient Quantum Codes
- Gate count estimates for performing quantum chemistry on small quantum computers
- Scalable Architecture for a Room Temperature Solid-State Quantum Information Processor
- Fast Decoders for Topological Quantum Codes
- Photonic architecture for scalable quantum information processing in NV-diamond
- Fault-tolerant quantum computation against biased noise
- Local and Distributed Quantum Computation
- Exact synthesis of multiqubit Clifford+T circuits
- Effective fault-tolerant quantum computation with slow measurements
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Fault-tolerant thresholds for quantum error correction with the surface code
- Multilevel distillation of magic states for quantum computing
- Error Threshold for Color Codes and Random 3-Body Ising Models
- Fault-Tolerant Quantum Computation with Local Gates
- Resource costs for fault-tolerant linear optical quantum computing
- Fault-Tolerant High Level Quantum Circuits: Form, Compilation and Description
- Surface code implementation of block code state distillation
- Requirements for fault-tolerant factoring on an atom-optics quantum computer
- A silicon-based surface code quantum computer
- Fast versions of Shor's quantum factoring algorithm
- Fully fault tolerant quantum computation with non-deterministic gates
- A bridge to lower overhead quantum computation
- Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
- Synthesis of Arbitrary Quantum Circuits to Topological Assembly
- Classical Processing Requirements for a Topological Quantum Computing System
- Quantum circuit optimization by topological compaction in the surface code
- Logic Synthesis for Fault-Tolerant Quantum Computers