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:1710.03615 · Quantum Science and Technology

Physical realization of topological quantum walks on IBM-Q and beyond

Radhakrishnan Balu, Daniel Castillo, George Siopsis

Published Mar 20, 2018• 28 citations
arXivHTMLPDF

Abstract

Abstract We discuss an efficient physical realization of topological quantum walks on a one-dimensional finite lattice with periodic boundary conditions (circle). The N -point lattice is realized with log 2 N qubits, and the quantum circuit utilizes a number of quantum gates that are polynomial in the number of qubits. In a certain scaling limit, we show that a large number of steps are implemented with a number of quantum gates which are independent of the number of steps. We ran the quantum algorithm on the IBM-Q five-qubit quantum computer, thus experimentally demonstrating topological features, such as boundary bound states, on a one-dimensional lattice with N = 4 points.

DOI
10.1088/2058-9565/aab823

Related papers

Realization of higher-order topological lattices on a quantum computer

Jin Ming Koh, Tommy Tai, Ching Hua Lee

Abstract Programmable quantum simulators may one day outperform classical computers at certain tasks. But at present, the range of viable applications with noisy intermediate-scale quantum (NISQ) devices remains limited by gate errors and the number of high-quality qubits. Here, we develop an approach that places digital NISQ hardware as a versatile platform for simulating multi-dimensional condensed matter systems. Our method encodes a high-dimensional lattice in terms of many-body interactions on a reduced-dimension model, thereby taking full advantage of the exponentially large Hilbert space of the host quantum system. With circuit optimization and error mitigation techniques, we measured on IBM superconducting quantum processors the topological state dynamics and protected mid-gap spectra of higher-order topological lattices, in up to four dimensions, with high accuracy. Our projected resource requirements scale favorably with system size and lattice dimensionality compared to classical computation, suggesting a possible route to useful quantum advantage in the longer term.

arXiv:2303.02179•Nature Communications•Jul 10, 2024•46 citations

Discrete-time quantum walk on circular graph: Simulations and effect of gate depth and errors

Iyed Ben Slimen, Amor Gueddana, Vasudevan Lakshminarayanan

We investigate the counterparts of random walks in universal quantum computing and their implementation using standard quantum circuits. Quantum walks have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1D graph, namely a circle, and show how to implement a discrete-time quantum walk in quantum circuits built with universal CNOT and single qubit gates. We review elementary quantum gates and circuit decomposition techniques and propose a generalized version of all CNOT-based circuits of the quantum walk. We simulated these circuits on five different qubits IBM-Q quantum devices. This quantum computer has nonperfect gates based on superconducting qubits, and, therefore, we analyzed the impact of the CNOT errors and CNOT-depth on the fidelity of the circuit.

arXiv:2005.02447•International Journal of Quantum Information•Mar 1, 2021•3 citations

Toward simulation of topological phenomena with one-, two-, and three-dimensional quantum walks

S. Panahiyan, S. Fritzsche

We study the simulation of the topological phases in three subsequent dimensions with quantum walks. We focus mainly on the completion of a table for the protocols of the quantum walk that could simulate different families of the topological phases in one, two, and three dimensions. We also highlight the possible boundary states that can be observed for each protocol in different dimensions and extract the conditions for their emergences. To further enrich the simulation of the topological phenomena, we include step-dependent coins in the evolution operators of the quantum walks. This leads to step dependence of the simulated topological phenomena and their properties which introduces dynamicity as a feature of simulated topological phases and boundary states. This dynamicity provides the step number of the quantum walk as a means to control and engineer the numbers of topological phases and boundary states, their numbers, types, and even occurrences.

arXiv:2005.08720•Physical Review A•Jan 5, 2021•13 citations

Efficient Implementation of Discrete-Time Quantum Walks on Quantum Computers

Luca Razzoli, Gabriele Cenedese, Maria Bondani +1 more

Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit implementation due to its discrete nature. Current implementations, however, are usually characterized by quantum circuits of large size and depth, which leads to a higher computational cost and severely limits the number of time steps that can be reliably implemented on current quantum computers. In this work, we propose an efficient and scalable quantum circuit implementing the DTQW on the 2n-cycle based on the diagonalization of the conditional shift operator. For t time steps of the DTQW, the proposed circuit requires only O(n2+nt) two-qubit gates compared to the O(n2t) of the current most efficient implementation based on quantum Fourier transforms. We test the proposed circuit on an IBM quantum device for a Hadamard DTQW on the 4-cycle and 8-cycle characterized by periodic dynamics and by recurrent generation of maximally entangled single-particle states. Experimental results are meaningful well beyond the regime of few time steps, paving the way for reliable implementation and use on quantum computers.

arXiv:2402.01854•Entropy•Apr 2, 2024•25 citations

Testing the Efficiency of Digital Simulation of Quantum Walks on IBM’s Q platform - towards quantum experimental algorithms

Luis Ángel Sedas

This thesis presents several quantum circuit implementations of discrete and continuous quantum walks in cycle graphs. Quantum walks have become an important tool for developing quantum algorithms, that is why this work is a contribution to the area of quantum computation, specially for scientist who want to test their developed algorithms, in a real quantum device as the IBM-Q Experience platform. We give a complete suite of quantum gates that are needed to simulate quantum walks and quantum walk-based algorithms. Since some of these quantum gates are not elementary, we show how to decompose them into fundamental quantum gates available at Qiskit, an open-source quantum computing software development framework created by IBM. This is an important contribution towards the development of a professional platform for simulating and testing quantum algorithms. We found that the decomposition of unitary gates, related to quantum walks, into elementary gates is not very well documented in the literature. We studied the efficiency of both, the number of qubits and logic gates needed for each circuit, and the correctness of the results of each experiment by comparing the theoretical expected output state with the output generated by quantum simulators. Implementations of both discrete and continuous quantum walks in quantum circuits rely heavily on controlled gates, that when decomposed into fundamental gates add a high number of quantum gates and depth. Experiments were performed on a real quantum device, but results showed that the quantum computer is not good enough when executing these quantum circuits, due to the depth of the circuits and the high amount of CNOT gates required. We tested different implementations and optimization methods for the simplification of the quantum circuits, were we find that resources grow linearly w.r.t the number of qubits, and the minimum amount of gates required for the discrete case in C8 was 144 quantum gates with a depth of 111, which is the reason of the error between the simulations and the implementations in the quantum device.

•Mar 14, 2020•0 citations

Scalable networks for discrete quantum random walks

Shingo Fujiwara, H. Osaki, I. M. Buluta +1 more

Recently, quantum random walks (QRWs) have been thoroughly studied in order to develop new quantum algorithms. In this paper we propose scalable quantum networks for discrete QRWs on circles, lines, and also in higher dimensions. In our method the information about the position of the walker is stored in a quantum register and the network consists of only one-qubit rotation and ${(\text{controlled})}^{n}\text{\ensuremath{-}}\mathrm{NOT}$ gates, therefore it is purely computational and independent of the physical implementation. As an example, we describe the experimental realization in an ion-trap system.

Physical Review A•Sep 23, 2005•15 citations
Abstract We discuss an efficient physical realization of topological quantum walks on a one-dimensional finite lattice with periodic boundary conditions (circle). The N -point lattice is realized with log 2 N qubits, and the quantum circuit utilizes a number of quantum gates that are polynomial in the number of qubits. In a certain scaling limit, we show that a large number of steps are implemented with a number of quantum gates which are independent of the number of steps. We ran the quantum algorithm on the IBM-Q five-qubit quantum computer, thus experimentally demonstrating topological features, such as boundary bound states, on a one-dimensional lattice with N = 4 points.
Abstract Programmable quantum simulators may one day outperform classical computers at certain tasks. But at present, the range of viable applications with noisy intermediate-scale quantum (NISQ) devices remains limited by gate errors and the number of high-quality qubits. Here, we develop an approach that places digital NISQ hardware as a versatile platform for simulating multi-dimensional condensed matter systems. Our method encodes a high-dimensional lattice in terms of many-body interactions on a reduced-dimension model, thereby taking full advantage of the exponentially large Hilbert space of the host quantum system. With circuit optimization and error mitigation techniques, we measured on IBM superconducting quantum processors the topological state dynamics and protected mid-gap spectra of higher-order topological lattices, in up to four dimensions, with high accuracy. Our projected resource requirements scale favorably with system size and lattice dimensionality compared to classical computation, suggesting a possible route to useful quantum advantage in the longer term.
We investigate the counterparts of random walks in universal quantum computing and their implementation using standard quantum circuits. Quantum walks have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1D graph, namely a circle, and show how to implement a discrete-time quantum walk in quantum circuits built with universal CNOT and single qubit gates. We review elementary quantum gates and circuit decomposition techniques and propose a generalized version of all CNOT-based circuits of the quantum walk. We simulated these circuits on five different qubits IBM-Q quantum devices. This quantum computer has nonperfect gates based on superconducting qubits, and, therefore, we analyzed the impact of the CNOT errors and CNOT-depth on the fidelity of the circuit.
We study the simulation of the topological phases in three subsequent dimensions with quantum walks. We focus mainly on the completion of a table for the protocols of the quantum walk that could simulate different families of the topological phases in one, two, and three dimensions. We also highlight the possible boundary states that can be observed for each protocol in different dimensions and extract the conditions for their emergences. To further enrich the simulation of the topological phenomena, we include step-dependent coins in the evolution operators of the quantum walks. This leads to step dependence of the simulated topological phenomena and their properties which introduces dynamicity as a feature of simulated topological phases and boundary states. This dynamicity provides the step number of the quantum walk as a means to control and engineer the numbers of topological phases and boundary states, their numbers, types, and even occurrences.
Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit implementation due to its discrete nature. Current implementations, however, are usually characterized by quantum circuits of large size and depth, which leads to a higher computational cost and severely limits the number of time steps that can be reliably implemented on current quantum computers. In this work, we propose an efficient and scalable quantum circuit implementing the DTQW on the 2n-cycle based on the diagonalization of the conditional shift operator. For t time steps of the DTQW, the proposed circuit requires only O(n2+nt) two-qubit gates compared to the O(n2t) of the current most efficient implementation based on quantum Fourier transforms. We test the proposed circuit on an IBM quantum device for a Hadamard DTQW on the 4-cycle and 8-cycle characterized by periodic dynamics and by recurrent generation of maximally entangled single-particle states. Experimental results are meaningful well beyond the regime of few time steps, paving the way for reliable implementation and use on quantum computers.
This thesis presents several quantum circuit implementations of discrete and continuous quantum walks in cycle graphs. Quantum walks have become an important tool for developing quantum algorithms, that is why this work is a contribution to the area of quantum computation, specially for scientist who want to test their developed algorithms, in a real quantum device as the IBM-Q Experience platform. We give a complete suite of quantum gates that are needed to simulate quantum walks and quantum walk-based algorithms. Since some of these quantum gates are not elementary, we show how to decompose them into fundamental quantum gates available at Qiskit, an open-source quantum computing software development framework created by IBM. This is an important contribution towards the development of a professional platform for simulating and testing quantum algorithms. We found that the decomposition of unitary gates, related to quantum walks, into elementary gates is not very well documented in the literature. We studied the efficiency of both, the number of qubits and logic gates needed for each circuit, and the correctness of the results of each experiment by comparing the theoretical expected output state with the output generated by quantum simulators. Implementations of both discrete and continuous quantum walks in quantum circuits rely heavily on controlled gates, that when decomposed into fundamental gates add a high number of quantum gates and depth. Experiments were performed on a real quantum device, but results showed that the quantum computer is not good enough when executing these quantum circuits, due to the depth of the circuits and the high amount of CNOT gates required. We tested different implementations and optimization methods for the simplification of the quantum circuits, were we find that resources grow linearly w.r.t the number of qubits, and the minimum amount of gates required for the discrete case in C8 was 144 quantum gates with a depth of 111, which is the reason of the error between the simulations and the implementations in the quantum device.
Recently, quantum random walks (QRWs) have been thoroughly studied in order to develop new quantum algorithms. In this paper we propose scalable quantum networks for discrete QRWs on circles, lines, and also in higher dimensions. In our method the information about the position of the walker is stored in a quantum register and the network consists of only one-qubit rotation and ${(\text{controlled})}^{n}\text{\ensuremath{-}}\mathrm{NOT}$ gates, therefore it is purely computational and independent of the physical implementation. As an example, we describe the experimental realization in an ion-trap system.