Saved in:
| Main Authors: | Al-Dhalaan, Bandar, Ben-David, Shalev |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.08073 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Oracle Separations for the Quantum-Classical Polynomial Hierarchy
by: Agarwal, Avantika, et al.
Published: (2024)
by: Agarwal, Avantika, et al.
Published: (2024)
Separations in query complexity for total search problems
by: Ben-David, Shalev, et al.
Published: (2024)
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)
by: Ben-David, Shalev, et al.
Published: (2024)
Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023)
by: Yamakami, Tomoyuki
Published: (2023)
Direct Product Theorems for Randomized Query Complexity
by: Ben-David, Shalev, et al.
Published: (2025)
by: Ben-David, Shalev, et al.
Published: (2025)
Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
by: Takahashi, Jun, et al.
Published: (2024)
by: Takahashi, Jun, et al.
Published: (2024)
Random Unitaries in Constant (Quantum) Time
by: Foxman, Ben, et al.
Published: (2025)
by: Foxman, Ben, et al.
Published: (2025)
On the Rational Degree of Boolean Functions and Applications
by: Iyer, Vishnu, et al.
Published: (2023)
by: Iyer, Vishnu, et al.
Published: (2023)
On the Approximate Non-Deterministic Degree of Total Boolean Functions
by: Pednekar, Samruddhi, et al.
Published: (2026)
by: Pednekar, Samruddhi, et al.
Published: (2026)
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
by: Guan, Ziyi, et al.
Published: (2023)
by: Guan, Ziyi, et al.
Published: (2023)
Following Forrelation -- Quantum Algorithms in Exploring Boolean Functions' Spectra
by: Dutta, Suman, et al.
Published: (2021)
by: Dutta, Suman, et al.
Published: (2021)
The dihedral hidden subgroup problem
by: Chen, Imin, et al.
Published: (2021)
by: Chen, Imin, et al.
Published: (2021)
New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
by: Miloschewsky, David, et al.
Published: (2024)
by: Miloschewsky, David, et al.
Published: (2024)
Modifications of Quantum Computation and Adaptive Queries to PP
by: Miloschewsky, David, et al.
Published: (2025)
by: Miloschewsky, David, et al.
Published: (2025)
En Route to a Standard QMA1 vs. QCMA Oracle Separation
by: Miloschewsky, David, et al.
Published: (2026)
by: Miloschewsky, David, et al.
Published: (2026)
Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)
by: Kretschmer, William, et al.
Published: (2024)
Fast simulation of planar Clifford circuits
by: Gosset, David, et al.
Published: (2020)
by: Gosset, David, et al.
Published: (2020)
Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)
by: Morimae, Tomoyuki, et al.
Published: (2023)
Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval
by: Ma, Guangsheng, et al.
Published: (2024)
by: Ma, Guangsheng, et al.
Published: (2024)
Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
by: Kitagawa, Fuyuki, et al.
Published: (2023)
by: Kitagawa, Fuyuki, et al.
Published: (2023)
Quantum complexity of the Kronecker coefficients
by: Bravyi, Sergey, et al.
Published: (2023)
by: Bravyi, Sergey, et al.
Published: (2023)
Quantum information advantage based on Bell inequalities
by: Jain, Rahul, et al.
Published: (2026)
by: Jain, Rahul, et al.
Published: (2026)
Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
by: Iyer, Vishnu, et al.
Published: (2026)
by: Iyer, Vishnu, et al.
Published: (2026)
$\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
by: Grier, Daniel, et al.
Published: (2026)
by: Grier, Daniel, et al.
Published: (2026)
Quantum state isomorphism problems for groups
by: Gheorghiu, Alexandru, et al.
Published: (2026)
by: Gheorghiu, Alexandru, et al.
Published: (2026)
Separating Quantum and Classical Advice with Good Codes
by: Bostanci, John, et al.
Published: (2026)
by: Bostanci, John, et al.
Published: (2026)
A Relativizing MIP for BQP
by: Aaronson, Scott, et al.
Published: (2026)
by: Aaronson, Scott, et al.
Published: (2026)
Quantum Interactive Oracle Proofs
by: Sun, Baocheng, et al.
Published: (2026)
by: Sun, Baocheng, et al.
Published: (2026)
Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
by: Yang, Guangxu, et al.
Published: (2026)
by: Yang, Guangxu, et al.
Published: (2026)
Classical simulability of quantum circuits followed by sparse classical post-processing
by: Takahashi, Yasuhiro, et al.
Published: (2026)
by: Takahashi, Yasuhiro, et al.
Published: (2026)
The Complexity of Stoquastic Sparse Hamiltonians
by: Grilo, Alex B., et al.
Published: (2026)
by: Grilo, Alex B., et al.
Published: (2026)
Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
by: Gretta, Lucas, et al.
Published: (2026)
by: Gretta, Lucas, et al.
Published: (2026)
Quantum embedding of graphs for subgraph counting
by: Adhikari, Bibhas
Published: (2026)
by: Adhikari, Bibhas
Published: (2026)
Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
by: Guseynov, Nikita, et al.
Published: (2026)
by: Guseynov, Nikita, et al.
Published: (2026)
Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
by: Zschetzsche, Lilith, et al.
Published: (2026)
by: Zschetzsche, Lilith, et al.
Published: (2026)
IQP circuits for 2-Forrelation
by: Buzet, Quentin, et al.
Published: (2026)
by: Buzet, Quentin, et al.
Published: (2026)
A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'
by: Moosavian, Ali Hamed, et al.
Published: (2026)
by: Moosavian, Ali Hamed, et al.
Published: (2026)
Multi-Prover Interactive Proof Systems with Leakage
by: Asadi, Vahid R., et al.
Published: (2026)
by: Asadi, Vahid R., et al.
Published: (2026)
The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems
by: Gay, William, et al.
Published: (2026)
by: Gay, William, et al.
Published: (2026)
Quantum algorithms for path and cycle containment problems
by: Cornelissen, Arjan, et al.
Published: (2026)
by: Cornelissen, Arjan, et al.
Published: (2026)
Similar Items
-
Oracle Separations for the Quantum-Classical Polynomial Hierarchy
by: Agarwal, Avantika, et al.
Published: (2024) -
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) -
Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
by: Yamakami, Tomoyuki
Published: (2023) -
Direct Product Theorems for Randomized Query Complexity
by: Ben-David, Shalev, et al.
Published: (2025)