scientific article; zbMATH DE number 7559454
From MaRDI portal
Publication:5089258
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 7250161 (Why is no real title available?)
- Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
- Analysis of Boolean Functions
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Fundamentals of Computation Theory
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Simulating quantum computers with probabilistic methods
- The computational complexity of linear optics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089258)