Image de couverture de livre

Multi-Prover Interactive Proof Systems with Leakage

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asadi, Vahid R., Hasegawa, Atsuya, Gall, François Le
Format:	Preprint
Publié:	2026
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
par: Hasegawa, Atsuya, et autres
Publié: (2025)

Dequantization and Hardness of Spectral Sum Estimation
par: Edenhofer, Roman, et autres
Publié: (2025)

Does there exist a quantum fingerprinting protocol without coherent measurements?
par: Hasegawa, Atsuya, et autres
Publié: (2025)

Fine-Grained Complexity for Quantum Problems from Size-Preserving Circuit-to-Hamiltonian Constructions
par: Chia, Nai-Hui, et autres
Publié: (2026)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
par: Gharibian, Sevag, et autres
Publié: (2021)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
par: Delavenne, Hugo, et autres
Publié: (2024)

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

Space-bounded quantum state testing via space-efficient quantum singular value transformation
par: Gall, François Le, et autres
Publié: (2023)

Classical versus quantum queries in quantum PCPs with classical proofs
par: Buhrman, Harry, et autres
Publié: (2024)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
par: Delavenne, Hugo, et autres
Publié: (2023)

Space-bounded quantum interactive proof systems
par: Gall, François Le, et autres
Publié: (2024)

Dequantizing Short-Path Quantum Algorithms
par: Gall, François Le, et autres
Publié: (2026)

A slightly improved upper bound for quantum statistical zero-knowledge
par: Gall, François Le, et autres
Publié: (2025)

Group Order is in QCMA
par: Gall, François Le, et autres
Publié: (2025)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
par: Buhrman, Harry, et autres
Publié: (2024)

Quantum Interactive Oracle Proofs
par: Sun, Baocheng, et autres
Publié: (2026)

Beating the natural Grover bound for low-energy estimation and state preparation
par: Buhrman, Harry, et autres
Publié: (2024)

An Entropy-Governed Speedup for Quantum Algorithms on Local Hamiltonians
par: Mataraarachchi, Ranitha, et autres
Publié: (2026)

Improved Hardness Results for the Guided Local Hamiltonian Problem
par: Cade, Chris, et autres
Publié: (2022)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
par: Grewal, Sabee, et autres
Publié: (2025)

The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
par: Gay, William, et autres
Publié: (2026)

Two Simple Proofs of Müller's Theorem
par: Epstein, Samuel
Publié: (2024)

The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
par: Jeronimo, Fernando Granha, et autres
Publié: (2024)

Lower Bounds for Unitary Property Testing with Proofs and Advice
par: Weggemans, Jordi
Publié: (2024)

Fine-Grained Complexity via Quantum Natural Proofs
par: Chen, Yanlin, et autres
Publié: (2025)

Proof of Hiding Conjecture in Gaussian Boson Sampling
par: Shou, Laura, et autres
Publié: (2025)

Proofs of quantum memory
par: Hhan, Minki, et autres
Publié: (2025)

On the Power of Quantum Distributed Proofs
par: Hasegawa, Atsuya, et autres
Publié: (2024)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
par: Grilo, Alex B., et autres
Publié: (2024)

Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
par: Do, Phuc Hao, et autres
Publié: (2025)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
par: Li, Xingjian, et autres
Publié: (2023)

Distributed Quantum Advantage for Local Problems
par: Balliu, Alkida, et autres
Publié: (2024)

Online Locality Meets Distributed Quantum Computing
par: Akbari, Amirreza, et autres
Publié: (2024)

Classically Spoofing System Linear Cross Entropy Score Benchmarking
par: Tanggara, Andrew, et autres
Publié: (2024)

Tight Quantum Depth Lower Bound for Solving Systems of Linear Equations
par: Wang, Qisheng, et autres
Publié: (2024)

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
par: Silva, Jefferson D. S., et autres
Publié: (2025)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
par: Guseynov, Nikita, et autres
Publié: (2026)

Polynomial-Time Almost Log-Space Tree Evaluation by Catalytic Pebbling
par: Asadi, Vahid R., et autres
Publié: (2026)

A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'
par: Moosavian, Ali Hamed, et autres
Publié: (2026)

Quantum precomputation: parallelizing cascade circuits and the Moore-Nilsson conjecture is false
par: Watts, Adam Bene, et autres
Publié: (2025)