Imagen de Portada

Non-unitary enhanced transfer efficiency in quantum walk search on complex networks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Nzongani, Ugo, Simonetto, Andrea, Di Molfetta, Giuseppe
Formato:	Preprint
Publicado:	2025
Materias:	Quantum Physics Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Quantum collision circuit, quantum invariants and quantum phase estimation procedure for fluid dynamic lattice gas automata
por: Fonio, Niccolo, et al.
Publicado: (2023)

Elfs, trees and quantum walks
por: Apers, Simon, et al.
Publicado: (2022)

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
por: Nzongani, Ugo, et al.
Publicado: (2025)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
por: Sarkar, Rohit Sarma, et al.
Publicado: (2024)

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

Elfs, transducers and quantum walks
por: Apers, Simon, et al.
Publicado: (2026)

Query-optimal estimation of unitary channels in diamond distance
por: Haah, Jeongwan, et al.
Publicado: (2023)

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

Quantum Algorithms for One-Sided Crossing Minimization
por: Caroppo, Susanna, et al.
Publicado: (2024)

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

Are controlled unitaries helpful?
por: Tang, Ewin, et al.
Publicado: (2025)

Quantum Speedups for Polynomial-Time Dynamic Programming Algorithms
por: Caroppo, Susanna, et al.
Publicado: (2025)

Efficient learning of bosonic Gaussian unitaries
por: Fanizza, Marco, et al.
Publicado: (2025)

Quantum walks, the discrete wave equation and Chebyshev polynomials
por: Apers, Simon, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

Non-iid hypothesis testing: from classical to quantum
por: De Palma, Giacomo, et al.
Publicado: (2025)

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

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

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

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

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

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

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

Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
por: Pelofske, Elijah, et al.
Publicado: (2023)

Improved quantum algorithms for linear and nonlinear differential equations
por: Krovi, Hari
Publicado: (2022)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
por: Bouland, Adam, et al.
Publicado: (2024)

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

Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
por: AbuGhanem, M.
Publicado: (2024)