Classically simulating quantum circuits with local depolarizing noise
From MaRDI portal
Publication:2238211
DOI10.1016/j.tcs.2021.07.025OpenAlexW3211806653MaRDI QIDQ2238211
Yasuhiro Takahashi, Yuki Takeuchi, Seiichiro Tani
Publication date: 1 November 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.08373
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Analysis of Boolean Functions
- Fundamentals of Computation Theory
This page was built for publication: Classically simulating quantum circuits with local depolarizing noise