Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
From MaRDI portal
Recommendations
Cited in
(18)- Classical simulation of quantum circuits by half Gauss sums
- Classically simulating quantum circuits with local depolarizing noise
- Hardness of classically simulating quantum circuits with unbounded Toffoli and fan-out gates
- Commuting quantum circuits with few outputs are unlikely to be classically simulatable
- Quantum simulation from the bottom up: the case of rebits
- scientific article; zbMATH DE number 7559454 (Why is no real title available?)
- Average-case quantum advantage with shallow circuits
- scientific article; zbMATH DE number 7250161 (Why is no real title available?)
- Quantum advantage with shallow circuits
- Quantum computing, postselection, and probabilistic polynomial-time
- Fundamentals of Computation Theory
- Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Equivalence between contextuality and negativity of the Wigner function for qudits
- On the need for large quantum depth
- Quantum advantage from one-way functions
- Guidable local Hamiltonian problems with implications to heuristic ansatz state preparation and the quantum PCP conjecture
- Quantum cryptography and meta-complexity
- Gaussianity and simulability of Cliffords and matchgates
This page was built for publication: Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522470)
