Quantum Complexity vs Classical Complexity: A Survey
Fuente:
arXiv
Guardado en:
| Autores principales: | Vaezi, Arash, Movaghar, Ali, Ghodsi, Mohammad, Kazemi, Seyed Mohammad Hussein, Noghrehy, Negin Bagheri, Kazemi, Seyed Mohsen |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
por: Wu, Xudong, et al.
Publicado: (2025)
por: Wu, Xudong, et al.
Publicado: (2025)
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
por: Guan, Ziyi, et al.
Publicado: (2023)
por: Guan, Ziyi, et al.
Publicado: (2023)
Quantum Pseudorandomness and Classical Complexity
por: Kretschmer, William
Publicado: (2021)
por: Kretschmer, William
Publicado: (2021)
On the Complexity of Decoded Quantum Interferometry
por: Marwaha, Kunal, et al.
Publicado: (2025)
por: Marwaha, Kunal, et al.
Publicado: (2025)
Bosonic Quantum Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2024)
por: Chabaud, Ulysse, et al.
Publicado: (2024)
A Brief Introduction to Quantum Query Complexity
por: Hamoudi, Yassine
Publicado: (2025)
por: Hamoudi, Yassine
Publicado: (2025)
Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
por: Li, Xingjian, et al.
Publicado: (2023)
por: Li, Xingjian, et al.
Publicado: (2023)
Complexity Theory for Quantum Promise Problems
por: Chia, Nai-Hui, et al.
Publicado: (2024)
por: Chia, Nai-Hui, et al.
Publicado: (2024)
On the (Classical and Quantum) Fine-Grained Complexity of Approximate CVP and Max-Cut
por: Huang, Jeremy Ahrens, et al.
Publicado: (2024)
por: Huang, Jeremy Ahrens, et al.
Publicado: (2024)
NISQ Security and Complexity via Simple Classical Reasoning
por: Cojocaru, Alexandru, et al.
Publicado: (2025)
por: Cojocaru, Alexandru, et al.
Publicado: (2025)
Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
por: Barch, Brian, et al.
Publicado: (2025)
por: Barch, Brian, et al.
Publicado: (2025)
On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
por: Grewal, Sabee, et al.
Publicado: (2025)
por: Grewal, Sabee, et al.
Publicado: (2025)
Fine-Grained Complexity via Quantum Natural Proofs
por: Chen, Yanlin, et al.
Publicado: (2025)
por: Chen, Yanlin, et al.
Publicado: (2025)
Quantum entanglement dynamics in a three-qubit system interacting with a spin chain
por: Khansari, Seyed Mohsen Moosavi, et al.
Publicado: (2024)
por: Khansari, Seyed Mohsen Moosavi, et al.
Publicado: (2024)
Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
por: Hasegawa, Atsuya, et al.
Publicado: (2025)
por: Hasegawa, Atsuya, et al.
Publicado: (2025)
Quantum entanglement dynamics of the three-qubit W_zeta quantum state coupled to spin chain with ternary interaction
por: Khansari, Seyed Mohsen Moosavi, et al.
Publicado: (2024)
por: Khansari, Seyed Mohsen Moosavi, et al.
Publicado: (2024)
Hamiltonians whose low-energy states require $Ω(n)$ T gates
por: Coble, Nolan J., et al.
Publicado: (2023)
por: Coble, Nolan J., et al.
Publicado: (2023)
A Meta-Complexity Characterization of Quantum Cryptography
por: Cavalar, Bruno P., et al.
Publicado: (2024)
por: Cavalar, Bruno P., et al.
Publicado: (2024)
Separating Quantum and Classical Advice with Good Codes
por: Bostanci, John, et al.
Publicado: (2026)
por: Bostanci, John, et al.
Publicado: (2026)
Oracle Separations for the Quantum-Classical Polynomial Hierarchy
por: Agarwal, Avantika, et al.
Publicado: (2024)
por: Agarwal, Avantika, et al.
Publicado: (2024)
Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
por: Delavenne, Hugo, et al.
Publicado: (2024)
por: Delavenne, Hugo, et al.
Publicado: (2024)
A Note on the Complexity of the Spectral Gap Problem
por: Yirka, Justin
Publicado: (2025)
por: Yirka, Justin
Publicado: (2025)
The Complexity of Stoquastic Sparse Hamiltonians
por: Grilo, Alex B., et al.
Publicado: (2026)
por: Grilo, Alex B., et al.
Publicado: (2026)
Improved Circuit Lower Bounds and Quantum-Classical Separations
por: Grewal, Sabee, et al.
Publicado: (2024)
por: Grewal, Sabee, et al.
Publicado: (2024)
Classical Simulability of Quantum Circuits with Shallow Magic Depth
por: Zhang, Yifan, et al.
Publicado: (2024)
por: Zhang, Yifan, et al.
Publicado: (2024)
Coherence in Property Testing: Quantum-Classical Collapses and Separations
por: Jeronimo, Fernando Granha, et al.
Publicado: (2024)
por: Jeronimo, Fernando Granha, et al.
Publicado: (2024)
New Approaches to Complexity via Quantum Graphs
por: Culf, Eric, et al.
Publicado: (2023)
por: Culf, Eric, et al.
Publicado: (2023)
Accessible Quantum Correlations Under Complexity Constraints
por: Yángüez, Álvaro, et al.
Publicado: (2026)
por: Yángüez, Álvaro, et al.
Publicado: (2026)
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
por: Grewal, Sabee, et al.
Publicado: (2022)
por: Grewal, Sabee, et al.
Publicado: (2022)
Lower Bounds on Relative Error Quantum Compression and Classical Shadows
por: Sankar, Kaushik
Publicado: (2025)
por: Sankar, Kaushik
Publicado: (2025)
Quantum versus Classical Separation in Simultaneous Number-on-Forehead Communication
por: Yang, Guangxu, et al.
Publicado: (2025)
por: Yang, Guangxu, et al.
Publicado: (2025)
The Communication Complexity of Approximating Matrix Rank
por: Sherstov, Alexander A., et al.
Publicado: (2024)
por: Sherstov, Alexander A., et al.
Publicado: (2024)
Complexity and hardness of random peaked circuits
por: Zhang, Yuxuan
Publicado: (2025)
por: Zhang, Yuxuan
Publicado: (2025)
Complexity of Contextuality
por: Yianni, Theodoros, et al.
Publicado: (2025)
por: Yianni, Theodoros, et al.
Publicado: (2025)
Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams
por: Khadiev, Kamil, et al.
Publicado: (2017)
por: Khadiev, Kamil, et al.
Publicado: (2017)
Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
por: Yang, Guangxu, et al.
Publicado: (2026)
por: Yang, Guangxu, et al.
Publicado: (2026)
Raising the Bar: An Asymptotic Comparison of Classical and Quantum Shortest Path Algorithms
por: Do, Phuc Hao, et al.
Publicado: (2025)
por: Do, Phuc Hao, et al.
Publicado: (2025)
Improved Quantum Query Upper Bounds Based on Classical Decision Trees
por: Cornelissen, Arjan, et al.
Publicado: (2022)
por: Cornelissen, Arjan, et al.
Publicado: (2022)
On the Complexity of the Succinct State Local Hamiltonian Problem
por: Waite, Gabriel, et al.
Publicado: (2025)
por: Waite, Gabriel, et al.
Publicado: (2025)
The Round Complexity of Proofs in the Bounded Quantum Storage Model
por: Grilo, Alex B., et al.
Publicado: (2024)
por: Grilo, Alex B., et al.
Publicado: (2024)
Ejemplares similares
-
A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
por: Wu, Xudong, et al.
Publicado: (2025) -
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
por: Guan, Ziyi, et al.
Publicado: (2023) -
Quantum Pseudorandomness and Classical Complexity
por: Kretschmer, William
Publicado: (2021) -
On the Complexity of Decoded Quantum Interferometry
por: Marwaha, Kunal, et al.
Publicado: (2025) -
Bosonic Quantum Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2024)