Lazy Quantum Walks with Native Multiqubit Gates
- URL: http://arxiv.org/abs/2511.21608v1
- Date: Wed, 26 Nov 2025 17:29:01 GMT
- Title: Lazy Quantum Walks with Native Multiqubit Gates
- Authors: Steph Foulds, Viv Kendon,
- Abstract summary: Neutral atom hardware is a promising choice of platform for implementing quantum walks.<n>We present the gate sequences and predicted final state fidelities for some toy quantum walks, including lazy' quantum walks.
- Score: 0.04297070083645049
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum walks, the quantum analogue to the classical random walk, have been shown to model fluid dynamics. Neutral atom hardware is a promising choice of platform for implementing quantum walks due to its ability to implement native multiqubit ($\geq\!3$-qubit) gates and to dynamically re-arrange qubits. Using error modelling for multiqubit Rydberg gates via two-photon adiabatic rapid passage, we present the gate sequences and predicted final state fidelities for some toy quantum walks, including `lazy' quantum walks. These `lazy' quantum walks include a rest state and therefore provide an integral step towards quantum walks for fluid simulation.
Related papers
- Quantum walk with coherent multiple translations induces fast quantum gate operations [1.7532494590119037]
We study a ring under the strong resonant modulation that can support discrete-time quantum walk.<n>Multiple translation paths are added in a coherent way, which makes the walker evolve under the topological band.<n>Our study uses a single ring to provide fast quantum gate operations based on coherent multiple path quantum walk.
arXiv Detail & Related papers (2025-04-07T12:14:19Z) - Quantum communication scheme to teleport arbitrary quantum state via discrete time quantum walks [0.0]
We propose a quantum communication protocol via 2-step discrete time quantum walks with two coins on a graph of 10 vertices containing both cycles and paths.<n>We calculate the total final quantum state of the system as well as the recovery operators to rescue the initial quantum state back at the receiver's location.
arXiv Detail & Related papers (2025-01-20T23:18:00Z) - Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Phase transition of a continuous-time quantum walk on the half line [0.0]
Quantum walks are referred to as quantum analogs to random walks in mathematics.
We study a continuous-time quantum walk on the half line and challenge to find a limit theorem for it in this paper.
arXiv Detail & Related papers (2024-03-20T13:21:29Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks [0.0]
We develop a length-3 dynamic quantum walk that implements any single-qubit gate.
We extend this result to give length-3 dynamic quantum walks that implement any single-qubit gate controlled by any number of qubits.
arXiv Detail & Related papers (2021-08-02T17:23:14Z) - Quantum walk processes in quantum devices [55.41644538483948]
We study how to represent quantum walk on a graph as a quantum circuit.
Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv Detail & Related papers (2020-12-28T18:04:16Z) - Gate-Based Circuit Designs For Quantum Adder Inspired Quantum Random
Walks on Superconducting Qubits [0.0]
We examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator.
We focus on the strengths and weaknesses of these walks, particularly circuit depth, gate count, connectivity requirements, and scalability.
We present several fidelity results from running our circuits on IBM's quantum volume 32 Toronto' chip, showcasing the extent to which these NISQ devices can currently handle quantum walks.
arXiv Detail & Related papers (2020-12-18T14:34:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.