Characterizing classes of functions computable by quantum parallelism

DOI10.1098/RSPA.1991.0161zbMATH Open0774.68087OpenAlexW2151089673MaRDI QIDQ3984337FDOQ3984337

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

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

zbMATH Keywords

Hilbert spacequantum statecomputabilitysuperpositionsobservablelinear relationsquantum parallelism

Mathematics Subject Classification ID

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

Cited In (10)

• Oracle Quantum Computing
• Quantum functional oracles
• Quantum computation and quantum information†
• The physics of quantum computation
• Quantum parallelism in quantum information processing
• Consciousness: Computing the uncomputable
• A compositional approach to quantum functions
• Title not available (Why is that?)
• Efficient quantum algorithm for the parity problem of a certain function
• Some theoretically organized algorithm for quantum computers

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)