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

Cambridge University Press eBooks

Quantum algorithmic primitives

Alexander M. Dalzell, Sam McArdle, Mario Berta, Przemyslaw Bienias, Chi-Fang Chen, András Gilyén, Connor T. Hann, Michael J. Kastoryano, Emil T. Khabiboulline, Aleksander Kubica, Grant Salton, Samson Wang, Fernando G. S. L. Brandão

Published Apr 24, 2025• 0 citations
Publisher
DOI
10.1017/9781009639651.012

Related papers

Quantum gradient estimation

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter covers the quantum algorithmic primitive called quantum gradient estimation, where the goal is to output an estimate for the gradient of a multivariate function. This primitive features in other primitives, for example, quantum tomography. It also features in several quantum algorithms for end-to-end problems in continuous optimization, finance, and machine learning, among other areas. The size of the speedup it provides depends on how the algorithm can access the function, and how difficult the gradient is to estimate classically.

Cambridge University Press eBooks•Apr 24, 2025•0 citations

Quantum Algorithmic Complexities

Fabio Benatti

Theoretical and mathematical physics•Jan 1, 2009•0 citations

Loading classical data

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter covers quantum algorithmic primitives for loading classical data into a quantum algorithm. These primitives are important in many quantum algorithms, and they are especially essential for algorithms for big-data problems in the area of machine learning. We cover quantum random access memory (QRAM), an operation that allows a quantum algorithm to query a classical database in superposition. We carefully detail caveats and nuances that appear for realizing fast large-scale QRAM and what this means for algorithms that rely upon QRAM. We also cover primitives for preparing arbitrary quantum states given a list of the amplitudes stored in a classical database, and for performing a block-encoding of a matrix, given a list of its entries stored in a classical database.

Cambridge University Press eBooks•Apr 24, 2025•0 citations

Miscellaneous Quantum Algorithms

Song Yuan Yan

Springer eBooks•Jan 1, 2015•0 citations

Exploiting recursive structures for the design of novel quantum primitives

Ning Bao, Suer, Gun

The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum computers, and their design is often non-intuitive. This paper addresses the issue of generating novel quantum primitives by focusing on recursive circuits. We explore the recursive circuit structures prevalent in existing quantum algorithms and demonstrate how these structures can be exploited to design new, potentially advantageous quantum algorithms. We base our discussion on the quantum Fourier transform (QFT), which is a primitive that is widely used in quantum algorithms. We show that the recursive structure in well-established fast classical transforms forms a fruitful bridge with quantum algorithms, enabling the design of novel quantum primitives and the discovery of new discrete numerical transforms. The discussion is split into two complementary parts, the forward and the reverse direction, in which existing classical transforms are implemented using polynomial-time quantum circuits and recursive circuits are used to find novel non-sparse classical transforms with guaranteed quantum speedup, respectively. We comment on the potential impact on quantum algorithms, numerical analysis, and signal processing.

arXiv:2410.13927•Oct 17, 2024•0 citations

Algorithms of quantum computation

Shinil Cho

Institute of Physics eBooks•Jul 1, 2022•7 citations
This chapter covers the quantum algorithmic primitive called quantum gradient estimation, where the goal is to output an estimate for the gradient of a multivariate function. This primitive features in other primitives, for example, quantum tomography. It also features in several quantum algorithms for end-to-end problems in continuous optimization, finance, and machine learning, among other areas. The size of the speedup it provides depends on how the algorithm can access the function, and how difficult the gradient is to estimate classically.
This chapter covers quantum algorithmic primitives for loading classical data into a quantum algorithm. These primitives are important in many quantum algorithms, and they are especially essential for algorithms for big-data problems in the area of machine learning. We cover quantum random access memory (QRAM), an operation that allows a quantum algorithm to query a classical database in superposition. We carefully detail caveats and nuances that appear for realizing fast large-scale QRAM and what this means for algorithms that rely upon QRAM. We also cover primitives for preparing arbitrary quantum states given a list of the amplitudes stored in a classical database, and for performing a block-encoding of a matrix, given a list of its entries stored in a classical database.
The advent of fault-tolerant quantum computers marks a significant milestone, yet the development of practical quantum algorithms remains a critical challenge. Effective quantum algorithms are essential for leveraging the power of quantum computers, and their design is often non-intuitive. This paper addresses the issue of generating novel quantum primitives by focusing on recursive circuits. We explore the recursive circuit structures prevalent in existing quantum algorithms and demonstrate how these structures can be exploited to design new, potentially advantageous quantum algorithms. We base our discussion on the quantum Fourier transform (QFT), which is a primitive that is widely used in quantum algorithms. We show that the recursive structure in well-established fast classical transforms forms a fruitful bridge with quantum algorithms, enabling the design of novel quantum primitives and the discovery of new discrete numerical transforms. The discussion is split into two complementary parts, the forward and the reverse direction, in which existing classical transforms are implemented using polynomial-time quantum circuits and recursive circuits are used to find novel non-sparse classical transforms with guaranteed quantum speedup, respectively. We comment on the potential impact on quantum algorithms, numerical analysis, and signal processing.