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:quant-ph/0010057

Theory of quantum computation

Emanuel H. Knill, Michael A. Nielsen

Published Oct 17, 2000• 22 citations
arXivHTMLPDF

Abstract

Short review article on quantum computation accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also http://www.wkap.nl/series.htm/ENM
DOI
10.48550/arxiv.quant-ph/0010057

Related papers

Quantum information processing

Emanuel H. Knill, Michael A. Nielsen

Short review article on quantum information processing accepted for Supplement III, Encyclopaedia of Mathematics (publication expected Summer 2001). See also http://www.wkap.nl/series.htm/ENM

arXiv:quant-ph/0010058•Oct 17, 2000•0 citations

Special Issue “Quantum computation complexity theory and quantum network theory” (Preface)

Junde Wu

International Journal of Theoretical Physics•Jun 2, 2021•0 citations

Computational Complexity Theory of Quantum Turing Machines and Quantum Circuits

Harumichi Nishimura, 治道 西村

•Mar 26, 2001•1 citation

Quantum Anticipation Explorer

Hans-Rudolf Thomann

Quantum anticipation explorer is a computer program allowing the numerical exploration of quantum anticipation which has been analyzed in arXiv:0810.183v1 and arXiv:1003.1090v1 for H-Atom, equidistant, random and custom spectra. This tool determines the anticipation strength at those times orthogonal evolution is possible. This paper is the user's guide explaining its capabilities, installation and usage, and documenting the mathematics and algorithms implemented in the software. A zip file containing the setup and documentation can be downloaded from http://www.thomannconsulting.ch/public/aboutus/aboutus-en.htm free of cost.

arXiv:1102.3774•Feb 18, 2011•0 citations

Bicategorical Semantics for Nondeterministic Computation

Mike Stay, Jamie Vicary

We present a topological bicategorical syntax for the interaction between public and private information in classical information theory. This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms required. This analysis shows that these protocols have an identical abstract form to the quantum teleportation and dense coding procedures, giving a concrete mathematical analogy between quantum and classical computing. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations. http://www.elsevier.nl/locate/entcs.

Electronic Notes in Theoretical Computer Science•Nov 1, 2013•11 citations

A brief overview of quantum computing theory

O. Siedlecka

•Jan 1, 2006•1 citation
Quantum anticipation explorer is a computer program allowing the numerical exploration of quantum anticipation which has been analyzed in arXiv:0810.183v1 and arXiv:1003.1090v1 for H-Atom, equidistant, random and custom spectra. This tool determines the anticipation strength at those times orthogonal evolution is possible. This paper is the user's guide explaining its capabilities, installation and usage, and documenting the mathematics and algorithms implemented in the software. A zip file containing the setup and documentation can be downloaded from http://www.thomannconsulting.ch/public/aboutus/aboutus-en.htm free of cost.
We present a topological bicategorical syntax for the interaction between public and private information in classical information theory. This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms required. This analysis shows that these protocols have an identical abstract form to the quantum teleportation and dense coding procedures, giving a concrete mathematical analogy between quantum and classical computing. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations. http://www.elsevier.nl/locate/entcs.