Cover Image

The Power of Unentangled Quantum Proofs with Non-negative Amplitudes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jeronimo, Fernando Granha, Wu, Pei
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
by: Gay, William, et al.
Published: (2026)

Dimension Independent Disentanglers from Unentanglement and Applications
by: Jeronimo, Fernando G., et al.
Published: (2024)

Coherence in Property Testing: Quantum-Classical Collapses and Separations
by: Jeronimo, Fernando Granha, et al.
Published: (2024)

Pseudorandom and Pseudoentangled States from Subset States
by: Jeronimo, Fernando Granha, et al.
Published: (2023)

Unentanglement and Post-Measurement Branching in Quantum Interactive Proofs
by: Grewal, Sabee, et al.
Published: (2025)

Unentangled stoquastic Merlin-Arthur proof systems: the power of unentanglement without destructive interference
by: Liu, Yupan, et al.
Published: (2026)

Optimized Amplitude Amplification for Quantum State Preparation
by: Chernikov, Artem, et al.
Published: (2025)

Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)

The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)

Fine-Grained Complexity via Quantum Natural Proofs
by: Chen, Yanlin, et al.
Published: (2025)

Quantum Threshold is Powerful
by: Grier, Daniel, et al.
Published: (2024)

Quantum Merlin-Arthur with an internally separable proof
by: Bassirian, Roozbeh, et al.
Published: (2024)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Two Simple Proofs of Müller's Theorem
by: Epstein, Samuel
Published: (2024)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
by: Grilo, Alex Bredariol, et al.
Published: (2024)

Exponential Separation Criteria for Quantum Iterative Power Algorithms
by: Czégel, András, et al.
Published: (2025)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)

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

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
by: Barch, Brian, et al.
Published: (2025)

Lower Bounds for Unitary Property Testing with Proofs and Advice
by: Weggemans, Jordi
Published: (2024)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
by: Miloschewsky, David, et al.
Published: (2024)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
by: Li, Xingjian, et al.
Published: (2023)

Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Proof of Hiding Conjecture in Gaussian Boson Sampling
by: Shou, Laura, et al.
Published: (2025)

Proofs of quantum memory
by: Hhan, Minki, et al.
Published: (2025)

Local Quantum Search Algorithm for Random $k$-SAT with $Ω(n^{1+ε})$ Clauses
by: Wu, Mingyou
Published: (2024)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
by: Wu, Xudong, et al.
Published: (2025)

Amplitude amplification and estimation require inverses
by: Tang, Ewin, et al.
Published: (2025)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
by: Grier, Daniel, et al.
Published: (2025)

Quantum Algorithms on Edge Lists: Hiding, Shuffling, and Cycle Finding
by: Gilani, Amin Shiraz, et al.
Published: (2024)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023)

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

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

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
by: Lykov, Danylo, et al.
Published: (2022)

Basic Quantum Algorithms
by: Portugal, Renato
Published: (2022)

Uncloneable Quantum Advice
by: Broadbent, Anne, et al.
Published: (2023)

Quantum Communication Advantage in TFNP
by: Göös, Mika, et al.
Published: (2024)

Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)