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

The complexity of sampling from a weak quantum computer

Saeed Adel Mehraban

Published Jan 1, 2019• 0 citations
OpenAlex

Abstract

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019

Related papers

Quantum speedups in query complexity

Shalev Ben-David

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.

•Jan 1, 2017•0 citations

Quantum computation with identical bosons

A. A. Архипов

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.

•Jan 1, 2017•0 citations

Qubit dynamics under alternating controls

Clarice D. Aiello

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.

•Jan 1, 2014•0 citations

Photonic quantum computers and communication systems

Jacob Mower

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.

•Jan 1, 2015•0 citations

Applications of abelian algebraic structures in quantum computation

Kevin C. Zatloukal

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

•Jan 1, 2016•0 citations

Architectures for photon-mediated quantum information processing

Mihir Pant

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.

•Jan 1, 2018•0 citations