On Near-Term Quantum Computation: Theoretical Aspects of Variational Quantum Algorithms and Quantum Computational Supremacy
In recent years, programmable quantum devices have reached sizes and complexities which put them outside the regime of simulation on modern supercomputers. However, since their computational power is not well understood, it’s not obvious what to do with them! Of course, there are several ideas, and...
Main Author: | Napp, John C. |
---|---|
Other Authors: | Harrow, Aram W. |
Format: | Thesis |
Published: |
Massachusetts Institute of Technology
2022
|
Online Access: | https://hdl.handle.net/1721.1/142686 |
Similar Items
-
Quantum Computational Supremacy
by: Harrow, Aram W., et al.
Published: (2020) -
Quantum algorithms for near-term quantum computers
by: Anderson, LW
Published: (2024) -
How many qubits are needed for quantum computational supremacy?
by: Dalzell, Alexander M., et al.
Published: (2020) -
How many qubits are needed for quantum computational supremacy?
by: Alexander M. Dalzell, et al.
Published: (2020-05-01) -
Quantum Computing Quickly Scores Second Claim of Supremacy
by: Chris Palmer
Published: (2021-09-01)