Simulating quantum computers with probabilistic methods

MaRDI QIDQ3101851zbMATH OpenFDO

Authors Maarten Van den Nest

Publication date 1 December 2011

Full work available at URL https://arxiv.org/abs/0911.1624

zbMATH Keywords

classical simulationquantum algorithmsquantum computationsampling methods

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• QUANTUM-STATISTICAL SIMULATIONS FOR QUANTUM CIRCUITS
• Quantum Circuits That Can Be Simulated Classically in Polynomial Time
• Classical simulation and complexity of quantum computations (invited talk)
• Quantum computers that can be simulated classically in polynomial time

Cited in

(14)

• On the simulation of quantum Turing machines.
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Classical simulation of quantum circuits by half Gauss sums
• Classically simulating quantum circuits with local depolarizing noise
• Exponential decay of correlations implies area law
• High posterior density ellipsoids of quantum states
• scientific article; zbMATH DE number 2013801 (Why is no real title available?)
• scientific article; zbMATH DE number 7559454 (Why is no real title available?)
• Exact and efficient simulation of concordant computation
• QUANTUM-STATISTICAL SIMULATIONS FOR QUANTUM CIRCUITS
• An Exact and Practical Classical Strategy for 2D Graph State Sampling
• Comments on ``Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Equivalence between contextuality and negativity of the Wigner function for qudits
• The Hilbert-space structure of free fermions in disguise

This page was built for publication: Simulating quantum computers with probabilistic methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3101851)