Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lower bounds on the classical simulation of quantum circuits for quantum supremacy

Alexander M. Dalzell

Published Jan 1, 2017• 2 citations
OpenAlex

Abstract

Thesis: S.B., Massachusetts Institute of Technology, Department of Physics, 2017.

Related papers

Efficient classical simulation of spin networks

Igor Andrade Sylvester

Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2006.

•Jan 1, 2006•0 citations

Effects of Control Error on an Adiabatic Quantum Algorithm

Edward Platt

Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2006.

•Jan 1, 2006•0 citations

Classical Simulation and Complexity of Quantum Computations

Richard Jozsa

Lecture notes in computer science•Jan 1, 2010•2 citations

Monte Carlo simulations of a physical cryptographic warhead verification protocol using nuclear resonance fluorescence

Jayson R. Vavrek

Thesis: S.M., Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, 2016.

•Jan 1, 2016•4 citations

Quantum assisted sensing, simulation and control

Ashok Ajoy

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Nuclear Science and Engineering, 2016.

•Jan 1, 2016•0 citations

Complexity Lower Bounds for Quantum Circuits

Mika Hirvensalo

Springer eBooks•Jan 1, 2001•0 citations