Architectures for quantum simulation showing a quantum speedup
arXiv:1703.00466 · doi:10.1103/PhysRevX.8.021010
Abstract
One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy", referring to the experimental realization of a quantum device that computationally outperforms classical computers. In this work, we show that one can devise versatile and feasible schemes of two-dimensional dynamical quantum simulators showing such a quantum speedup, building on intermediate problems involving non-adaptive measurement-based quantum computation. In each of the schemes, an initial product state is prepared, potentially involving an element of randomness as in disordered models, followed by a short-time evolution under a basic translationally invariant Hamiltonian with simple nearest-neighbor interactions and a mere sampling measurement in a fixed basis. The correctness of the final state preparation in each scheme is fully efficiently certifiable. We discuss experimental necessities and possible physical architectures, inspired by platforms of cold atoms in optical lattices and a number of others, as well as specific assumptions that enter the complexity-theoretic arguments. This work shows that benchmark settings exhibiting a quantum speedup may require little control in contrast to universal quantum computing. Thus, our proposal puts a convincing experimental demonstration of a quantum speedup within reach in the near term.
arXiv comment13+9 pages, 9 figures, emphasized feasibility, added material on the verification step
References in corpus (55)
- Surface codes: Towards practical large-scale quantum computation
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Observation of many-body localization of interacting fermions in a quasi-random optical lattice
- Measurement-based quantum computation with cluster states
- A quantum gas microscope - detecting single atoms in a Hubbard regime optical lattice
- Quantum many-body systems out of equilibrium
- Multi-party entanglement in graph states
- Probing the relaxation towards equilibrium in an isolated strongly correlated 1D Bose gas
- Conditions for a class of entanglement transformations
- Exploring the many-body localization transition in two dimensions
- Probing the Superfluid to Mott Insulator Transition at the Single Atom Level
- Entanglement of atoms via cold controlled collisions
- Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
- Single-Spin Addressing in an Atomic Mott Insulator
- Chaos in quantum channels
- Efficient quantum state tomography
- Ballistic spreading of entanglement in a diffusive nonintegrable system
- Direct observation of Dirac cones and a flatband in a honeycomb lattice for polaritons
- Methodology for quantum logic gate constructions
- Stabilizer Formalism for Operator Quantum Error Correction
- Valence Bond Solids for Quantum Computation
- Random Quantum Circuits are Approximate 2-designs
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Local random quantum circuits are approximate polynomial-designs
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Blueprint for a microwave trapped-ion quantum computer
- Novel schemes for measurement-based quantum computation
- Probing Slow Relaxation and Many-Body Localization in Two-Dimensional Quasi-Periodic Systems
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Two-dimensional Mott-Hubbard electrons in an artificial honeycomb lattice
- Emergence of coherence and the dynamics of quantum phase transitions
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- Quantum Sampling Problems, BosonSampling and Quantum Supremacy
- Instantaneous Quantum Computation
- Coherent collisional spin dynamics in optical lattices
- Unified derivations of measurement-based schemes for quantum computation
- Reliable quantum certification for photonic quantum technologies
- Experimental realization of plaquette resonating valence bond states with ultracold atoms in optical superlattices
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Convergence Conditions for Random Quantum Circuits
- Novikov's Conjecture
- On measurement-based quantum computation with the toric code states
- Direct certification of a class of quantum simulations
- Completeness of the classical 2D Ising model and universal quantum computation
- A quantum cellular automaton for universal quantum computation
- Quantum computation via translation-invariant operations on a chain of qubits
- Single-site- and single-atom-resolved measurement of correlation functions
- Quantum Commuting Circuits and Complexity of Ising Partition Functions
- On quantum circuits employing roots of the Pauli matrices
- Measurement-based classical computation
- Quantum algorithms for classical lattice models
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Quantum pseudo-randomness from cluster-state quantum computation
- A quantum algorithm for additive approximation of Ising partition functions
Cited by in corpus (73)
- Quantum advantage with shallow circuits
- Quantum simulation and computing with Rydberg-interacting qubits
- Stochastic gradient descent for hybrid quantum-classical optimization
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- No imminent quantum supremacy by boson sampling
- Verification of quantum computation: An overview of existing approaches
- Efficient classical simulation of random shallow 2D quantum circuits
- Computational advantage of quantum random sampling
- Quantum advantage with noisy shallow circuits in 3D
- Theory of quantum system certification: a tutorial
- Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
- Emergent quantum state designs from individual many-body wavefunctions
- Simulating boson sampling in lossy architectures
- On the Quantum versus Classical Learnability of Discrete Distributions
- Verification of Many-Qubit States
- Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
- How many qubits are needed for quantum computational supremacy?
- Quantum approximate optimization with Gaussian boson sampling
- Anticoncentration theorems for schemes showing a quantum speedup
- From estimation of quantum probabilities to simulation of quantum circuits
- Pattern recognition techniques for Boson Sampling validation
- Experimental quantum advantage with quantum coupon collector
- Sample complexity of device-independently certified "quantum supremacy"
- Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
- Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
- Expressibility and trainability of parameterized analog quantum systems for machine learning applications
- Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
- Scalable Hamiltonian learning for large-scale out-of-equilibrium quantum dynamics
- Quantum simulations with complex geometries and synthetic gauge fields in a trapped ion chain
- Quantum supremacy in constant-time measurement-based computation: A unified architecture for sampling and verification
- Learning shallow quantum circuits
- Experimental demonstration of quantum advantage for NP verification with limited information
- Complexity phase diagram for interacting and long-range bosonic Hamiltonians
- Entanglement estimation in tensor network states via sampling
- Distinguishing noisy boson sampling from classical simulations
- Experimental Demonstration of Quantum Tunneling in IBM Quantum Computer
- Certified variational quantum algorithms for eigenstate preparation
- Verification of graph states in an untrusted network
- Randomized Benchmarking in the Analogue Setting
- Preparation and verification of tensor network states
- Nonadaptive fault-tolerant verification of quantum supremacy with noise
- Sharp complexity phase transitions generated by entanglement
- Protocols for classically training quantum generative models on probability distributions
- Efficient Verification of Ground States of Frustration-Free Hamiltonians
- The pair-flip model: a very entangled translationally invariant spin chain
- Quantum supremacy and quantum phase transitions
- Exploring Shallow-Depth Boson Sampling: Towards Scalable Quantum Supremacy
- Fault-tolerant quantum speedup from constant depth quantum circuits
- Faster Born probability estimation via gate merging and frame optimisation
- Entanglement and complexity of interacting qubits subject to asymmetric noise
- Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs
- Quantum advantage from energy measurements of many-body quantum systems
- Fault-tolerant compiling of classically hard IQP circuits on hypercubes
- Quantum supremacy in driven quantum many-body systems
- Entanglement Scaling in Quantum Advantage Benchmarks
- Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits
- Efficient Construction of Quantum Physical Unclonable Functions with Unitary t-designs
- High Performance Computing and Computational Intelligence Applications with MultiChaos Perspective
- Boson Sampling for Generalized Bosons
- Unitary -designs from seeds
- Quantum supremacy with analog quantum processors for material science and machine learning
- Methods for Classically Simulating Noisy Networked Quantum Architectures
- Quantum walk processes in quantum devices
- Efficiently verifiable quantum advantage on near-term analog quantum simulators
- Learning quantum states prepared by shallow circuits in polynomial time
- Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers
- Quantum advantage in temporally flat measurement-based quantum computation
- Boson sampling with ultracold atoms in a programmable optical lattice
- Sampling and the complexity of nature
- On computational complexity and average-case hardness of shallow-depth boson sampling
- Low overhead universality and quantum supremacy using only -control
- Measurement-induced entanglement in noisy 2D random circuits