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 Complexity of Quantum Machines

Farid Mansurovich Ablayev, Aida Gainutdinova

Published Jan 1, 2003• 2 citations
Publisher
DOI
10.1007/978-3-540-45077-1_27

Related papers

On classical stimulation of quantum machines

Farid Mansurovich Ablayev, Aida Gainutdinova

We present a classical probabilistic simulation technique of quantum Turing machines As a corollary of this technique we obtain several results on relationship among classical and quantum complexity classes such as: PrQP PP BQP PP and PrQSPACE(S(n)) PrPSPACE(S(n)).

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jun 1, 2005•0 citations

Classical Simulation and Complexity of Quantum Computations

Richard Jozsa

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

Simulated Quantum Annealer

Danica Bassman

Quantum computing requires qubits, which obey the laws of quantum mechanics and therefore behave very dierently from classical bits. This dierence can allow quantum computers to achieve massive levels of parallelism impossible on a classical computer. As a result, certain problems that are in NP but highly parallelizable can be solved by quantum computers in polynomial time. Quantum computers have the capacity to drastically change the computing world, but they are complex and dicult to implement; to study them, we often look to simulators that can bypass many of the roadblocks inhibiting our path to a true quantum computer. A simulated quantum annealer takes advantage of the adiabatic theorem to solve problems by transitioning from a simple to complex quantum state while maintaining minimal energy. We simulate these quantum states, energies, and transitions on classical machines by mathematical abstractions for proof of concept and to circumvent the complications of physical implementation. To do this, we solve 3SAT on a classical machine simulating how it would be solved by quantum annealing.

•Jan 1, 2014•0 citations

Classical Simulation of Quantum Computation

Yongshan Ding, Frederic T. Chong

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

Machine learning development for quantum computing and neutrino physics

Annalisa De Lorenzis

This thesis investigates the application of machine-learning methods in the context of quantum computing and neutrino physics, with particular emphasis on the construction of effective representations for complex, high-dimensional data. The first part of the work is devoted to Quantum Extreme Learning Machines (QELMs), a hybrid quantum--classical framework in which classical data are encoded into quantum states and processed through fixed quantum dynamics, while learning is performed by a classical readout layer. Within this framework, we analyze the role of encoding strategies, feature-reduction methods, Hamiltonian structure, and measurement, with particular focus on the relationship between quantum dynamics, expressivity, entanglement, and classical simulability. The second part of the thesis concerns the application of deep learning to the analysis of images produced by water Cherenkov detectors in neutrino physics. Convolutional architectures, including residual networks, are developed for the classification of complex events in realistic simulated datasets, showing that such models can effectively extract relevant information from detector data. Taken together, these results highlight the potential of machine learning, in both its classical and quantum forms, as a powerful framework for the analysis of complex data in fundamental physics, while also outlining relevant challenges and directions for future research.

quant-pharXiv:2607.13699•Jul 16, 2026•0 citations

Algorithms and computational complexity in quantum simulation and quantum machine learning

B. Jobst, Frank Pollmann, Technische Universität München

•Jan 1, 2026•0 citations
Quantum computing requires qubits, which obey the laws of quantum mechanics and therefore behave very dierently from classical bits. This dierence can allow quantum computers to achieve massive levels of parallelism impossible on a classical computer. As a result, certain problems that are in NP but highly parallelizable can be solved by quantum computers in polynomial time. Quantum computers have the capacity to drastically change the computing world, but they are complex and dicult to implement; to study them, we often look to simulators that can bypass many of the roadblocks inhibiting our path to a true quantum computer. A simulated quantum annealer takes advantage of the adiabatic theorem to solve problems by transitioning from a simple to complex quantum state while maintaining minimal energy. We simulate these quantum states, energies, and transitions on classical machines by mathematical abstractions for proof of concept and to circumvent the complications of physical implementation. To do this, we solve 3SAT on a classical machine simulating how it would be solved by quantum annealing.
This thesis investigates the application of machine-learning methods in the context of quantum computing and neutrino physics, with particular emphasis on the construction of effective representations for complex, high-dimensional data. The first part of the work is devoted to Quantum Extreme Learning Machines (QELMs), a hybrid quantum--classical framework in which classical data are encoded into quantum states and processed through fixed quantum dynamics, while learning is performed by a classical readout layer. Within this framework, we analyze the role of encoding strategies, feature-reduction methods, Hamiltonian structure, and measurement, with particular focus on the relationship between quantum dynamics, expressivity, entanglement, and classical simulability. The second part of the thesis concerns the application of deep learning to the analysis of images produced by water Cherenkov detectors in neutrino physics. Convolutional architectures, including residual networks, are developed for the classification of complex events in realistic simulated datasets, showing that such models can effectively extract relevant information from detector data. Taken together, these results highlight the potential of machine learning, in both its classical and quantum forms, as a powerful framework for the analysis of complex data in fundamental physics, while also outlining relevant challenges and directions for future research.