Unifying quantum spatial search, state transfer and uniform sampling on graphs: simple and exact

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Qingwen, Jiang, Ying, Li, Lvzhou
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Quantum Physics Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
di: Apers, Simon, et al.
Pubblicazione: (2021)

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

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

Quantum-walk search in motion
di: Sahu, Himanshu, et al.
Pubblicazione: (2023)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
di: Chen, Tyler, et al.
Pubblicazione: (2025)

Simulating Gaussian boson sampling on graphs in polynomial time
di: Anand, Konrad, et al.
Pubblicazione: (2025)

On estimating the trace of quantum state powers
di: Liu, Yupan, et al.
Pubblicazione: (2024)

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

Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
di: Hong, Xin, et al.
Pubblicazione: (2025)

Quantum State Preparation Based on LimTDD
di: Hong, Xin, et al.
Pubblicazione: (2025)

Quantum property testing in sparse directed graphs
di: Apers, Simon, et al.
Pubblicazione: (2024)

An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
di: Liu, Wenjie, et al.
Pubblicazione: (2023)

Quantum algorithms and lower bounds for eccentricity, radius, and diameter in undirected graphs
di: Wesołowski, Adam, et al.
Pubblicazione: (2025)

Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling
di: Hwang, Yeongwoo, et al.
Pubblicazione: (2024)

Elfs, trees and quantum walks
di: Apers, Simon, et al.
Pubblicazione: (2022)

Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
di: Garg, Kushagra, et al.
Pubblicazione: (2025)

Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
di: Allcock, Jonathan, et al.
Pubblicazione: (2024)

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

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

Optimal lower bounds for quantum state tomography
di: Scharnhorst, Thilo, et al.
Pubblicazione: (2025)

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

Fast algorithms for classical specifications of stabiliser states and Clifford gates
di: de Silva, Nadish, et al.
Pubblicazione: (2023)

A Tensor Network based Decision Diagram for Representation of Quantum Circuits
di: Hong, Xin, et al.
Pubblicazione: (2020)

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

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

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

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

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

Quantum Speedup for Hypergraph Sparsification
di: Liu, Chenghua, et al.
Pubblicazione: (2025)

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

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

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

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

Quantum Metropolis Sampling via Weak Measurement
di: Jiang, Jiaqing, et al.
Pubblicazione: (2024)

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

A Dobrushin condition for quantum Markov chains: Rapid mixing and conditional mutual information at high temperature
di: Bakshi, Ainesh, et al.
Pubblicazione: (2025)

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

Quantum search in a dictionary based on fingerprinting-hashing
di: Ablayev, Farid, et al.
Pubblicazione: (2024)

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