TOOLS FOR QUANTUM ALGORITHMS

DOI10.1142/S0129183199001108MaRDI QIDQ4488237zbMATH OpenFDO

Authors Tad Hogg, Carlos Mochon, Wolfgang Polak, Eleanor G. Rieffel

Publication date 5 July 2000

Published in International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/9811073

Mathematics Subject Classification ID

Quantum computation (81P68)

Abstract: We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of the phase adjustments to block matrix transformations. These operations generalize those used in proposed quantum search algorithms.

Recommendations

• A panoply of quantum algorithms
• scientific article; zbMATH DE number 1406118
• Quantum search on structured problems
• Quantum Algorithms
• scientific article; zbMATH DE number 2103524

Cites work

• A framework for structured quantum search.
• Quantum computational networks
• Quantum mechanical Hamiltonian models of Turing machines
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines

Cited in

(5)

• QCL implementation of quantum search algorithms
• The Semi-Quantum Computer
• Quantum simulation of simple many-body dynamics
• Unrelated parallel machine scheduling -- perspectives and progress
• Quantum optimization

This page was built for publication: TOOLS FOR QUANTUM ALGORITHMS

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