Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Classical Simulation and Complexity of Quantum Computations

Richard Jozsa

Published Jan 1, 2010• 2 citations
Publisher
DOI
10.1007/978-3-642-13182-0_23

Related papers

Classical Simulation of Quantum Computation

Yongshan Ding, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2020•0 citations

Classical Circuit Simulations for Superconducting Quantum Circuits

Alan M. Kadin

•Classical superconducting circuit simulators are powerful and available. •Include Josephson junction as basic element. •Provide efficient time-domain simulations of complex circuits. •May show effects otherwise attributed to quantum circuits. •Circuits of coupled superconducting qubits are being developed for quantum computing (QC). •Entangled quantum theory incompatible with classical simulators. •Quantum model difficult to simulate on conventional computers for complex circuits already being tested. •Classical circuit simulations should provide the baseline to compare with quantum effects, but this is seldom done. •Coupled oscillators are delocalized even in classical limit.

Bulletin of the American Physical Society•Mar 1, 2021•0 citations

Simulation of Quantum Computation

Tzvetan S. Metodi, Frederic T. Chong

Synthesis lectures on computer architecture•Jan 1, 2006•0 citations

Classical simulation complexity of restricted models of quantum computation

Dax Enshan Koh

Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity.

•Jan 1, 2019•0 citations

Classical Simulation Complexity of Quantum Machines

Farid Mansurovich Ablayev, Aida Gainutdinova

Lecture notes in computer science•Jan 1, 2003•2 citations

Quantum computation and combinatorial structures

Ryan L. Mann

This thesis explores the relationship between quantum computation and combinatorial structures, with the goal of improving our understanding of the complexity of quantum computation. We begin by studying the case when the complexity of combinatorial structures can be used to provide evidence for the hardness of classically simulating quantum computations. To this end, we show that the complexity of evaluating multiplicative-error approximations of Jones polynomials can be used to bound the classical complexity of simulating random quantum computations. We then proceed by studying the contrary case, that is, when do the combinatorial structures allow for an efficient classical simulation of quantum computations? We establish an efficient deterministic approximation algorithm for the Ising model partition function with complex parameters when the interactions and external fields are absolutely bounded close to zero. This provides an efficient classical algorithm for simulating a class of quantum computations with bounded interactions between the qubits. \nIn the second part of this thesis, we present some independent results on the efficient preparation of Fock states with a high number of photons from a resource of single photons. These Fock states are a fundamental resource in many quantum information protocols.

•Jan 1, 2019•0 citations
•Classical superconducting circuit simulators are powerful and available. •Include Josephson junction as basic element. •Provide efficient time-domain simulations of complex circuits. •May show effects otherwise attributed to quantum circuits. •Circuits of coupled superconducting qubits are being developed for quantum computing (QC). •Entangled quantum theory incompatible with classical simulators. •Quantum model difficult to simulate on conventional computers for complex circuits already being tested. •Classical circuit simulations should provide the baseline to compare with quantum effects, but this is seldom done. •Coupled oscillators are delocalized even in classical limit.
Restricted models of quantum computation are mathematical models which describe quantum computers that have limited access to certain resources. Well-known examples of such models include the boson sampling model, extended Clifford circuits, and instantaneous quantum polynomial-time circuits. While unlikely to be universal for quantum computation, several of these models appear to be able to outperform classical computers at certain computational tasks, such as sampling from certain probability distributions. Understanding which of these models are capable of performing such tasks and characterizing the classical simulation complexity of these models--i.e. how hard it is to simulate these models on a classical computer--are some of the central questions we address in this thesis. Our first contribution is a classification of various extended Clifford circuits according to their classical simulation complexity.
This thesis explores the relationship between quantum computation and combinatorial structures, with the goal of improving our understanding of the complexity of quantum computation. We begin by studying the case when the complexity of combinatorial structures can be used to provide evidence for the hardness of classically simulating quantum computations. To this end, we show that the complexity of evaluating multiplicative-error approximations of Jones polynomials can be used to bound the classical complexity of simulating random quantum computations. We then proceed by studying the contrary case, that is, when do the combinatorial structures allow for an efficient classical simulation of quantum computations? We establish an efficient deterministic approximation algorithm for the Ising model partition function with complex parameters when the interactions and external fields are absolutely bounded close to zero. This provides an efficient classical algorithm for simulating a class of quantum computations with bounded interactions between the qubits. \nIn the second part of this thesis, we present some independent results on the efficient preparation of Fock states with a high number of photons from a resource of single photons. These Fock states are a fundamental resource in many quantum information protocols.