Imagen de Portada

The Space Just Above One Clean Qubit

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jacobs, Dale, Mehraban, Saeed
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quantum state isomorphism problems for groups
por: Gheorghiu, Alexandru, et al.
Publicado: (2026)

Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach
por: Mehraban, Saeed, et al.
Publicado: (2023)

Bosonic Quantum Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2024)

Qubit Routing for (Almost) Free
por: de Griend, Arianne Meijer-van
Publicado: (2026)

Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits
por: Silva, Jefferson D. S., et al.
Publicado: (2025)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
por: Acharya, Jayadev, et al.
Publicado: (2025)

Virtual Qudits for Simon's Problem: Dimension-Lifted Algorithms on Qubit Hardware
por: Semre, Abed, et al.
Publicado: (2025)

A Qubit, a Coin, and an Advice String Walk Into a Relational Problem
por: Aaronson, Scott, et al.
Publicado: (2023)

Solving The Travelling Salesman Problem Using A Single Qubit
por: Goswami, Kapil, et al.
Publicado: (2024)

Exponential Separation of Quantum and Classical One-Way Numbers-on-Forehead Communication
por: Yang, Guangxu, et al.
Publicado: (2026)

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

The Space-Time Cost of Purifying Quantum Computations
por: Zhandry, Mark
Publicado: (2024)

Quantum Query-Space Lower Bounds Using Branching Programs
por: Bera, Debajyoti, et al.
Publicado: (2024)

The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
por: Kahanamoku-Meyer, Gregory D., et al.
Publicado: (2024)

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

Quantum-Computable One-Way Functions without One-Way Functions
por: Kretschmer, William, et al.
Publicado: (2024)

On the Computational Hardness of Quantum One-Wayness
por: Cavalar, Bruno, et al.
Publicado: (2023)

Quantum Advantage from One-Way Functions
por: Morimae, Tomoyuki, et al.
Publicado: (2023)

A Note on Output Length of One-Way State Generators and EFIs
por: Hhan, Minki, et al.
Publicado: (2023)

Quantum Public-Key Encryption with Tamper-Resilient Public Keys from One-Way Functions
por: Kitagawa, Fuyuki, et al.
Publicado: (2023)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
por: Onah, Chinonso, et al.
Publicado: (2026)

Quantum First-Order Logics That Capture Logarithmic-Time/Space Quantum Computability
por: Yamakami, Tomoyuki
Publicado: (2025)

Commuting Local Hamiltonians Beyond 2D
por: Bostanci, John, et al.
Publicado: (2024)

Complexity Theory for Quantum Promise Problems
por: Chia, Nai-Hui, et al.
Publicado: (2024)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
por: Buhrman, Harry, et al.
Publicado: (2024)

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

Two prover perfect zero knowledge for MIP*
por: Mastel, Kieran, et al.
Publicado: (2024)

The Communication Complexity of Approximating Matrix Rank
por: Sherstov, Alexander A., et al.
Publicado: (2024)

Quantum Threshold is Powerful
por: Grier, Daniel, et al.
Publicado: (2024)

On the hardness of cloning and connections to representation theory
por: Havlíček, Vojtěch, et al.
Publicado: (2024)

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

Efficient approximate unitary designs from random Pauli rotations
por: Haah, Jeongwan, et al.
Publicado: (2024)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
por: Rudolph, Dorian, et al.
Publicado: (2024)

The status of the quantum PCP conjecture (games version)
por: Natarajan, Anand, et al.
Publicado: (2024)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
por: Chia, Nai-Hui, et al.
Publicado: (2024)

Computational complexity of isometric tensor network states
por: Malz, Daniel, et al.
Publicado: (2024)

A Quantum Unique Games Conjecture
por: Mousavi, Hamoon, et al.
Publicado: (2024)

Semi-Classical Subspaces, The No Synchronization Law, and More
por: Epstein, Samuel
Publicado: (2024)

Improved separation between quantum and classical computers for sampling and functional tasks
por: Marshall, Simon C., et al.
Publicado: (2024)

Towards a universal gateset for $\mathsf{QMA}_1$
por: Rudolph, Dorian
Publicado: (2024)