Quantum algorithm for testing graph completeness

DOI10.1016/J.AOP.2025.170305MaRDI QIDQ6889671zbMATH OpenFDO

Authors Sara Giordano, Miguel A. Martín-Delgado

Publication date 4 December 2025

Published in Annals of Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AOP.2025.170305

zbMATH Keywords

complete graphsquantum phase estimationSzegedy quantum walk

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Cites work

• scientific article; zbMATH DE number 6118217 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 734901 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• A bound on the spectral radius of graphs
• A bound on the spectral radius of graphs with \(e\) edges
• Condorcet efficiency: A preference for indifference
• Efficient quantum circuits for Szegedy quantum walks
• Equivalence of Szegedy's and coined quantum walks
• Exponential algorithmic speedup by a quantum walk
• Information and computation: Classical and quantum aspects
• Introduction to algorithms.
• On the spectral radius of (0,1)-matrices
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum Walk Algorithm for Element Distinctness
• Quantum counting on the complete bipartite graph
• Quantum walks and search algorithms
• Simulating quantum systems on a quantum computer
• The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
• Universal Quantum Simulators

This page was built for publication: Quantum algorithm for testing graph completeness

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