Image de couverture de livre

Big data applications on small quantum computers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yogendran, Boniface, Charlton, Daniel, Beddig, Miriam, Kolotouros, Ioannis, Wallden, Petros
Format:	Preprint
Publié:	2024
Sujets:	Quantum Physics Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Random Natural Gradient
par: Kolotouros, Ioannis, et autres
Publié: (2023)

Adiabatic quantum computing with parameterized quantum circuits
par: Kolotouros, Ioannis, et autres
Publié: (2022)

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
par: Garg, Kushagra, et autres
Publié: (2025)

An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms
par: Mitosek, Piotr, et autres
Publié: (2024)

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

Challenges for quantum computation of nonlinear dynamical systems using linear representations
par: Lin, Yen Ting, et autres
Publié: (2022)

Elfs, trees and quantum walks
par: Apers, Simon, et autres
Publié: (2022)

Randomized and quantum approximate matrix multiplication
par: Apers, Simon, et autres
Publié: (2025)

On the quantum time complexity of divide and conquer
par: Allcock, Jonathan, et autres
Publié: (2023)

Quartic quantum speedups for community detection
par: Schmidhuber, Alexander, et autres
Publié: (2025)

Variational ground-state quantum adiabatic theorem
par: Žunkovič, Bojan, et autres
Publié: (2024)

Analysis of sum-of-squares relaxations for the quantum rotor model
par: Rao, Sujit
Publié: (2023)

Assessing fault-tolerant quantum advantage for $k$-SAT with structure
par: Brehm, Martijn, et autres
Publié: (2024)

A quantum algorithm for solving 0-1 Knapsack problems
par: Wilkening, Sören, et autres
Publié: (2023)

Basic quantum subroutines: finding multiple marked elements and summing numbers
par: van Apeldoorn, Joran, et autres
Publié: (2023)

Nonlinear transformation of complex amplitudes via quantum singular value transformation
par: Guo, Naixu, et autres
Publié: (2021)

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks
par: Nzongani, Ugo, et autres
Publié: (2025)

Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact
par: Wang, Qingwen, et autres
Publié: (2024)

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

A simple analysis of a quantum-inspired algorithm for solving low-rank linear systems
par: Chen, Tyler, et autres
Publié: (2025)

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
par: Benchasattabuse, Naphan, et autres
Publié: (2023)

Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
par: Jennings, David, et autres
Publié: (2023)

Revisiting Majumdar-Ghosh spin chain model and Max-cut problem using variational quantum algorithms
par: Britant, et autres
Publié: (2024)

A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature
par: Bakshi, Ainesh, et autres
Publié: (2025)

Tolerant Testing of Stabilizer States with Mixed State Inputs
par: Iyer, Vishnu, et autres
Publié: (2024)

Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
par: Grewal, Sabee, et autres
Publié: (2025)

Quantum property testing in sparse directed graphs
par: Apers, Simon, et autres
Publié: (2024)

Agnostic Product Mixed State Tomography via Robust Statistics
par: Arulandu, Alvan, et autres
Publié: (2025)

Improved quantum algorithms for linear and nonlinear differential equations
par: Krovi, Hari
Publié: (2022)

Mixing time of quantum Gibbs sampling for random sparse Hamiltonians
par: Ramkumar, Akshar, et autres
Publié: (2024)

Accuracy and resource advantages of quantum eigenvalue estimation with non-Hermitian transcorrelated electronic Hamiltonians
par: Uvarov, Alexey, et autres
Publié: (2025)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
par: Sarkar, Rohit Sarma, et autres
Publié: (2024)

Elfs, transducers and quantum walks
par: Apers, Simon, et autres
Publié: (2026)

A simple lower bound for the complexity of estimating partition functions on a quantum computer
par: Chen, Zherui, et autres
Publié: (2024)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
par: Zhong, Dawei, et autres
Publié: (2024)

Exponential Quantum Advantage for Pathfinding in Regular Sunflower Graphs
par: Li, Jianqiang, et autres
Publié: (2024)

Tensor Decompositions and Adiabatic Quantum Computing for Discovering Practical Matrix Multiplication Algorithms
par: Uotila, Valter
Publié: (2024)

Quantum spectral method for gradient and Hessian estimation
par: Zhang, Yuxin, et autres
Publié: (2024)

Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
par: Sutcliffe, Matthew
Publié: (2024)

Enumeration algorithms for combinatorial problems using Ising machines: When should we stop exploring energy landscapes?
par: Mizuno, Yuta, et autres
Publié: (2024)