Characterizing classes of functions computable by quantum parallelism

DOI10.1098/RSPA.1991.0161MaRDI QIDQ3984337zbMATH OpenOpenAlexFDO

Authors Richard Jozsa

Publication date 27 June 1992

Published in Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rspa.1991.0161

zbMATH Keywords

computabilityHilbert spacelinear relationsobservablequantum parallelismquantum statesuperpositions

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of computing (68Q99) General and philosophical questions in quantum theory (81P05)

Recommendations

• Some theoretically organized algorithm for quantum computers
• Quantum algorithm for evaluating two of logical functions simultaneously
• Quantum lower bounds by polynomials
• scientific article; zbMATH DE number 1462669

Cited in

(11)

• Efficient quantum algorithm for the parity problem of a certain function
• Consciousness: Computing the uncomputable
• Quantum parallelism in quantum information processing
• Some theoretically organized algorithm for quantum computers
• The physics of quantum computation
• Quantum computation and quantum information†
• Quantum functional oracles
• Oracle Quantum Computing
• scientific article; zbMATH DE number 1500664 (Why is no real title available?)
• A compositional approach to quantum functions
• scientific article; zbMATH DE number 5066359 (Why is no real title available?)

This page was built for publication: Characterizing classes of functions computable by quantum parallelism

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