Details
| Original language | English |
|---|---|
| Article number | 021010 |
| Journal | Physical Review X |
| Volume | 8 |
| Issue number | 2 |
| Publication status | Published - 9 Apr 2018 |
| Externally published | Yes |
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 nonadaptive, 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.
ASJC Scopus subject areas
- Physics and Astronomy(all)
- General Physics and Astronomy
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Physical Review X, Vol. 8, No. 2, 021010, 09.04.2018.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Architectures for Quantum Simulation Showing a Quantum Speedup
AU - Bermejo-Vega, Juan
AU - Hangleiter, Dominik
AU - Schwarz, Martin
AU - Raussendorf, Robert
AU - Eisert, Jens
N1 - Funding Information: We thank Scott Aaronson, Dan E. Browne, Andreas Elben, Bill Fefferman, Wolfgang Lechner, and Ashley Montanaro for discussions. J. B. V. thanks Vadym Kliuchnikov and Neil Julien Ross for helpful comments. This work was supported by the EU Horizon 2020 (640800 AQuS), the Templeton and Alexander von Humboldt Foundations, the ERC (TAQ), and the DFG (CRC 183, EI 519/7-1). R. R. is funded by NSERC, Cifar, IARPA.
PY - 2018/4/9
Y1 - 2018/4/9
N2 - 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 nonadaptive, 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.
AB - 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 nonadaptive, 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.
UR - http://www.scopus.com/inward/record.url?scp=85047297604&partnerID=8YFLogxK
U2 - 10.1103/PhysRevX.8.021010
DO - 10.1103/PhysRevX.8.021010
M3 - Article
AN - SCOPUS:85047297604
VL - 8
JO - Physical Review X
JF - Physical Review X
SN - 2160-3308
IS - 2
M1 - 021010
ER -