Classically simulating quantum circuits with local depolarizing noise
From MaRDI portal
Publication:2238211
DOI10.1016/J.TCS.2021.07.025OpenAlexW3211806653MaRDI QIDQ2238211FDOQ2238211
Authors: 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
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
- Title not available (Why is that?)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Analysis of Boolean Functions
- The computational complexity of linear optics
- Fundamentals of Computation Theory
- Computational complexity of uniform quantum circuit families and quantum Turing machines
- Simulating quantum computers with probabilistic methods
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
- Title not available (Why is that?)
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)
