Quantum computing and the entanglement frontier
arXiv:1203.5813
Abstract
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangled quantum systems efficiently, and we hope to hasten the day when well controlled quantum systems can perform tasks surpassing what can be done in the classical world. One way to achieve such "quantum supremacy" would be to run an algorithm on a quantum computer which solves a problem with a super-polynomial speedup relative to classical computers, but there may be other ways that can be achieved sooner, such as simulating exotic quantum states of strongly correlated matter. To operate a large scale quantum computer reliably we will need to overcome the debilitating effects of decoherence, which might be done using "standard" quantum hardware protected by quantum error-correcting codes, or by exploiting the nonabelian quantum statistics of anyons realized in solid state systems, or by combining both methods. Only by challenging the entanglement frontier will we learn whether Nature provides extravagant resources far beyond what the classical world would allow.
18 pages, 8 figures. Rapporteur talk at the 25th Solvay Conference on Physics ("The Theory of the Quantum World"), 19-22 October 2011. (v2): References added. (v3): Typo corrected
References in corpus (4)
Cited by in corpus (33)
- The Variational Quantum Eigensolver: a review of methods and best practices
- Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
- Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
- Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
- Biology and medicine in the landscape of quantum advantages
- Classical Simulation of Quantum Supremacy Circuits
- Fast multi-qubit gates through simultaneous two-qubit gates
- Simulating the Sycamore quantum supremacy circuits
- Quantum Technologies and Society: Towards a Different Spin
- The Computational and Latency Advantage of Quantum Communication Networks
- Study of Decoherence in Quantum Computers: A Circuit-Design Perspective
- Classical-to-quantum transition in multimode nonlinear systems with strong photon-photon coupling
- Polynomial scaling enhancement in ground-state preparation of Ising spin models via counter-diabatic driving
- Accelerating Variational Quantum Algorithms Using Circuit Concurrency
- Low-temperature environments for quantum computation and quantum simulation
- Image Compression and Classification Using Qubits and Quantum Deep Learning
- On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids
- Robust and efficient algorithms for high-dimensional black-box quantum optimization
- Exploring a Double Full-Stack Communications-Enabled Architecture for Multi-Core Quantum Computers
- Linear multiport photonic interferometers: loss analysis of temporally-encoded architectures
- The careless use of language in quantum information
- Supercomputer simulations of transmon quantum computers
- Realization of arbitrary doubly-controlled quantum phase gates
- Counting collisions in random circuit sampling for benchmarking quantum computers
- First-principles investigation of spin-phonon coupling in vanadium-based molecular spin qubits
- Quantum computational advantage implies contextuality
- Improved FRQI on superconducting processors and its restrictions in the NISQ era
- Mitigating Noise-Induced Gradient Vanishing in Variational Quantum Algorithm Training
- Leveraging Quantum Annealer to identify an Event-topology at High Energy Colliders
- Polynomial speedup in Torontonian calculation by a scalable recursive algorithm
- Chemistry beyond the Hartree-Fock limit via quantum computed moments
- Superfluous Physics
- High-performance parallel classical scheme for simulating shallow quantum circuits