Cover Image

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Garg, Kushagra, Ahmed, Zeeshan, Mitra, Subhadip, Chakraborty, Shantanav
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
by: Chakraborty, Shantanav
Published: (2023)

Assessing fault-tolerant quantum advantage for $k$-SAT with structure
by: Brehm, Martijn, et al.
Published: (2024)

Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
by: Chakraborty, Shantanav, et al.
Published: (2025)

Randomized Quantum Singular Value Transformation
by: Wang, Xinzhao, et al.
Published: (2025)

Big data applications on small quantum computers
by: Yogendran, Boniface, et al.
Published: (2024)

Unstructured Adiabatic Quantum Optimization: Optimality with Limitations
by: Braida, Arthur, et al.
Published: (2024)

Certifying and learning quantum Ising Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2025)

Certifying and learning local quantum Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2026)

Testing and learning structured quantum Hamiltonians
by: Arunachalam, Srinivasan, et al.
Published: (2024)

Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
by: Ramkumar, Akshar, et al.
Published: (2024)

Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
by: Zhou, Shuo, et al.
Published: (2026)

Challenges for quantum computation of nonlinear dynamical systems using linear representations
by: Lin, Yen Ting, et al.
Published: (2022)

Analysis of sum-of-squares relaxations for the quantum rotor model
by: Rao, Sujit
Published: (2023)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
by: Britant, et al.
Published: (2024)

Learning quantum Hamiltonians at any temperature in polynomial time
by: Bakshi, Ainesh, et al.
Published: (2023)

Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians
by: Uvarov, Alexey, et al.
Published: (2025)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
by: Narayanan, Shyam
Published: (2024)

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
by: Haah, Jeongwan, et al.
Published: (2021)

Elfs, trees and quantum walks
by: Apers, Simon, et al.
Published: (2022)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
by: Abbas, Amira, et al.
Published: (2025)

Randomized and quantum approximate matrix multiplication
by: Apers, Simon, et al.
Published: (2025)

Quartic quantum speedups for community detection
by: Schmidhuber, Alexander, et al.
Published: (2025)

On the quantum time complexity of divide and conquer
by: Allcock, Jonathan, et al.
Published: (2023)

Variational ground-state quantum adiabatic theorem
by: Žunkovič, Bojan, et al.
Published: (2024)

Many Hamiltonians Are Sparsifiable
by: Basu, Arpon, et al.
Published: (2026)

A quantum algorithm for solving 0-1 Knapsack problems
by: Wilkening, Sören, et al.
Published: (2023)

Improved approximation algorithms for the EPR Hamiltonian
by: Ju, Nathan, et al.
Published: (2025)

Noise tolerance via reinforcement in the quantum search problem
by: Homayouni-Sangari, Marjan, et al.
Published: (2026)

Basic quantum subroutines: finding multiple marked elements and summing numbers
by: van Apeldoorn, Joran, et al.
Published: (2023)

Nonlinear transformation of complex amplitudes via quantum singular value transformation
by: Guo, Naixu, et al.
Published: (2021)

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks
by: Nzongani, Ugo, et al.
Published: (2025)

Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
by: Wang, Qingwen, et al.
Published: (2024)

Robust and optimal loading of general classical data into quantum computers
by: Zhang, Xiao-Ming
Published: (2024)

A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
by: Rao, Sujit
Published: (2025)

Conjectured Bounds for 2-Local Hamiltonians via Token Graphs
by: Apte, Anuj, et al.
Published: (2025)

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
by: Chen, Tyler, et al.
Published: (2025)

Heisenberg-limited Hamiltonian learning without short-time control
by: Shin, Myeongjin, et al.
Published: (2026)

A unified approach to quantum de Finetti theorems and SoS rounding via geometric quantization
by: Rao, Sujit
Published: (2024)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
by: Benchasattabuse, Naphan, et al.
Published: (2023)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
by: Jennings, David, et al.
Published: (2023)