Imagen de Portada

Future of Quantum Computing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aaronson, Scott, Childs, Andrew M., Farhi, Edward, Harrow, Aram W., Sanders, Barry C.
Formato:	Preprint
Publicado:	2025
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Quantum entropy thermalization
por: Huang, Yichen, et al.
Publicado: (2023)

Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
por: Harrow, Aram W., et al.
Publicado: (2024)

Quantum Computation
por: Sanders, Barry C
Publicado: (2024)

An Exponential Sample-Complexity Advantage for Coherent Quantum Inference
por: Li, Zhaoyi, et al.
Publicado: (2026)

Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs
por: Li, Zhaoyi, et al.
Publicado: (2026)

Why Philosophers Should Care About Computational Complexity
por: Aaronson, Scott
Publicado: (2011)

Randomized truncation of quantum states
por: Harrow, Aram W., et al.
Publicado: (2025)

Exponential speedups for quantum walks in random hierarchical graphs
por: Balasubramanian, Shankar, et al.
Publicado: (2023)

On verifiable quantum advantage with peaked circuit sampling
por: Aaronson, Scott, et al.
Publicado: (2024)

Blindly Factorizing 21 Quantumly
por: Das, Aritra, et al.
Publicado: (2022)

Efficiently constructing a quantum uniform superposition over bit strings near a binary linear code
por: Farhi, Edward, et al.
Publicado: (2024)

Phase estimation with partially randomized time evolution
por: Günther, Jakob, et al.
Publicado: (2025)

Quadratic Quantum Speedup for Perceptron Training
por: Liao, Pengcheng, et al.
Publicado: (2021)

Improved concentration of Laguerre and Jacobi ensembles
por: Huang, Yichen, et al.
Publicado: (2022)

Limits to black-box amplification in QMA
por: Aaronson, Scott, et al.
Publicado: (2025)

Quantum algorithm for linear non-unitary dynamics with near-optimal dependence on all parameters
por: An, Dong, et al.
Publicado: (2023)

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

Quantum-Assisted Support Vector Regression
por: Dalal, Archismita, et al.
Publicado: (2021)

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

TEPID-ADAPT: Adaptive variational method for simultaneous preparation of low-temperature Gibbs and low-lying eigenstates
por: Sambasivam, Bharath, et al.
Publicado: (2025)

Pseudo-deterministic Quantum Algorithms
por: Aaronson, Hugo, et al.
Publicado: (2026)

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal
por: Carolan, Joseph, et al.
Publicado: (2025)

Quantum lower bounds for simulating fluid dynamics
por: Ameri, Abtin, et al.
Publicado: (2026)

Computability Theory of Closed Timelike Curves
por: Aaronson, Scott, et al.
Publicado: (2016)

The Acrobatics of BQP
por: Aaronson, Scott, et al.
Publicado: (2021)

Plethysm is in #BQP
por: Christandl, Matthias, et al.
Publicado: (2026)

Quantum Routing with Teleportation
por: Devulapalli, Dhruv, et al.
Publicado: (2022)

Framework for Learning and Control in the Classical and Quantum Domains
por: Vedaie, Seyed Shakib, et al.
Publicado: (2023)

Low-depth quantum symmetrization
por: Liu, Zhenning, et al.
Publicado: (2024)

Entanglement accelerates quantum simulation
por: Zhao, Qi, et al.
Publicado: (2024)

A Relativizing MIP for BQP
por: Aaronson, Scott, et al.
Publicado: (2026)

Quantum Routing and Entanglement Dynamics Through Bottlenecks
por: Devulapalli, Dhruv, et al.
Publicado: (2025)

Lower bounding the MaxCut of high girth 3-regular graphs using the QAOA
por: Farhi, Edward, et al.
Publicado: (2025)

Quantum Speedups for Derivative Pricing Beyond Black-Scholes
por: Herman, Dylan, et al.
Publicado: (2026)

Universal transversal gates
por: Gupta, Pragati, et al.
Publicado: (2024)

Randomized benchmarking for qudit Clifford gates
por: Jafarzadeh, Mahnaz, et al.
Publicado: (2019)

Quantum Algorithms for Heterogeneous PDEs: The Neutron Diffusion Eigenvalue Problem
por: Childs, Andrew M., et al.
Publicado: (2026)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
por: Aaronson, Scott, et al.
Publicado: (2024)

Quantum divide and conquer
por: Childs, Andrew M., et al.
Publicado: (2022)

Non-Adiabatic Quantum Optimization for Crossing Quantum Phase Transitions
por: Grabarits, András, et al.
Publicado: (2024)