Quantum computing and the entanglement frontier

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 (12)

• Fault-tolerant quantum computation by anyons
• Quantum algorithm for solving linear systems of equations
• Efficient classical simulation of slightly entangled quantum computations
• Encoding a qubit in an oscillator
• Strengths and Weaknesses of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Quantum Algorithms for Quantum Field Theories
• Classical simulation of noninteracting-fermion quantum circuits
• On the simulation of quantum circuits
• The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
• The Computational Complexity of Linear Optics
• Approximating the Turaev-Viro Invariant of Mapping Tori is Complete for One Clean Qubit

Cited by in corpus (71)

• Quantum Computing in the NISQ era and beyond
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Computational Supremacy
• Training Schrödinger's cat: quantum optimal control
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Quantum-assisted quantum compiling
• Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Efficient experimental validation of photonic boson sampling against the uniform distribution
• Controlling phonons and photons at the wavelength-scale: silicon photonics meets silicon phononics
• Variational Quantum State Diagonalization
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Quantum Sampling Problems, BosonSampling and Quantum Supremacy
• Robust quantum state transfer via topological edge states in superconducting qubit chains
• Ultracold polar molecules as qudits
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• 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
• Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
• Entanglement spectroscopy with a depth-two quantum circuit
• Fast multi-qubit gates through simultaneous two-qubit gates
• Boundaries of quantum supremacy via random circuit sampling
• Simulating the Sycamore quantum supremacy circuits
• Quantum Technologies and Society: Towards a Different Spin
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Simulated Quantum Annealing with Two All-to-All Connectivity Schemes
• The Computational and Latency Advantage of Quantum Communication Networks
• Efficient classical simulation of noisy quantum computation
• CMOS Quantum Computing: Toward A Quantum Computer System-on-Chip
• Study of Decoherence in Quantum Computers: A Circuit-Design Perspective
• Classical simulation of quantum circuits by half Gauss sums
• Digital quantum simulation of linear and nonlinear optical elements
• 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
• Measuring entanglement of a rank-2 mixed state prepared on a quantum computer
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• Explicit lower bounds on strong quantum simulation
• Accelerating Variational Quantum Algorithms Using Circuit Concurrency
• Complexity Classification of Conjugated Clifford Circuits
• The Quantum Computer Puzzle (Expanded Version)
• Low-temperature environments for quantum computation and quantum simulation
• Quantum generative model for sampling many-body spectral functions
• Optimal entanglement witnesses: a scalable data-driven approach
• Image Compression and Classification Using Qubits and Quantum Deep Learning
• Entanglement Scaling in Quantum Advantage Benchmarks
• Robust and efficient algorithms for high-dimensional black-box quantum optimization
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids
• 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
• Solving satisfiability by Bayesian inference
• 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
• Exploring Quantum Supremacy in Access Structures of Secret Sharing by Coding Theory
• 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
• Quantum-Inspired Computing: Can it be a Microscopic Computing Model of the Brain?
• Global estimates of errors in quantum computation by the Feynman-Vernon formalism
• Polynomial speedup in Torontonian calculation by a scalable recursive algorithm
• High-performance parallel classical scheme for simulating shallow quantum circuits
• Superfluous Physics
• Chemistry beyond the Hartree-Fock limit via quantum computed moments
• Quantum Godwin's Law
• Quantum Computation