Classically simulating quantum circuits with local depolarizing noise
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 7559454
- Matchgates and classical simulation of quantum circuits
- Decoupling with random quantum circuits
- Classical simulation of quantum circuits by half Gauss sums
- scientific article; zbMATH DE number 6866233
- QUANTUM-STATISTICAL SIMULATIONS FOR QUANTUM CIRCUITS
- Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
- Quantum simulation of classically chaotic systems
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
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
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Simulating quantum computers with probabilistic methods
- The computational complexity of linear optics
Cited in
(2)
This page was built for publication: Classically simulating quantum circuits with local depolarizing noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238211)
