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:2601.01759 · Physical Review Letters

Demonstration of Discrete-Time Quantum Walks and Observation of Topological Edge States in a Superconducting Qutrit Chain

Kun Zhou, Jian-Wen Xu, Qi-Ping Su, Yu Zhang, Xiang-Min Yu, Zhuang Ma, Han-Yu Zhang, Hong-Yi Shi, Wen Zheng, Shu-Yi Pan, Yi-Hao Kang, Zhi-Guo Huang, Chui-Ping Yang, Shao-Xiong Li, Yang Yu

quant-phSubmitted Jan 5, 2026• Announced Jan 6, 2026• 5 citations
arXivHTMLPDF

Abstract

Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such as operation precision, circuit depth and connectivity. With improved hardware efficiency by using superconducting qutrits (three-level systems), we experimentally demonstrate a scalable DTQW in a superconducting circuit, observing the ballistic spreading of quantum walk in a qutrit chain. The usage of qutrits in our implementation allows hardware efficiently encoding of the walker position and the coin degree of freedom. By exploiting the flexibility and intrinsic symmetries of qutrit-based DTQWs, we successfully prepare two topological phases in the chain. For the first time, particle-hole-symmetry-protected edge states, bounded at the interface between these two topological phases, are observed in the superconducting platform. Measured parameter dependencies further validate the properties of edge states. The scalability and gate-control compatibility of the demonstrated DTQWs enable a versatile tool for superconducting quantum computing and quantum simulation.

Journal reference
Physical Review Letters 135, 250601 (2025)
DOI
10.1103/5lm1-2kpk
Comments
8 pages, 4 figures

Related papers

Topological invariants in quantum walks

Andrzej Grudka, Marcin Karczewski, Paweł Kurzyński +2 more

Discrete-time quantum walks (DTQWs) provide a convenient platform for a realization of many topological phases in noninteracting systems. They often offer more possibilities than systems with a static Hamiltonian. Nevertheless, researchers are still looking for DTQW symmetries protecting topological phases and for definitions of appropriate topological invariants. Although the majority of DTQW studies on this topic focus on the so-called split-step quantum walk, two distinct topological phases can be observed in more basic models. Here we infer topological properties of the basic DTQWs directly from the mapping of the Brillouin zone to the Bloch Hamiltonian. We show that for translation-symmetric systems they can be characterized by a homotopy relative to special points. We also propose a topological invariant corresponding to this concept. This invariant indicates the number of edge states at the interface between two distinct phases.

arXiv:2209.12820•Physical Review A•Mar 1, 2023•9 citations

Implementing quantum walks with a single qubit

Qi-Ping Su, Shi-Chao Wang, Yan Chi +5 more

Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks (DTQWs) using only a single qubit, in which both coin and walker are encoded in the two-dimensional state space of a single qubit, operations are realized using single-qubit gates only, and high-dimensional final states of DTQWs can be obtained naturally. With this "one-qubit" approach, DTQW experiments can be realized much more easily, compared with previous methods, in most quantum systems and all properties based on quantum states of DTQWs (such as quantum correlation and coherence) can be investigated. By this approach, we experimentally implement one-particle and two-particle DTQWs with seven steps using single photons. Furthermore, we systematically investigate quantum correlations and coherence (based on the full state of the coin and walker) of the DTQW systems with different initial states of the coin, which have not been obtained and studied in DTQW experiments. As an application, we also study the assisted distillation of quantum coherence using the full state of the two-particle DTQW from the experiment. The maximal increase in distillable coherence for high-dimensional mixed states is investigated for the first time by obtaining its upper and lower bounds. Our work opens a new door to implement DTQW experiments and to better explore properties of quantum walks.

arXiv:2206.03642•Jun 8, 2022•1 citation

Optimizing topology for quantum probing with discrete-time quantum walks

Simone Cavazzoni, Paolo Bordone, Matteo G. A. Paris

Discrete-time quantum walk (DTQW) represents a convenient mathematical framework for describing the motion of a particle on a discrete set of positions when this motion is conditioned by the values of certain internal degrees of freedom, which are usually referred to as the coin of the particle. As such, and owing to the inherent dependence of the position distribution on the coin degrees of freedom, DTQWs naturally emerge as promising candidates for quantum metrology. In this paper, we explore the use of DTQWs as quantum probes in scenarios where the parameter of interest is encoded in the internal degree of freedom of the walker and investigate the role of the topology of the walker's space on the attainable precision. In particular, we start considering the encoding of the parameter by rotations for a walker on the line and evaluate the quantum Fisher information (QFI) and the position Fisher information (FI), explicitly determining the optimal initial state in position space that maximizes the QFI across all encoding schemes. This allows us to understand the role of interference in the position space and to introduce an optimal topology, which maximizes the QFI of the coin parameter and makes the position FI equal to the QFI.

arXiv:2405.17354•AVS Quantum Science•Oct 4, 2024•1 citation

A Quantum Walk Across Biological Networks: A Demonstration on a 40-Qubit Superconducting Processor

inquantio

A joint team from Algorithmiq and IBM Quantum has run a discrete-time quantum walk (DTQW) on complex networks drawn from protein-protein interaction (PPI) data, using 40 qubits of real quantum hardware. Rather than accept the extreme circuit depth demanded by conventional dense encodings, the researchers traded depth for qubit count, pairing a symmetry-sector encoding with postselection. On a benchmark graph this cut the depth of a single walk step by roughly two orders of magnitude. Applied to an asthma-associated gene network, the walk lifted FLVCR1, a gene placed well down the list by classical benchmark methods, to fourth position. The authors attribute the shift to quantum interference and present the case as a proof of principle for network medicine. [Quantum Biology Society] In network medicine, where disease mechanisms are read off the interaction networks that link proteins and genes, the classical random walk has long been a workhorse. A walker hops between nodes at random, and the resulting visit frequencies serve as a measure of importance. Adding the quantum principles of superposition and interference produces a quantum walk, whose probability spreads through a graph in a way that has no classical counterpart, and researchers have looked to it as a route to a different kind of network analysis. Computing such a walk on a real biological network has been another matter. Biological graphs are heterogeneous, with node degrees that vary from one vertex to the next, and running a quantum walk over that kind of irregular structure on today's noisy, pre-fault-tolerant hardware has been close to out of reach. A paper published online in npj Quantum Information on 24 July 2026, currently available as an accepted but not yet copyedited Article in Press, reports an experiment that pushes past this barrier. Working on IBM Heron superconducting processors with 156 qubits, researchers at Algorithmiq and IBM Quantum used up to 40 qubits to drive a discrete-time quantum walk through seven steps on a graph of 17 nodes and 20 edges. The authors describe it as the largest DTQW implementation on complex graphs on superconducting hardware to date. ■ Circuit Depth as the Bottleneck, and a Symmetry-Sector Way Around It When qubits were scarce, the natural choice was dense encoding, which compresses N walker positions into log₂N qubits plus a coin qubit. The saving comes at a price. Dense encoding leans on multi-controlled gates whose cost climbs steeply, and circuit depth climbs with it. The paper puts a number on this: with the state-of-the-art design of Sato and Saito, a single walk step on an 8-node, 8-edge graph decomposes into 1,218 entangling layers under idealized all-to-all connectivity, and 2,882 once the heavy-hex connectivity of IBM's processors is imposed. At that depth, decoherence dismantles the computation before it can finish. The researchers took the opposite approach. Symmetry-sector encoding: they allocated twice as many qubits as the graph has edges, 2|E| in all, and confined the state to the single-excitation subspace, in which exactly one qubit sits in the excited state |1>. Among 40 qubits, the single qubit that is switched on encodes both where the walker is and which way it is about to hop. Since qubits tend to decay from |1> toward |0>, states of higher Hamming weight are less stable over time, which is part of the authors' reasoning for choosing weight 1. Postselection as noise mitigation: any measurement that returns two or more excitations, or none at all, has violated the single-excitation symmetry and is discarded as a detected error. A further optimization rotates the computational basis into domain-wall states before the coin operator is applied and rotates it back afterwards, which approximately halves both the number of two-qubit native entangling gates and the transpiled depth of that block. The larger share of the depth reduction, however, comes from the fact that the coin and shift operators act in parallel across the qubit register, so their depth does not grow with the number of nodes or edges but with the maximum node degree. On the same 8-node benchmark, one step of the new framework needs 11 entangling layers under all-to-all connectivity and 28 under heavy-hex, roughly a hundredfold reduction against the reference design. ■ Seven Steps on 40 Qubits, and the Hellinger Fidelity That Held The experiments used three subgraphs extracted from BioPlex 3.0, a proteome-scale map of the human interactome: 11 nodes and 12 edges on 24 qubits, 15 nodes and 18 edges on 36 qubits, and 17 nodes and 20 edges on 40 qubits. The 24- and 40-qubit circuits ran on ibm_kingston, a Heron R2 device, and the 36-qubit circuit on ibm_pittsburgh, a Heron R3 device. Without postselection, the measured distributions matched theory poorly from the outset. At the first step, Hellinger fidelity stood at 0.79, 0.61 and 0.57 for the three graphs, which the authors read as evidence that the encoding alone cannot preserve coherence. With postselection applied, the picture changed. Fidelity stayed above 0.95, 0.90 and 0.87 respectively across all seven steps, including for the largest circuit, which reached 287 entangling layers on 40 qubits by step 7. Because a noisy circuit gradually drifts toward a featureless baseline distribution, a high Hellinger fidelity can flatter a result. The authors therefore also report a baseline-corrected fidelity, measured against the stationary distribution in which probability is spread evenly over directed-edge states and so falls on each node in proportion to its degree. That corrected figure remained at or above 0.71, 0.46 and 0.54 for the three graphs, which the authors take as an indication that the postselected results carry genuine signal rather than noise-driven flattening. ■ A Proof of Principle in Asthma Gene Prioritization The team then applied the measured walk dynamics to a disease-gene discovery task. HLA-DQA1, node 7 in the 11-node graph and one of the most strongly asthma-associated genes by genome-wide association study p-value, was chosen as the starting point for the walker, and the 24-qubit experiment was extended to nine steps. At each step the quantum probability at each node was compared with the corresponding classical random-walk probability, and the difference, normalized by the collision probability of the quantum distribution, gave a quantum interference index. Each node's score was its maximum index over time. HLA-C, PON2 and HLA-G took the top three places, all of them close to the seed and visited early in the walk. The result that drew attention was FLVCR1, described in the paper as the choline and heme transporter 1, which came fourth despite having no direct edge to the seed node or its neighbours and being ranked seventh by PageRank and ninth by DIAMOnD. The authors attribute its prioritization to amplitude interference rather than simple topological closeness, and note that FLVCR1 meets the GWAS significance threshold and has been associated with asthma across age groups, having been reported as a risk factor for childhood-onset disease. The partial overlap with the classical rankings, they argue, shows consistency with established methods, while the differences point to information a quantum walk might supply that classical approaches miss. ■ Significance and Limits Running a large quantum walk on the irregular, heterogeneous graphs characteristic of biological data, rather than on the regular lattices and cycle graphs used in earlier demonstrations, is the central achievement here, and it was done on real superconducting hardware rather than in simulation. The authors are explicit about the boundaries of the claim. The asthma case study runs on an 11-node subgraph chosen to fit current hardware limits, which restricts direct real-world applicability and leaves the work at the proof-of-concept stage. All three test graphs share a maximum node degree of 3, and it is that maximum degree, rather than graph size, that governs how the circuit depth scales. The cost of postselection also grows sharply: the fraction of retained bitstrings decays exponentially with depth, and in the 40-qubit run only about 0.2 per cent survived at step 7, roughly 17,000 out of nearly nine million shots. Some errors escape the symmetry check altogether, including phase flips and paired bit flips that leave the excitation count unchanged; the authors estimate the rate of such undetectable gate errors at around 3 × 10⁻⁴. They add that a walk run without postselection would need gate errors of order 10⁻⁴ to reach the same success probability they obtained with it, against the roughly 10⁻³ two-qubit gate errors available today, and suggest that deeper circuits will call for more advanced mitigation, such as tensor-network error mitigation adapted to work alongside postselection. Set against hardware roadmaps that point toward physical qubit counts in the millions, the authors make the case that trading circuit depth for qubits is a more tractable path forward than pushing gate fidelities alone, and one that should let the same framework reach larger and denser biological networks as the hardware improves. #QuantumWalk #DiscreteTimeQuantumWalk #QuantumComputing #ProteinInteractionNetwork #PPINetwork #DiseaseGenePrioritization #NetworkMedicine #IBMQuantum #ErrorMitigation #Postselection #Asthma #npjQuantumInformation #OpenAccess #QuantumBiologySociety Source: https://www.nature.com/articles/s41534-026-01332-w Circuit design code: https://doi.org/10.6084/m9.figshare.32218227

•Sep 8, 2026•0 citations

Protocol of a quantum walk in circuit QED

Jiaqi Zhou, Ling Cai, Qi-Ping Su +1 more

Implementation of a discrete-time quantum walk (DTQW) with superconducting qubits is difficult since on-chip superconducting qubits cannot hop between lattice sites. We propose an efficient protocol for the implementation of DTQW in circuit quantum electrodynamics (QED), in which only $N+1$ qutrits, $N$ cavities, and other assistant devices are needed for an $N$-step DTQW. The operation of each DTQW step is very quick because only resonant processes are adopted. The numerical simulations show that high-similarity DTQW with a number of steps up to 20 is feasible with present-day circuit QED techniques. This protocol can help to study properties and applications of many-step DTQW in experiments, and can be extended to implement multidimensional DTQW in circuit QED or other quantum systems.

arXiv:1902.10681•Physical Review A•Jul 25, 2019•15 citations

Efficient implementation of quantum walk-based algorithms into the quantum gate model of computation

Allan Wing Bocanegra

Discrete-time quantum walks provide a universal model of computation, meaning that any computation done by a general purpose quantum computer can also be done by discrete-time quantum walks. In the last decades great progress has been done in this field, developing quantum walk-based algorithms that can outperform classical ones. However, current quantum computers work based on the quantum circuit model of computation, and the mapping from one model to the other is an open problem, thus as an attempt to address this problem, we in this work develop basic theory, experiments and simulations on quantum walks presented in the following way: In the first part of this work we provide a matrix analysis of the evolution operator of Unitary Coined Discrete-Time Quantum Walks (UCDTQW), which leads to the fact that any quantum circuit applied on a bipartite system can be considered as the shift operator of a UCDTQW, and vice versa. Furthermore, we show that the fact that the statevector associated to a quantum walker in a UCDTQW is a bipartite system, inherits the evolution operator the property to be a block matrix, where each block is a Kraus operator. We show that associated to the shift operator of any UCDTQW, there exists a directed multigraph on which the walker moves, thus mimicking the functionality of the transition matrix in a random walk. We also extend the definition of the coin operator in a UCDTQW to a superposition of coins that act on different vertices of the graph on which the UCDTQW takes place, and provide a description of how this can be implemented in circuit form. In the second part of this work, we study the mapping of evolution operators to the quantum circuit model, based on a special case when the shift operator has a block diagonal matrix representation. In this case we propose a mapping process that is straightforward, and apply this method to obtain quantum circuits that generate UCDTQW on the most common topologies found in the literature: the straight line, the cyclic graph, the hypercube and the complete graph. In view that the mapping is not unique, we provide different models for the some topologies, along with techniques to synthesize them. The obtained circuits were implemented on IBM’s quantum computers through the Quantum Composer platform, obtaining mixed results for the different models, but being the circuit associated to the complete graph the one with best performance. Finally, in the third part of this work, we use the theoretical framework proposed in the first two parts to analyze and modify a quantum walk-based search algorithm which proposed over 20 years ago, and then execute it for the first time on a general-purpose quantum computer provided by IBM.

•Jan 1, 2023•0 citations
Quantum walk serves as a versatile tool for universal quantum computing and algorithmic research. However, the implementation of discrete-time quantum walks (DTQWs) with superconducting circuits is still constrained by some limitations such as operation precision, circuit depth and connectivity. With improved hardware efficiency by using superconducting qutrits (three-level systems), we experimentally demonstrate a scalable DTQW in a superconducting circuit, observing the ballistic spreading of quantum walk in a qutrit chain. The usage of qutrits in our implementation allows hardware efficiently encoding of the walker position and the coin degree of freedom. By exploiting the flexibility and intrinsic symmetries of qutrit-based DTQWs, we successfully prepare two topological phases in the chain. For the first time, particle-hole-symmetry-protected edge states, bounded at the interface between these two topological phases, are observed in the superconducting platform. Measured parameter dependencies further validate the properties of edge states. The scalability and gate-control compatibility of the demonstrated DTQWs enable a versatile tool for superconducting quantum computing and quantum simulation.
Discrete-time quantum walks (DTQWs) provide a convenient platform for a realization of many topological phases in noninteracting systems. They often offer more possibilities than systems with a static Hamiltonian. Nevertheless, researchers are still looking for DTQW symmetries protecting topological phases and for definitions of appropriate topological invariants. Although the majority of DTQW studies on this topic focus on the so-called split-step quantum walk, two distinct topological phases can be observed in more basic models. Here we infer topological properties of the basic DTQWs directly from the mapping of the Brillouin zone to the Bloch Hamiltonian. We show that for translation-symmetric systems they can be characterized by a homotopy relative to special points. We also propose a topological invariant corresponding to this concept. This invariant indicates the number of edge states at the interface between two distinct phases.
Quantum walks have wide applications in quantum information, such as universal quantum computation, so it is important to explore properties of quantum walks thoroughly. We propose a novel method to implement discrete-time quantum walks (DTQWs) using only a single qubit, in which both coin and walker are encoded in the two-dimensional state space of a single qubit, operations are realized using single-qubit gates only, and high-dimensional final states of DTQWs can be obtained naturally. With this "one-qubit" approach, DTQW experiments can be realized much more easily, compared with previous methods, in most quantum systems and all properties based on quantum states of DTQWs (such as quantum correlation and coherence) can be investigated. By this approach, we experimentally implement one-particle and two-particle DTQWs with seven steps using single photons. Furthermore, we systematically investigate quantum correlations and coherence (based on the full state of the coin and walker) of the DTQW systems with different initial states of the coin, which have not been obtained and studied in DTQW experiments. As an application, we also study the assisted distillation of quantum coherence using the full state of the two-particle DTQW from the experiment. The maximal increase in distillable coherence for high-dimensional mixed states is investigated for the first time by obtaining its upper and lower bounds. Our work opens a new door to implement DTQW experiments and to better explore properties of quantum walks.
Discrete-time quantum walk (DTQW) represents a convenient mathematical framework for describing the motion of a particle on a discrete set of positions when this motion is conditioned by the values of certain internal degrees of freedom, which are usually referred to as the coin of the particle. As such, and owing to the inherent dependence of the position distribution on the coin degrees of freedom, DTQWs naturally emerge as promising candidates for quantum metrology. In this paper, we explore the use of DTQWs as quantum probes in scenarios where the parameter of interest is encoded in the internal degree of freedom of the walker and investigate the role of the topology of the walker's space on the attainable precision. In particular, we start considering the encoding of the parameter by rotations for a walker on the line and evaluate the quantum Fisher information (QFI) and the position Fisher information (FI), explicitly determining the optimal initial state in position space that maximizes the QFI across all encoding schemes. This allows us to understand the role of interference in the position space and to introduce an optimal topology, which maximizes the QFI of the coin parameter and makes the position FI equal to the QFI.
A joint team from Algorithmiq and IBM Quantum has run a discrete-time quantum walk (DTQW) on complex networks drawn from protein-protein interaction (PPI) data, using 40 qubits of real quantum hardware. Rather than accept the extreme circuit depth demanded by conventional dense encodings, the researchers traded depth for qubit count, pairing a symmetry-sector encoding with postselection. On a benchmark graph this cut the depth of a single walk step by roughly two orders of magnitude. Applied to an asthma-associated gene network, the walk lifted FLVCR1, a gene placed well down the list by classical benchmark methods, to fourth position. The authors attribute the shift to quantum interference and present the case as a proof of principle for network medicine. [Quantum Biology Society] In network medicine, where disease mechanisms are read off the interaction networks that link proteins and genes, the classical random walk has long been a workhorse. A walker hops between nodes at random, and the resulting visit frequencies serve as a measure of importance. Adding the quantum principles of superposition and interference produces a quantum walk, whose probability spreads through a graph in a way that has no classical counterpart, and researchers have looked to it as a route to a different kind of network analysis. Computing such a walk on a real biological network has been another matter. Biological graphs are heterogeneous, with node degrees that vary from one vertex to the next, and running a quantum walk over that kind of irregular structure on today's noisy, pre-fault-tolerant hardware has been close to out of reach. A paper published online in npj Quantum Information on 24 July 2026, currently available as an accepted but not yet copyedited Article in Press, reports an experiment that pushes past this barrier. Working on IBM Heron superconducting processors with 156 qubits, researchers at Algorithmiq and IBM Quantum used up to 40 qubits to drive a discrete-time quantum walk through seven steps on a graph of 17 nodes and 20 edges. The authors describe it as the largest DTQW implementation on complex graphs on superconducting hardware to date. ■ Circuit Depth as the Bottleneck, and a Symmetry-Sector Way Around It When qubits were scarce, the natural choice was dense encoding, which compresses N walker positions into log₂N qubits plus a coin qubit. The saving comes at a price. Dense encoding leans on multi-controlled gates whose cost climbs steeply, and circuit depth climbs with it. The paper puts a number on this: with the state-of-the-art design of Sato and Saito, a single walk step on an 8-node, 8-edge graph decomposes into 1,218 entangling layers under idealized all-to-all connectivity, and 2,882 once the heavy-hex connectivity of IBM's processors is imposed. At that depth, decoherence dismantles the computation before it can finish. The researchers took the opposite approach. Symmetry-sector encoding: they allocated twice as many qubits as the graph has edges, 2|E| in all, and confined the state to the single-excitation subspace, in which exactly one qubit sits in the excited state |1>. Among 40 qubits, the single qubit that is switched on encodes both where the walker is and which way it is about to hop. Since qubits tend to decay from |1> toward |0>, states of higher Hamming weight are less stable over time, which is part of the authors' reasoning for choosing weight 1. Postselection as noise mitigation: any measurement that returns two or more excitations, or none at all, has violated the single-excitation symmetry and is discarded as a detected error. A further optimization rotates the computational basis into domain-wall states before the coin operator is applied and rotates it back afterwards, which approximately halves both the number of two-qubit native entangling gates and the transpiled depth of that block. The larger share of the depth reduction, however, comes from the fact that the coin and shift operators act in parallel across the qubit register, so their depth does not grow with the number of nodes or edges but with the maximum node degree. On the same 8-node benchmark, one step of the new framework needs 11 entangling layers under all-to-all connectivity and 28 under heavy-hex, roughly a hundredfold reduction against the reference design. ■ Seven Steps on 40 Qubits, and the Hellinger Fidelity That Held The experiments used three subgraphs extracted from BioPlex 3.0, a proteome-scale map of the human interactome: 11 nodes and 12 edges on 24 qubits, 15 nodes and 18 edges on 36 qubits, and 17 nodes and 20 edges on 40 qubits. The 24- and 40-qubit circuits ran on ibm_kingston, a Heron R2 device, and the 36-qubit circuit on ibm_pittsburgh, a Heron R3 device. Without postselection, the measured distributions matched theory poorly from the outset. At the first step, Hellinger fidelity stood at 0.79, 0.61 and 0.57 for the three graphs, which the authors read as evidence that the encoding alone cannot preserve coherence. With postselection applied, the picture changed. Fidelity stayed above 0.95, 0.90 and 0.87 respectively across all seven steps, including for the largest circuit, which reached 287 entangling layers on 40 qubits by step 7. Because a noisy circuit gradually drifts toward a featureless baseline distribution, a high Hellinger fidelity can flatter a result. The authors therefore also report a baseline-corrected fidelity, measured against the stationary distribution in which probability is spread evenly over directed-edge states and so falls on each node in proportion to its degree. That corrected figure remained at or above 0.71, 0.46 and 0.54 for the three graphs, which the authors take as an indication that the postselected results carry genuine signal rather than noise-driven flattening. ■ A Proof of Principle in Asthma Gene Prioritization The team then applied the measured walk dynamics to a disease-gene discovery task. HLA-DQA1, node 7 in the 11-node graph and one of the most strongly asthma-associated genes by genome-wide association study p-value, was chosen as the starting point for the walker, and the 24-qubit experiment was extended to nine steps. At each step the quantum probability at each node was compared with the corresponding classical random-walk probability, and the difference, normalized by the collision probability of the quantum distribution, gave a quantum interference index. Each node's score was its maximum index over time. HLA-C, PON2 and HLA-G took the top three places, all of them close to the seed and visited early in the walk. The result that drew attention was FLVCR1, described in the paper as the choline and heme transporter 1, which came fourth despite having no direct edge to the seed node or its neighbours and being ranked seventh by PageRank and ninth by DIAMOnD. The authors attribute its prioritization to amplitude interference rather than simple topological closeness, and note that FLVCR1 meets the GWAS significance threshold and has been associated with asthma across age groups, having been reported as a risk factor for childhood-onset disease. The partial overlap with the classical rankings, they argue, shows consistency with established methods, while the differences point to information a quantum walk might supply that classical approaches miss. ■ Significance and Limits Running a large quantum walk on the irregular, heterogeneous graphs characteristic of biological data, rather than on the regular lattices and cycle graphs used in earlier demonstrations, is the central achievement here, and it was done on real superconducting hardware rather than in simulation. The authors are explicit about the boundaries of the claim. The asthma case study runs on an 11-node subgraph chosen to fit current hardware limits, which restricts direct real-world applicability and leaves the work at the proof-of-concept stage. All three test graphs share a maximum node degree of 3, and it is that maximum degree, rather than graph size, that governs how the circuit depth scales. The cost of postselection also grows sharply: the fraction of retained bitstrings decays exponentially with depth, and in the 40-qubit run only about 0.2 per cent survived at step 7, roughly 17,000 out of nearly nine million shots. Some errors escape the symmetry check altogether, including phase flips and paired bit flips that leave the excitation count unchanged; the authors estimate the rate of such undetectable gate errors at around 3 × 10⁻⁴. They add that a walk run without postselection would need gate errors of order 10⁻⁴ to reach the same success probability they obtained with it, against the roughly 10⁻³ two-qubit gate errors available today, and suggest that deeper circuits will call for more advanced mitigation, such as tensor-network error mitigation adapted to work alongside postselection. Set against hardware roadmaps that point toward physical qubit counts in the millions, the authors make the case that trading circuit depth for qubits is a more tractable path forward than pushing gate fidelities alone, and one that should let the same framework reach larger and denser biological networks as the hardware improves. #QuantumWalk #DiscreteTimeQuantumWalk #QuantumComputing #ProteinInteractionNetwork #PPINetwork #DiseaseGenePrioritization #NetworkMedicine #IBMQuantum #ErrorMitigation #Postselection #Asthma #npjQuantumInformation #OpenAccess #QuantumBiologySociety Source: https://www.nature.com/articles/s41534-026-01332-w Circuit design code: https://doi.org/10.6084/m9.figshare.32218227
Implementation of a discrete-time quantum walk (DTQW) with superconducting qubits is difficult since on-chip superconducting qubits cannot hop between lattice sites. We propose an efficient protocol for the implementation of DTQW in circuit quantum electrodynamics (QED), in which only N+1N+1N+1 qutrits, NNN cavities, and other assistant devices are needed for an NNN-step DTQW. The operation of each DTQW step is very quick because only resonant processes are adopted. The numerical simulations show that high-similarity DTQW with a number of steps up to 20 is feasible with present-day circuit QED techniques. This protocol can help to study properties and applications of many-step DTQW in experiments, and can be extended to implement multidimensional DTQW in circuit QED or other quantum systems.
Discrete-time quantum walks provide a universal model of computation, meaning that any computation done by a general purpose quantum computer can also be done by discrete-time quantum walks. In the last decades great progress has been done in this field, developing quantum walk-based algorithms that can outperform classical ones. However, current quantum computers work based on the quantum circuit model of computation, and the mapping from one model to the other is an open problem, thus as an attempt to address this problem, we in this work develop basic theory, experiments and simulations on quantum walks presented in the following way: In the first part of this work we provide a matrix analysis of the evolution operator of Unitary Coined Discrete-Time Quantum Walks (UCDTQW), which leads to the fact that any quantum circuit applied on a bipartite system can be considered as the shift operator of a UCDTQW, and vice versa. Furthermore, we show that the fact that the statevector associated to a quantum walker in a UCDTQW is a bipartite system, inherits the evolution operator the property to be a block matrix, where each block is a Kraus operator. We show that associated to the shift operator of any UCDTQW, there exists a directed multigraph on which the walker moves, thus mimicking the functionality of the transition matrix in a random walk. We also extend the definition of the coin operator in a UCDTQW to a superposition of coins that act on different vertices of the graph on which the UCDTQW takes place, and provide a description of how this can be implemented in circuit form. In the second part of this work, we study the mapping of evolution operators to the quantum circuit model, based on a special case when the shift operator has a block diagonal matrix representation. In this case we propose a mapping process that is straightforward, and apply this method to obtain quantum circuits that generate UCDTQW on the most common topologies found in the literature: the straight line, the cyclic graph, the hypercube and the complete graph. In view that the mapping is not unique, we provide different models for the some topologies, along with techniques to synthesize them. The obtained circuits were implemented on IBM’s quantum computers through the Quantum Composer platform, obtaining mixed results for the different models, but being the circuit associated to the complete graph the one with best performance. Finally, in the third part of this work, we use the theoretical framework proposed in the first two parts to analyze and modify a quantum walk-based search algorithm which proposed over 20 years ago, and then execute it for the first time on a general-purpose quantum computer provided by IBM.