Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Semantic embedding for quantum algorithms

Journal Article · · Journal of Mathematical Physics
DOI:https://doi.org/10.1063/5.0160910· OSTI ID:2564768

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Sponsoring Organization:
USDOE
Grant/Contract Number:
NONE; SC0012704
OSTI ID:
2564768
Alternate ID(s):
OSTI ID: 2582103
Journal Information:
Journal of Mathematical Physics, Journal Name: Journal of Mathematical Physics Journal Issue: 12 Vol. 64; ISSN 0022-2488
Publisher:
American Institute of PhysicsCopyright Statement
Country of Publication:
United States
Language:
English

References (37)

Quantum Arthur–Merlin games journal June 2005
A category-theoretic account of program modules journal March 1991
Towards a quantum programming language journal August 2004
Quantum programming languages: survey and bibliography journal July 2006
Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation journal January 2023
Perturbative model of noisy quantum signal processing journal April 2023
Reversing Unknown Qubit-Unitary Operation, Deterministically and Exactly journal September 2023
Quantum algorithms for estimating physical quantities using block encodings journal August 2020
Efficient phase-factor evaluation in quantum signal processing journal April 2021
Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions journal September 2021
Arbitrary phases in quantum amplitude amplification journal October 2000
Adaptive versus nonadaptive strategies for quantum channel discrimination journal March 2010
Quantum Circuit Architecture journal August 2008
Perfect Distinguishability of Quantum Operations journal November 2009
Fixed-Point Quantum Search with an Optimal Number of Queries journal November 2014
Optimal Hamiltonian Simulation by Quantum Signal Processing journal January 2017
Quantum Algorithm for Petz Recovery Channels and Pretty Good Measurements journal June 2022
Statistical Distinguishability between Unitary Operations journal October 2001
Fixed-Point Quantum Search journal October 2005
Entanglement is Not Necessary for Perfect Discrimination between Unitary Operations journal March 2007
Methodology of Resonant Equiangular Composite Quantum Gates journal December 2016
General Resource Theories in Quantum Mechanics and Beyond: Operational Characterization via Discrimination Tasks journal September 2019
Grand Unification of Quantum Algorithms journal December 2021
On lattices, learning with errors, random linear codes, and cryptography journal September 2009
Floyd--hoare logic for quantum programs journal December 2011
Twist: sound reasoning for purity and entanglement in Quantum programs journal January 2022
Quantum Communication Complexity of Linear Regression journal March 2024
An axiomatic basis for computer programming journal October 1969
Hamiltonian Simulation by Qubitization journal July 2019
Product Decomposition of Periodic Functions in Quantum Signal Processing journal October 2019
Quantum SDP-Solvers: Better upper and lower bounds journal February 2020
Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems journal November 2020
Faster Coherent Quantum Algorithms for Phase, Energy, and Amplitude Estimation journal October 2021
Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle journal September 2022
On the energy landscape of symmetric quantum signal processing journal November 2022
Essai sur la géométrie à $n$ dimensions journal January 1873
Hamiltonian simulation using linear combinations of unitary operations journal November 2012

Similar Records

Multivariable quantum signal processing (M-QSP): prophecies of the two-headed oracle
Journal Article · Tue Sep 20 00:00:00 EDT 2022 · Quantum · OSTI ID:1983350

Related Subjects