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/9811073 · International Journal of Modern Physics C

TOOLS FOR QUANTUM ALGORITHMS

Tad Hogg, CARLOS MOCHON, Wolfgang Polak, Eleanor Gilbert Rieffel

Published Oct 1, 1999• 13 citations
arXivHTMLPDF

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.

DOI
10.1142/s0129183199001108

Related papers

TOOLS FOR QUANTUM ALGORITHMS

Tad Hogg, CARLOS MOCHON, Wolfgang Polak +1 more

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.

•Jan 1, 1999•20 citations

FORMULATION OF A FAMILY OF SURE-SUCCESS QUANTUM SEARCH ALGORITHMS

Jin-Yuan Hsieh, Che‐Ming Li, Jenn-Sen Lin +1 more

In this work, we consider a family of sure-success quantum algorithms, which is grouped into even and odd members for solving a generalized Grover search problem. We prove the matching conditions for both groups and give the corresponding formulae for evaluating the iterations or oracle calls required in the search computation. We also present how to adjust the phase angles in the generalized Grover operator to ensure the sure-success if minimal oracle calls are demanded in the search.

arXiv:quant-ph/0210201•International Journal of Quantum Information•Aug 30, 2004•2 citations

Logical Structures Underlying Quantum Computing

Federico Holik, Giuseppe Sergioli, Hector Freytes +1 more

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

arXiv:1811.06808•Entropy•Jan 16, 2019•6 citations

Logical structures underlying quantum computing

Federico Holik, Giuseppe Sergioli, Héctor Freytes +1 more

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

•Jan 1, 2019•6 citations

基于自适应的非线性矩阵运算的量子算法 (QMAPQ)

Jincheng Zhang

Quantum Algorithm Mapping and Parallelization with Adaptive Matrix Operations (QMAPQ) presents a novel quantum algorithm designed to address the limitations of traditional matrix operations in quantum computing. This research explores the implementation of a dynamically adjustable matrix operation scheme, leveraging quantum algorithms and adaptive complexity control to enhance the efficiency of large-scale matrix computations. The core of QMAPQ is based on the concept of iteratively adjusting the computational complexity of matrix operations through quantum entanglement and superposition. This allows the algorithm to potentially surpass the performance limitations of fixed-parameter algorithms, offering a pathway toward more scalable and efficient quantum computations. The paper details the design of the adaptive matrix operation module, the quantum circuit implementation, and preliminary results demonstrating the algorithm's potential for increased computational throughput.

•Sep 7, 2026•0 citations

Improved implementation of reflection operators

Anirban Narayan Chowdhury, Yiğit Subaşı, Rolando D. Somma

Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation. Here we use a linear combination of unitaries and a version of amplitude amplification to approximate reflection operators over eigenvectors of unitary operators using exponentially less ancillary qubits in terms of a precision parameter. The gate complexity of our method is also comparable to that of the phase estimation approach in a certain limit of interest. Like phase estimation, our method requires the implementation of controlled unitary operations. We then extend our results to the Hamiltonian case where the target state is an eigenvector of a Hamiltonian whose matrix elements can be queried. Our results are useful in that they reduce the resources required by various quantum algorithms in the literature. Our improvements also rely on an efficient quantum algorithm to prepare a quantum state with Gaussian-like amplitudes that may be of independent interest. We also provide a lower bound on the query complexity of implementing approximate reflection operators on a quantum computer.

arXiv:1803.02466•Bulletin of the American Physical Society•Mar 6, 2018•7 citations
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.
Quantum Algorithm Mapping and Parallelization with Adaptive Matrix Operations (QMAPQ) presents a novel quantum algorithm designed to address the limitations of traditional matrix operations in quantum computing. This research explores the implementation of a dynamically adjustable matrix operation scheme, leveraging quantum algorithms and adaptive complexity control to enhance the efficiency of large-scale matrix computations. The core of QMAPQ is based on the concept of iteratively adjusting the computational complexity of matrix operations through quantum entanglement and superposition. This allows the algorithm to potentially surpass the performance limitations of fixed-parameter algorithms, offering a pathway toward more scalable and efficient quantum computations. The paper details the design of the adaptive matrix operation module, the quantum circuit implementation, and preliminary results demonstrating the algorithm's potential for increased computational throughput.
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflections are approximately implemented using phase estimation. Here we use a linear combination of unitaries and a version of amplitude amplification to approximate reflection operators over eigenvectors of unitary operators using exponentially less ancillary qubits in terms of a precision parameter. The gate complexity of our method is also comparable to that of the phase estimation approach in a certain limit of interest. Like phase estimation, our method requires the implementation of controlled unitary operations. We then extend our results to the Hamiltonian case where the target state is an eigenvector of a Hamiltonian whose matrix elements can be queried. Our results are useful in that they reduce the resources required by various quantum algorithms in the literature. Our improvements also rely on an efficient quantum algorithm to prepare a quantum state with Gaussian-like amplitudes that may be of independent interest. We also provide a lower bound on the query complexity of implementing approximate reflection operators on a quantum computer.