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

arXiv:1004.1027 · Lecture notes in computer science

On the Completeness of Quantum Computation Models

Pablo J. Arrighi, Gilles Dowek B

Published Jan 1, 2010• 4 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-13962-8_3

Related papers

Models of quantum computation

Mingsheng Ying

Elsevier eBooks•Jan 1, 2024•0 citations

Quantum Arrows in Haskell

Juliana Kaizer Vizzotto, Antônio Carlos da Rocha Costa, Amr Sabry

We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and classical worlds. We discuss two alternative models for general and complete quantum computations based on probability distributions of quantum state vectors and on density matrices with classical outputs. We show that both models can be structured using a generalization of monads called arrows.

Electronic Notes in Theoretical Computer Science•Jul 1, 2008•4 citations

Models for Quantum Computation

Peter P. Rohde

Cambridge University Press eBooks•Sep 9, 2021•0 citations

Artificial intelligence and a universal quantum computer

Andreas Wichert

In this paper we describe a complete quantum computational model of computation that is based on the production system. The presented description of the model does not require any quantum computation background. By doing so, the reason that quantum c

AI Communications•May 30, 2016•7 citations

On Some Aspects of Quantum Computational Models

Amandeep Singh Bhatia, Ajay Kumar

•Jul 16, 2020•1 citation

Quantum computers and intractable (NP-complete) computing problems

V. Černý

In this paper we discuss physical aspects of intractable (NP-complete) computing problems. We show, using a specific model, that a quantum-mechanical computer can in principle solve an NP-complete problem in polynomial time; however, it would use an exponentially large energy for that computation. We conjecture that our model reflects a complementarity principle concerning the time and the energy needed to perform an NP-complete computation.

Physical Review A•Jul 1, 1993•38 citations