Analysis of quantum primitives for quantum utility

DOI10.1007/S11128-026-05201-5MaRDI QIDQ7286260zbMATH OpenFDO

Authors Tae-Won Kim, Byung-Soo Choi

Publication date 23 June 2026

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-026-05201-5

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Quantum computation (81P68)

Cites work

• A complete characterization of all-versus-nothing arguments for stabilizer states
• A polynomial-time classical algorithm for noisy random circuit sampling
• An Introduction to Gödel's Theorems
• Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates
• De-quantisation of the quantum Fourier transform
• Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture
• Efficient quantum algorithms for simulating sparse Hamiltonians
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 7701522 (Why is no real title available?)
• NISQ-friendly measurement-based quantum clustering algorithms
• Noise and the frontier of quantum supremacy
• On central primitives for quantum cryptography with classical communication
• On the computational hardness needed for quantum cryptography
• On the Power of Quantum Computation
• Putting paradoxes to work: contextuality in measurement-based quantum computation
• Quantum algorithms. A survey of applications and end-to-end complexities
• Quantum circuits with classical channels and the principle of deferred measurements
• Quantum metrology from a quantum information science perspective
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Rapid solution of problems by quantum computation
• Revisiting Deutsch-Jozsa algorithm
• Robust dequantization of the quantum singular value transformation and quantum machine learning algorithms
• SEPARABILITY OF PURE N-QUBIT STATES: TWO CHARACTERIZATIONS
• Stabilization of Quantum Computations by Symmetrization
• The complexity of computing the permanent
• The computational complexity of linear optics
• The Deutsch-Jozsa problem: de-quantisation and entanglement
• The need for structure in quantum speedups
• The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation
• The variational quantum eigensolver: a review of methods and best practices
• Verifiable quantum advantage without structure
• Zum Hilbertschen Aufbau der reellen Zahlen.

This page was built for publication: Analysis of quantum primitives for quantum utility

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