Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2509.00386 · Physical Review A

Continuous-time quantum-walk-based ansätze on neutral-atom hardware

Edric Matwiejew, Jonathan Wurtz, Jing Chen, Pascal J. Elahi, Tommaso Macrì, Ugo Varetto

Published Jul 9, 2026• 2 citations
arXivHTMLPDF

Abstract

Continuous-time quantum walks offer provable speedups for certain computational problems, yet translating these advantages to near-term hardware remains challenging. We realize variational ans\"atze based on continuous-time quantum walks on an analog neutral-atom processor. For unentangled targets, we derive closed-form expressions for near-optimal control parameters that transfer directly to hardware with minimal calibration. On QuEra's Aquila processor, we observe the superquadratic convergence characteristic of efficient quantum walk algorithms, visible at low circuit depth, with theory predicting stronger speedups as hardware improves. For entangled targets, specifically symmetric superpositions in the Rydberg-blockaded subspace, we introduce an optimization protocol exploiting spectral properties of the walk dynamics. The required evolution timescales inversely with the spectral gap, offering an advantage over adiabatic protocols, whose evolution timescales as the inverse square of the spectral gap. We verify this scaling behavior on Aquila and confirm that the prepared states are coherent superpositions via quench dynamics. Our results establish a practical pathway from abstract quantum walk algorithms to analog quantum processors, demonstrating that the dynamics underlying their potential for superquadratic quantum speedup are accessible on current devices.

DOI
10.1103/cbd2-635q

Related papers

Engineering Quantum States with Neutral Atoms

J. T. Balewski, Milan Kornjača, Katherine Klymko +5 more

Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum simulators that generate Bell state entanglement far away from the blockade regime, construct a Z2 state with a defect induced by an ancilla, and optimize the driving fields schedule to prepare excited states with enhanced fidelity. We additionally evaluate the effectiveness of readout error mitigation techniques in improving the fidelity of measurement results. All experiments were executed on Aquila from QuEra and facilitated by the AWS Braket interface. Our experimental results closely align with theoretical predictions and numerical simulations. The insights gained from this study showcase Aquila's capabilities in handling complex quantum simulations and computations, and also pave the way for new avenues of research in quantum information processing and physics that employ programmable analog hardware platforms.

arXiv:2404.04411•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•8 citations

Performant near-term quantum combinatorial optimization

Titus Morris, Kaushik, Ananth, Martin Roetteler +1 more

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational advantages. To address this we present a variational quantum algorithm for solving combinatorial optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target combinatorial function, along with parameter updates following a modified version of quantum imaginary time evolution. We evaluate this ansatz in numerical simulations that target solutions to the MAXCUT problem. The state evolution is shown to closely mimic imaginary time evolution, and its optimal-solution convergence is further improved using adaptive transformations of the classical Hamiltonian spectrum. With these innovations, the algorithm consistently converges to optimal solutions, with interesting highly-entangled dynamics along the way. We further demonstrate the success of this approach by performing optimization of a truncated version of our ansatz with up to 32 qubits in a trapped-ion quantum computer, using measurements from the quantum computer to train the ansatz and prepare optimal solutions with high fidelity in the majority of cases we consider. The success of these large-scale quantum circuit optimizations, in the presence of realistic hardware constraints and without error mitigation, mark significant progress on the path towards solving combinatorial problems using quantum computers. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.

arXiv:2404.16135•Apr 24, 2024•21 citations

A Variational Surrogate Approach to Finite-Horizon Quantum Control via Hardware-Efficient Ansatz

Nahid Binandeh Dehaghani, Rafal Wisniewski, A. Pedro Aguiar

We present a variational quantum framework for finite-horizon quantum control based on hardware-efficient ansätze. The objective is to steer a quantum system from a given initial state to a desired target state over a fixed time horizon by minimizing a terminal cost defined in terms of state fidelity. Instead of explicitly synthesizing time-dependent control fields or enforcing Hamiltonian reachability constraints, the proposed method reformulates the control objective as a variational optimization problem in which a hardware-efficient parameterized quantum circuit provides a surrogate parameterization of the terminal evolution. The circuit consists of alternating layers of single-qubit rotations and entangling gates, whose parameters are optimized using classical routines to minimize the terminal infidelity. This formulation avoids reliance on problem-specific or physics-inspired ansätze, providing a flexible and implementation-friendly approach compatible with near-term quantum devices. Numerical experiments on multi-qubit state-transfer benchmarks demonstrate high-fidelity state transfer while highlighting the trade-off between ansatz expressivity, optimization complexity, and scalability with respect to system size and circuit depth.

quant-pharXiv:2607.12802•Jul 15, 2026•0 citations

Analog counterdiabatic quantum computing

Qi Zhang, Narendra N. Hegade, Alejandro Gomez Cadavid +7 more

Harnessing the analog capacity of quantum processors at the algorithmic level is key to solving computationally hard problems. Neutral atoms offer analog capabilities supporting hundreds of qubits, but state-of-the-art adiabatic protocol struggles with nonadiabatic errors, restricting scalability due to finite coherence times. To address this, we propose and experimentally demonstrate a tailored analog counterdiabatic quantum computing (ACQC) protocol to enhance the computational capabilities of neutral atoms by mitigating non-adiabatic transitions and facilitating rapid and high-quality solutions. We apply it to solve the maximum independent set problem with up to 100 qubits, achieving over 3-fold speedup in convergence time and solution quality within a short evolution time of the processor, as compared to adiabatic method. Our method shows scalibility of the application of neutral atom processors establishing ACQC as a promising pathway toward quantum advantage for real-world industrial applications.

arXiv:2405.14829•npj Unconventional Computing•Mar 2, 2026•12 citations

Noise-aware emulation and cross-device validation of neutral atom analog quantum processing units

Constantin Dalyac, Sergi Julià-Farré, Lucas Leclerc +26 more

Analog quantum processors based on Rydberg atom arrays are a powerful platform for many-body quantum simulation, combinatorial optimization, and graph machine learning. As these devices become increasingly accessible, establishing confidence in their outputs requires predictive models that quantitatively connect microscopic hardware imperfections to empirical results. Here, we present a noise-aware emulation framework that propagates the dominant noise mechanisms throughout the full computation cycle to predict device behavior. We validate the framework by benchmarking two representative protocols, quantum annealing and post-quench dynamics, on three Pasqal quantum processors where classical simulations still provide ground truth. Across all three devices, the measured observables fall within the uncertainty envelopes predicted by the emulator. Beyond reproducing the data, the framework isolates which physical mechanism dominates in each operating regime, provides quantitative guidance for algorithm design and hardware improvements, and establishes a foundation for verifying analog processors in regimes beyond classical reach.

quant-pharXiv:2607.28364•Jul 31, 2026•2 citations

Constant Depth Digital-Analog Counterdiabatic Quantum Computing

Balaganchi A. Bhargava, Shubham Kumar, Anne-Maria Visuri +3 more

We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware. Counterdiabatic protocols suppress diabatic excitations in finite-time adiabatic evolution, but their practical application is limited by the non-local structure of the required Hamiltonians and the resource overhead of fully digital implementations. Counterdiabatic terms can be expressed as truncated expansions of nested commutators of the adiabatic Hamiltonian and its parametric derivative. Here, we show how this algebraic structure can be efficiently realized in a digital-analog setting using commutator product formulas. Using native multi-qubit analog interactions augmented by local single-qubit rotations, this approach enables higher-order counterdiabatic protocols whose implementation requires a constant number of analog blocks for any fixed truncation order, independent of system size. We demonstrate the method for two-dimensional spin models and analyze the associated approximation errors. These results show that digital-analog quantum computing enables a qualitatively new resource scaling for counterdiabatic protocols and related quantum control primitives, with direct implications for quantum simulation, optimization, and algorithmic state preparation on current quantum devices.

quant-pharXiv:2601.01154•Jan 6, 2026•4 citations
Continuous-time quantum walks offer provable speedups for certain computational problems, yet translating these advantages to near-term hardware remains challenging. We realize variational ans"atze based on continuous-time quantum walks on an analog neutral-atom processor. For unentangled targets, we derive closed-form expressions for near-optimal control parameters that transfer directly to hardware with minimal calibration. On QuEra's Aquila processor, we observe the superquadratic convergence characteristic of efficient quantum walk algorithms, visible at low circuit depth, with theory predicting stronger speedups as hardware improves. For entangled targets, specifically symmetric superpositions in the Rydberg-blockaded subspace, we introduce an optimization protocol exploiting spectral properties of the walk dynamics. The required evolution timescales inversely with the spectral gap, offering an advantage over adiabatic protocols, whose evolution timescales as the inverse square of the spectral gap. We verify this scaling behavior on Aquila and confirm that the prepared states are coherent superpositions via quench dynamics. Our results establish a practical pathway from abstract quantum walk algorithms to analog quantum processors, demonstrating that the dynamics underlying their potential for superquadratic quantum speedup are accessible on current devices.
Aquila, an analog quantum simulation platform developed by QuEra Computing, supports control of the position and coherent evolution of up to 256 neutral atoms. This study details novel experimental protocols designed for analog quantum simulators that generate Bell state entanglement far away from the blockade regime, construct a Z2 state with a defect induced by an ancilla, and optimize the driving fields schedule to prepare excited states with enhanced fidelity. We additionally evaluate the effectiveness of readout error mitigation techniques in improving the fidelity of measurement results. All experiments were executed on Aquila from QuEra and facilitated by the AWS Braket interface. Our experimental results closely align with theoretical predictions and numerical simulations. The insights gained from this study showcase Aquila's capabilities in handling complex quantum simulations and computations, and also pave the way for new avenues of research in quantum information processing and physics that employ programmable analog hardware platforms.
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational advantages. To address this we present a variational quantum algorithm for solving combinatorial optimization problems with linear-depth circuits. Our algorithm uses an ansatz composed of Hamiltonian generators designed to control each term in the target combinatorial function, along with parameter updates following a modified version of quantum imaginary time evolution. We evaluate this ansatz in numerical simulations that target solutions to the MAXCUT problem. The state evolution is shown to closely mimic imaginary time evolution, and its optimal-solution convergence is further improved using adaptive transformations of the classical Hamiltonian spectrum. With these innovations, the algorithm consistently converges to optimal solutions, with interesting highly-entangled dynamics along the way. We further demonstrate the success of this approach by performing optimization of a truncated version of our ansatz with up to 32 qubits in a trapped-ion quantum computer, using measurements from the quantum computer to train the ansatz and prepare optimal solutions with high fidelity in the majority of cases we consider. The success of these large-scale quantum circuit optimizations, in the presence of realistic hardware constraints and without error mitigation, mark significant progress on the path towards solving combinatorial problems using quantum computers. We conclude our performant and resource-minimal approach is a promising candidate for potential quantum computational advantages.
We present a variational quantum framework for finite-horizon quantum control based on hardware-efficient ansätze. The objective is to steer a quantum system from a given initial state to a desired target state over a fixed time horizon by minimizing a terminal cost defined in terms of state fidelity. Instead of explicitly synthesizing time-dependent control fields or enforcing Hamiltonian reachability constraints, the proposed method reformulates the control objective as a variational optimization problem in which a hardware-efficient parameterized quantum circuit provides a surrogate parameterization of the terminal evolution. The circuit consists of alternating layers of single-qubit rotations and entangling gates, whose parameters are optimized using classical routines to minimize the terminal infidelity. This formulation avoids reliance on problem-specific or physics-inspired ansätze, providing a flexible and implementation-friendly approach compatible with near-term quantum devices. Numerical experiments on multi-qubit state-transfer benchmarks demonstrate high-fidelity state transfer while highlighting the trade-off between ansatz expressivity, optimization complexity, and scalability with respect to system size and circuit depth.
Harnessing the analog capacity of quantum processors at the algorithmic level is key to solving computationally hard problems. Neutral atoms offer analog capabilities supporting hundreds of qubits, but state-of-the-art adiabatic protocol struggles with nonadiabatic errors, restricting scalability due to finite coherence times. To address this, we propose and experimentally demonstrate a tailored analog counterdiabatic quantum computing (ACQC) protocol to enhance the computational capabilities of neutral atoms by mitigating non-adiabatic transitions and facilitating rapid and high-quality solutions. We apply it to solve the maximum independent set problem with up to 100 qubits, achieving over 3-fold speedup in convergence time and solution quality within a short evolution time of the processor, as compared to adiabatic method. Our method shows scalibility of the application of neutral atom processors establishing ACQC as a promising pathway toward quantum advantage for real-world industrial applications.
Analog quantum processors based on Rydberg atom arrays are a powerful platform for many-body quantum simulation, combinatorial optimization, and graph machine learning. As these devices become increasingly accessible, establishing confidence in their outputs requires predictive models that quantitatively connect microscopic hardware imperfections to empirical results. Here, we present a noise-aware emulation framework that propagates the dominant noise mechanisms throughout the full computation cycle to predict device behavior. We validate the framework by benchmarking two representative protocols, quantum annealing and post-quench dynamics, on three Pasqal quantum processors where classical simulations still provide ground truth. Across all three devices, the measured observables fall within the uncertainty envelopes predicted by the emulator. Beyond reproducing the data, the framework isolates which physical mechanism dominates in each operating regime, provides quantitative guidance for algorithm design and hardware improvements, and establishes a foundation for verifying analog processors in regimes beyond classical reach.
We introduce a digital-analog quantum computing framework that enables counterdiabatic protocols to be implemented at constant circuit depth, allowing fast and resource-efficient quantum state preparation on current quantum hardware. Counterdiabatic protocols suppress diabatic excitations in finite-time adiabatic evolution, but their practical application is limited by the non-local structure of the required Hamiltonians and the resource overhead of fully digital implementations. Counterdiabatic terms can be expressed as truncated expansions of nested commutators of the adiabatic Hamiltonian and its parametric derivative. Here, we show how this algebraic structure can be efficiently realized in a digital-analog setting using commutator product formulas. Using native multi-qubit analog interactions augmented by local single-qubit rotations, this approach enables higher-order counterdiabatic protocols whose implementation requires a constant number of analog blocks for any fixed truncation order, independent of system size. We demonstrate the method for two-dimensional spin models and analyze the associated approximation errors. These results show that digital-analog quantum computing enables a qualitatively new resource scaling for counterdiabatic protocols and related quantum control primitives, with direct implications for quantum simulation, optimization, and algorithmic state preparation on current quantum devices.