DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» PostBQP
PostBQP
Quantum Supremacy
The Weakness of CTC Qubits and the Power of Approximate Counting
Complexity Theory and Its Applications in Linear Quantum
Quantum Computation Beyond the Unitary Circuit Model
Efficient Classical Simulation of Random Shallow 2D Quantum Circuits
Useful Quantum Advantage with an Ising Born Machine
Perfect State Distinguishability and Computational Speedups with Postselected Closed Timelike Curves
QMA/Qpoly ⊆ PSPACE/Poly : De-Merlinizing Quantum Protocols
Adaptivity Vs. Postselection, and Hardness Amplification For
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
Quantum Entanglement: Theory and Applications
Studies of a Quantum Scheduling Algorithm and on Quantum Error Correction
Advanced Complexity Theory: Quantum Computing and #P
Advanced Quantum Algorithms
Arxiv:2006.00987V1 [Quant-Ph] 1 Jun 2020 Complexity Estimation Techniques
Hardness of Efficiently Generating Ground States in Postselected
6.845 Quantum Complexity Theory, Lecture 21
Top View
6.845 Quantum Complexity Theory, Lecture 18
6.845 Quantum Complexity Theory, Lecture 20
The Space Above
Advanced Quantum Algorithms
Quantum Simulators, Boson Sampling and the Quest for Superpolynomial Speedups
How Hard Is It to Approximate the Jones Polynomial?
The Complexity and Verification of Quantum Random Circuit Sampling
Symmetry Protected Quantum Computation
Estimating Algorithmic Information Using Quantum Computing for Genomics Applications
The Complexity of Quantum Sampling Problems
L11 Quantum Advantage I
Development of Quantum Applications
Lower Bounds on the Classical Simulation of Quantum Circuits for Quantum Supremacy Alexander M. Dalzell
Computability Theory of Closed Timelike Curves
Quantum Pseudorandomness and Classical Complexity
Arxiv:0908.0512V2 [Quant-Ph] 27 Oct 2014 Htteapoiaini Theorem in Approximation the That Factor Constant That H Oe Oyoila N Rnia Oto Nt;Amore [11]
PDQP/Qpoly = ALL, Where ALL Is the Set of All Languages L 0, 1 ∗ (Including the Halting Problem and Other Noncomputable Languages)
Arxiv:1704.01514V1 [Quant-Ph] 5 Apr 2017 † ∗ H Elnzto Osntcag H Ls SBQP
Arxiv:1809.07442V1 [Quant-Ph] 20 Sep 2018 Quantum Simulation,20, 29 Do Not
Adiabatic Quantum Computing
QMA Coogee.Key
Measurement-Based Classical Computation
Classical Simulation of Restricted Quantum Computations
Computability Theory of Closed Timelike Curves
Introduction to Computational Complexity Theory II
A Complete Characterization of Unitary Quantum Space Bill Fefferman (Quics, University of Maryland/NIST) Joint with Cedric Lin (Quics)
The Computational Complexity of Linear Optics
Lecture 3: Bounded Error Quantum Polynomial Time (BQP) Contents 1
The Computational Complexity of Linear Optics