Cover Image

Does there exist a quantum fingerprinting protocol without coherent measurements?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hasegawa, Atsuya, Kundu, Srijita, Gall, François Le, Nishimura, Harumichi, Wang, Qisheng
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Space-bounded quantum interactive proof systems
by: Gall, François Le, et al.
Published: (2024)

On the Power of Quantum Distributed Proofs
by: Hasegawa, Atsuya, et al.
Published: (2024)

Group Order is in QCMA
by: Gall, François Le, et al.
Published: (2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
by: Hasegawa, Atsuya, et al.
Published: (2025)

Multi-Prover Interactive Proof Systems with Leakage
by: Asadi, Vahid R., et al.
Published: (2026)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
by: Gall, François Le, et al.
Published: (2023)

Dequantization and Hardness of Spectral Sum Estimation
by: Edenhofer, Roman, et al.
Published: (2025)

A slightly improved upper bound for quantum statistical zero-knowledge
by: Gall, François Le, et al.
Published: (2025)

Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
by: Chia, Nai-Hui, et al.
Published: (2026)

A Cautionary Note on Quantum Oracles
by: Agarwal, Avantika, et al.
Published: (2025)

Quantum information advantage based on Bell inequalities
by: Jain, Rahul, et al.
Published: (2026)

Separations in query complexity for total search problems
by: Ben-David, Shalev, et al.
Published: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
by: Ben-David, Shalev, et al.
Published: (2024)

Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
by: Gharibian, Sevag, et al.
Published: (2021)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
by: Delavenne, Hugo, et al.
Published: (2024)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, et al.
Published: (2023)

Quantum Simultaneous Protocols without Public Coins using Modified Equality Queries
by: Gall, François Le, et al.
Published: (2024)

Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
by: Gall, François Le
Published: (2024)

Dequantizing Short-Path Quantum Algorithms
by: Gall, François Le, et al.
Published: (2026)

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
by: Wang, Qisheng, et al.
Published: (2024)

On estimating the quantum $\ell_α$ distance
by: Liu, Yupan, et al.
Published: (2025)

On estimating the trace of quantum state powers
by: Liu, Yupan, et al.
Published: (2024)

Beating the natural Grover bound for low-energy estimation and state preparation
by: Buhrman, Harry, et al.
Published: (2024)

An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
by: Mataraarachchi, Ranitha, et al.
Published: (2026)

Local Test for Unitarily Invariant Properties of Bipartite Quantum States
by: Chen, Kean, et al.
Published: (2024)

Improved Hardness Results for the Guided Local Hamiltonian Problem
by: Cade, Chris, et al.
Published: (2022)

New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)

Quantum Algorithm for Lexicographically Minimal String Rotation
by: Wang, Qisheng, et al.
Published: (2020)

Complexity of quantum circuits via sensitivity, magic, and coherence
by: Bu, Kaifeng, et al.
Published: (2022)

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
by: Upreti, Varun, et al.
Published: (2025)

Information-Theoretic Lower Bounds for Approximating Monomials via Optimal Quantum Tsallis Entropy Estimation
by: Wang, Qisheng
Published: (2025)

Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
by: Wang, Qisheng
Published: (2024)

A List of Complexity Bounds for Property Testing by Quantum Sample-to-Query Lifting
by: Chen, Kean, et al.
Published: (2025)

On Estimating the Quantum Tsallis Relative Entropy
by: Bao, Jinge, et al.
Published: (2025)

Strict Hierarchy for Quantum Channel Certification to Unitary
by: Chen, Kean, et al.
Published: (2026)

Sample-Optimal Quantum Estimators for Pure-State Trace Distance and Fidelity via Samplizer
by: Wang, Qisheng, et al.
Published: (2024)

Verifiable measurement-based quantum random sampling with trapped ions
by: Ringbauer, Martin, et al.
Published: (2023)

A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization
by: Schreiber, Franz J., et al.
Published: (2025)

Quasi-quantum states and the quasi-quantum PCP theorem
by: Arad, Itai, et al.
Published: (2024)