The complexity of sampling from a weak quantum computer

The complexity of sampling from a weak quantum computer

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

Bibliographic Details
Main Author:	Mehraban, Saeed.
Other Authors:	Scott J. Aaronson and Aram W. Harrow.
Format:	Thesis
Language:	eng
Published:	Massachusetts Institute of Technology 2020
Subjects:	Electrical Engineering and Computer Science.
Online Access:	https://hdl.handle.net/1721.1/124065

Similar Items

Computational complexity of certain quantum theories in 1+1 dimensions
by: Mehraban, Saeed
Published: (2016)

Classical Algorithms, Correlation Decay, and Complex Zeros of Partition Functions of Quantum Many-Body Systems
by: Harrow, Aram W., et al.
Published: (2022)

Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates
by: Harrow, Aram W., et al.
Published: (2023)

Instrumentation for quantum computers
by: Huang, Wei-Han, 1979-
Published: (2006)

Sampling in computer vision and Bayesian nonparametric mixtures
by: Chang, Jason, Ph. D. Massachusetts Institute of Technology
Published: (2014)

Quantum query complexity revisited
by: Preda, Daniel C. (Daniel Ciprian), 1979-
Published: (2006)

Quantum speedups in query complexity
by: Ben David, Shalev
Published: (2018)

Toward a personal quantum computer
by: Chong, Henry H. W., 1974-
Published: (2008)

The complexity of joint computation
by: Drucker, Andrew Donald
Published: (2013)

Multi-party quantum computation
by: Smith, Adam (Adam Davidson), 1977-
Published: (2014)

Quantum computation with identical bosons
by: Arkhipov, Alex (Aleksandr)
Published: (2018)

The study of entangled states in quantum computation and quantum information science
by: Chung, Hyeyoun, M. Eng. Massachusetts Institute of Technology
Published: (2009)

Photonic quantum computers and communication systems
by: Mower, Jacob
Published: (2016)

A general-purpose pulse sequencer for quantum computing
by: Pháº¡m, Paul Tân Tháº¿
Published: (2006)

WMM : a resilient Weak Memory Model
by: Zhang, Sizhuo
Published: (2016)

Suppressing weak Ising couplings: tailored gates for quantum computation
by: Jones, J
Published: (2003)

Applications of abelian algebraic structures in quantum computation
by: Zatloukal, Kevin C. (Kevin Chaffee)
Published: (2016)

Scalable trap technology for quantum computing with ions
by: Eltony, Amira M. (Amira Madeleine)
Published: (2015)

Unitary transformations on temporal modes using dispersive optics for Boson Sampling and quantum simulation
by: Pant, Mihir
Published: (2015)

Three complexity classification questions at the quantum/classical boundary
by: Grier, Daniel.
Published: (2020)

Constructing and evaluating weak memory models
by: Zhang, Sizhuo.
Published: (2019)

An optical-fiber interface to a trapped-ion quantum computer
by: Kim, Tony Hyun
Published: (2013)

A scalable quantum computation platform : solid state quantum memories coupled to photonic integrated circuits
by: Mouradian, Sara L. (Sara Lambert)
Published: (2018)

Fault-tolerant quantum computer architectures using hierarchies of quantum error-correcting codes
by: Cross, Andrew W. (Andrew William), 1979-
Published: (2009)

Speech processing with less supervision : learning from weak labels and multiple modalities
by: Hsu, Wei-Ning,Ph. D.Massachusetts Institute of Technology.
Published: (2020)

Communication complexity of some problems in distributed computation
by: Luo, Zhi-Quan
Published: (2005)

Reconstruction from non-uniform samples
by: Leow, Kwang Siong Jeremy
Published: (2010)

Computation in models inspired by near-term quantum devices
by: Schaeffer, Luke(Luke Robert)
Published: (2020)

Phase-noise limitations on nonlinear-optical quantum computing
by: Dove, Justin (Justin Michael)
Published: (2014)

Synthesis and evaluation of fault-tolerant quantum computer architectures
by: Cross, Andrew W. (Andrew William), 1979-
Published: (2006)

Some hardness escalation results in computational complexity theory
by: Kamath, Pritish.
Published: (2020)

On the computational complexity of portal and push-pull block puzzles
by: Lynch, Jayson (Jayson R.)
Published: (2016)

Problems of computational and informational complexity in machine vision and learning
by: Kulkarni, Sanjeev R. (Sanjeev Ramesh)
Published: (2005)

Complexity issues dealing with networks that compute Boolean functions
by: Chaudhari, Upendra Vasant
Published: (2005)

`Weak` trends for inference and forecasting in finite samples.
by: Chevillon, G
Published: (2004)

Weak' trends for inference and forecasting in finite samples
by: Chevillon, G
Published: (2004)

Scaling trapped-ion quantum computers with CMOS-integrated state readout
by: Kramnik, Danielius.
Published: (2021)

Feasibility studies for quantum computation with spectral hole burning media
by: Bowers, Jeffrey Allan, 1975-
Published: (2010)

QUANTUM SIMULATION OF WEAKLY-BOUND COMPLEXES USING DIRECT AB-INITIO ENERGY POINTS
by: Gregory, J, et al.
Published: (1995)

3-round weak zero-knowledge proofs for [Nu] [Rho]
by: Lim, Dah-Yoh, 1978-
Published: (2005)