Image de couverture de livre

Assessing fault-tolerant quantum advantage for $k$-SAT with structure

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brehm, Martijn, Weggemans, Jordi
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

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

Quantum Graph-State Synthesis with SAT
par: Brand, Sebastiaan, et autres
Publié: (2023)

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

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
par: Goh, Mark, et autres
Publié: (2026)

Simple Quantum Algorithm for Approximate $k$-Mismatch Problem
par: Habib, Ruhan, et autres
Publié: (2025)

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

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

Testing and learning structured quantum Hamiltonians
par: Arunachalam, Srinivasan, et autres
Publié: (2024)

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)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
par: Chen, Tyler, et autres
Publié: (2025)

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

Big data applications on small quantum computers
par: Yogendran, Boniface, et autres
Publié: (2024)

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

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

Polynomial-time tolerant testing stabilizer states
par: Arunachalam, Srinivasan, et autres
Publié: (2024)

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)

Exponential quantum advantages for practical non-Hermitian eigenproblems
par: Zhang, Xiao-Ming, et autres
Publié: (2024)

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

Noise tolerance via reinforcement in the quantum search problem
par: Homayouni-Sangari, Marjan, et autres
Publié: (2026)

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)

A note on polynomial-time tolerant testing stabilizer states
par: Arunachalam, Srinivasan, et autres
Publié: (2024)

Fault-tolerant $k$-Supplier with Outliers
par: Chakrabarty, Deeparnab, et autres
Publié: (2023)

A Quantum Approximation Scheme for k-Means
par: Jaiswal, Ragesh
Publié: (2023)

Learning $k$-body Hamiltonians via compressed sensing
par: Ma, Muzhou, et autres
Publié: (2024)

A Classical Quadratic Speedup for Planted $k$XOR
par: Gupta, Meghal, et autres
Publié: (2025)

New Algorithms for #2-SAT and #3-SAT
par: Peng, Junqiang, 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)

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)

Counting random $k$-SAT near the satisfiability threshold
par: Chen, Zongchen, et autres
Publié: (2024)