We consider the Szegedy walk on graphs adding infinite length tails to a finite internal graph. We assume that on these tails, the dynamics is given by the free quantum walk. We set the $\ell^\infty$-category initial state so that the internal graph receives time independent input from the tails, say $\boldsymbolα_{in}$, at every time step. We show that the response of the Szegedy walk to the input, which is the output, say $\boldsymbolβ_{out}$, from the internal graph to the tails in the long time limit, is drastically changed depending on the reversibility of the underlying random walk. If the underlying random walk is reversible, we have $\boldsymbolβ_{out}=\mathrm{Sz}(\boldsymbol{m}_{δE})\boldsymbolα_{in}$, where the unitary matrix $\mathrm{Sz}(\boldsymbol{m}_{δE})$ is the reflection matrix to the unit vector $\boldsymbol{m}_{δE}$ which is determined by the boundary of the internal graph $δE$. Then the global dynamics so that the internal graph is regarded as one vertex recovers the local dynamics of the Szegedy walk in the long time limit. Moreover if the underlying random walk of the Szegedy walk is reversible, then we obtain that the stationary state is expressed by a linear combination of the reversible measure and the electric current on the electric circuit determined by the internal graph and the random walk's reversible measure. On the other hand, if the underlying random walk is not reversible, then the unitary matrix is just a phase flip; that is, $\boldsymbolβ_{out}=-\boldsymbolα_{in}$, and the stationary state is similar to the current flow but satisfies a different type of the Kirchhoff laws.
We show how a quantum walk can be implemented for the first time in a quantum quincunx created via superconducting circuit quantum electrodynamics (QED), and how interpolation from quantum to random walk is implemented by controllable decoherence using a two resonator system. Direct control over the coin qubit is difficult to achieve in either cavity or circuit QED, but we show that a Hadamard coin flip can be effected via direct driving of the cavity, with the result that the walker jumps between circles in phase space but still exhibits quantum walk behavior over 15 steps.
Quantum Random Walks, which have drawn much attention over the past few decades for their distinctly non-classical behavior, is a promising subfield within Quantum Computing. Theoretical framework and applications for these walks have seen many great mathematical advances, with experimental demonstrations now catching up. In this study, we examine the viability of implementing Coin Quantum Random Walks using a Quantum Adder based Shift Operator, with quantum circuit designs specifically for superconducting qubits. We focus on the strengths and weaknesses of these walks, particularly circuit de…
We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle. We find that a direct implementation of this oracle requires costly arithmetic operations and thus reformulate the quantum walk in a way that circumvents the implementation of that specific oracle and which closely follows the classical Metropolis-Hastings walk. We also present heuristic quantum algorithms that use the quantum walk in the context of discrete optimization problems and numerically study their performances. Our num…
Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum …
We investigate the counterparts of random walk in universal quantum computing and their implementation using standard quantum circuits. Quantum walk have been recently well investigated for traversing graphs with certain oracles. We focus our study on traversing a 1-D graph, namely a circle, and show how to implement discrete circular quantum walk in quantum circuits built with universal CNOT and single quit gates. We review elementary quantum gates and circuit decomposition and propose a a generalized version of the all CNOT based quantum discrete circular walk. We simulated these circuits on…
Quantum walks are a promising framework for developing quantum algorithms and quantum simulations. They represent an important test case for the application of quantum computers. Here we present different forms of discrete-time quantum walks (DTQWs) and show their equivalence for physical realizations. Using an appropriate digital mapping of the position space on which a walker evolves to the multiqubit states of a quantum processor, we present different configurations of quantum circuits for the implementation of DTQWs in one-dimensional position space. We provide example circuits for a five-…
In this paper, we investigate the simulation of continuous-time quantum walks on specific classes of graphs, for which it is possible to fast-forward the time-evolution operator to achieve constant-time simulation complexity and to perform the simulation exactly, while maintaining $\mbox{poly}(\mbox{log}(n))$ efficiency. In particular, we discuss two classes of composite graphs, commuting graphs and Cartesian product of graphs, that contain classes of graphs which can be simulated in this fashion. This allows us to identify new families of graphs that we can efficiently simulate in a quantum c…
We extend the non-Hermitian one-dimensional quantum walk model [Phys. Rev. Lett. 102, 065703 (2009)] by taking the dephasing effect into account. We prove that the feature of topological transition does not change even when dephasing between the sites within units is present. The potential experimental observation of our theoretical results in the circuit QED system consisting of superconducting qubit coupled to a superconducting resonator mode is discussed and numerically simulated. The results clearly show a topological transition in quantum walk and display the robustness of such a system t…
A major advantage in using Szegedy's formalism over discrete-time and continuous-time quantum walks lies in its ability to define a unitary quantum walk on directed and weighted graphs. In this paper, we present a general scheme to construct efficient quantum circuits for Szegedy quantum walks that correspond to classical Markov chains possessing transformational symmetry in the columns of the transition matrix. In particular, the transformational symmetry criteria do not necessarily depend on the sparsity of the transition matrix, so this scheme can be applied to non-sparse Markov chains. Two…
Implementation of 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 and $N$ assistant cavities 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 the number of step up to $20$ is feasible with present-day circuit QED technique. This pr…
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here we present one dimensional three-state quantum walk(lazy quantum walk) and show its equivalence for circuit realization in ternary quantum logic for the first of its kind. Using an appropriate logical mapping of the position space on which a walker evolves onto the multi-qutrit states, we present efficient quantum circuits considering the nearest neighbour position space for the implementation of lazy quantum walks in one-dimensional position space in ternary quantum system. We also address sca…
We examine an unexplored quantum phenomenon we call oscillatory localization, where a discrete-time quantum walk with Grover's diffusion coin jumps back and forth between two vertices. We then connect it to the power dissipation of a related electric network. Namely, we show that there are only two kinds of oscillating states, called uniform states and flip states, and that the projection of an arbitrary state onto a flip state is bounded by the power dissipation of an electric circuit. By applying this framework to states along a single edge of a graph, we show that low effective resistance i…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms. In this paper, we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits…
We study electric quantum walks in two dimensions considering Grover, Alternate, Hadamard, and DFT quantum walks. In the Grover walk the behaviour under an electric field is easy to summarize: when the field direction coincides with the x or y axes, it produces a transient trapping of the probability distribution along the direction of the field, while when it is directed along the diagonals, a perfect 2D trapping is frustrated. The analysis of the alternate walk helps to understand the behaviour of the Grover walk as both walks are partially equivalent; in particular, it helps to understand t…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently integrable probability distributions. This method is intended for use in quantum walk algorithms with polynomial speedups, whose complexity is usually measured in terms of how many times we have to apply a step of a quantum walk, compared to the number of necessary classical Markov chain steps. We consider a finer notion of complexity including the number of el…
We present several families of graphs that allow both efficient quantum walk implementations and efficient quantum walk based search algorithms. For these graphs, we construct quantum circuits that explicitly implement the full quantum walk search algorithm, without reference to a `black box' oracle. These circuits provide a practically implementable method to explore quantum walk based search algorithms with the aim of eventual real-world applications. We also provide a numerical analysis of a quantum walk based search along a twisted toroid family of graphs, which requires O($\sqrt{n}$ log($…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective resistance. This generalizes the result by Szegedy that is only applicable if the initial distribution is stationary. We describe a time-efficient quantum algorithm for 3-distinctness based on these ideas.
We report on the experimental realization of electric quantum walks, which mimic the effect of an electric field on a charged particle in a lattice. Starting from a textbook implementation of discrete-time quantum walks, we introduce an extra operation in each step to implement the effect of the field. The recorded dynamics of such a quantum particle exhibits features closely related to Bloch oscillations and interband tunneling. In particular, we explore the regime of strong fields, demonstrating contrasting quantum behaviors: quantum resonances vs. dynamical localization depending on whether…
The conductance steps in a constricted two-dimensional electron gas and the minimum conductivity in graphene are related to a new uncertainty relation between electric charge and conductance in a quantized electric circuit that mimics the electric transport in mesoscopic systems. This uncertainty relation makes specific use of the discreteness of electric charge. Quantum electric circuits analogous to both constricted two-dimensional electron gas and graphene are introduced. In the latter case a new insight into the origin of minimum conductivity is obtained.
In this paper, we introduce a quantum walk whose local scattering at each vertex is denoted by a unitary circulant matrix; namely the circulant quantum walk. We also introduce another quantum walk induced by the circulant quantum walk; namely the optical quantum walk, whose underlying graph is a $2$-regular directed graph and obtained by blowing up the original graph in some way. We propose a design of an optical circuit which implements the stationary state of the optical quantum walk. We show that if the induced optical quantum walk does not have $+1$ eigenvalue, then the stationary state of…
Mesoscopic integrated circuits achieving high-fidelity control of elementary quantum systems require new methodology for benchmarking. We offer circuit-level statistical description of rare-error accumulation in terms of a universal random-walk model for on-demand electron transfer. For a high-fidelity single-electron circuit, realized in the experiment as a chain of quantum dots in a GaAs/AlGaAs heterostructure, the error of the transfer operation is probed by charge counting. Error rates for extra ($P_+$) or missing ($P_-$) electrons of the electron shuttle are measured to $P_{-}=(6.92 \pm 0…
Based on the three-level quantum system, when it is in resonance, according to any two lattice points closest to Hamiltonian coupling, electrons transition from high energy level to low energy level and release photons; Or absorb photons and transition from low energy level to high energy level, thus obtaining the physical process of quantum walking along a straight line under the condition of equal probability. Then, the optical radiation in the quantum walk is mapped into a Gaussian pulse of the electric field, and the Maxwell's equation is solved by the three dimensional finite-difference t…
The correct laws of thermodynamics, either classical or quantum without probabilities of statistical quantum mechanics are valid for all systems, large or small, including systems of one spin or one particle only. So no violations can occur in nanoscale electric circuits.
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a single- and multi-excitation coding, and for more general mappings. Specific examples of spin chains, as well as static and dynamic systems of qubits, are mapped to quantum walks, and walks on hyperlattices and hypercubes are mapped to various gate systems.…
We present a highly efficient quantum circuit for performing continuous time quantum walks (CTQWs) over an exponentially large set of combinatorial objects, provided that the objects can be indexed efficiently. CTQWs form the core mixing operation of a generalised version of the Quantum Approximate Optimisation Algorithm, which works by `steering' the quantum amplitude into high-quality solutions. The efficient quantum circuit holds the promise of finding high-quality solutions to certain classes of NP-hard combinatorial problems such as the Travelling Salesman Problem, maximum set splitting, …
Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As physical implementations of quantum computers improve, the need is growing for tools which can effectively synthesize components of the circuits and algorithms they will run. Existing algorithms for exact, multi-qubit circuit synthesis scale exponentially in the number of qubits and circuit depth, leaving synthesis intractable for circuits on more than a handfu…
The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now is possible to implement short-depth quantum circuits with dozens of qubits and to obtain results with significant fidelity. Quantum walks are good candidates to be implemented on the available quantum computers. In this work, we implement discrete-time quantum walks with one and two interacting walkers on cycles, two-dimensional lattices, and complete graphs on IBM quantum computers. We are able to obtain meaningful results using the cy…
Review of the probability representation of quantum mechanics and the symplectic tomography approach are presented. The examples of Gaussian states of nanoelectric circuit, Josephson junction, and two interacting high-quality resonant circuits are considered. The Shannon entropy, quantum information, fidelity, and purity of quantum states in the tomographic representation of quantum mechanics are studied.
Quantum-dot cellular automata (QCA) may provide low-power, general-purpose computing in the post-CMOS era. A molecular implementation of QCA features nanometer-scale devices and may support THz switching speeds at room-temperature. Here, we explore the ability of molecular QCA circuits to tolerate unwanted applied electric fields, which may come from a variety of sources. One likely source of strong unwanted electric fields may be electrodes recently proposed for the write-in of classical bits to molecular QCA input circuits. Previous models have shown that the input circuits are sensitive to …
The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular au…
In recent years, quantum walks have been widely researched and have shown exciting properties. One such is a quadratic speed-up in hitting time compared to its classical counterpart. In this paper, we design a quantum circuit for the MNRS algorithm, which finds a marked node in a graph with a quantum walk, and use it to find a hitting time for the marked nodes in the walk. We do this by implementing the circuit on IBM quantum simulators and show that the execution on a noise-free simulator results in hitting times that agree with the theoretical expectations. We also run the algorithm on a moc…
IRT Saint Exupery（圣埃克苏佩里技术研究所）；Université Paul Sabatier（保罗·萨巴捷大学）；IRIT（图卢兹信息学研究所）
Quantum walks on binary trees are used in many quantum algorithms to achieve important speedup over classical algorithms. The formulation of this kind of algorithms as quantum circuit presents the advantage of being easily readable, executable on circuit based quantum computers and simulators and optimal on the usage of resources. We propose a strategy to compose quantum circuit that performs quantum walk on binary trees following universal gate model quantum computation principles. We give a particular attention to NAND formula evaluation algorithm as it could have many applications in game t…
The direct measurement of topological invariants in both engineered and naturally occurring quantum materials is a key step in classifying quantum phases of matter. Here we motivate a toolbox based on time-dependent quantum walks as a method to digitally simulate single-particle topological band structures. Using a superconducting qubit dispersively coupled to a microwave cavity, we implement two classes of split-step quantum walks and directly measure the topological invariant (winding number) associated with each. The measurement relies upon interference between two components of a cavity Sc…
The circuit-to-Hamiltonian construction has found widespread use within the field of Hamiltonian complexity, particularly for proving QMA-hardness results. In this work we examine the ground state energies of the Hamiltonian for standard clock constructions and those which require dynamic initialisation. We put exponentially tight bounds on these ground state energies and also determine improved scaling bounds in the case where there is a constant probability of the computation being rejected. Furthermore, we prove a collection of results concerning the low-energy subspace of quantum walks on …
The non-Hermitian systems with the non-Hermitian skin effect (NHSE) are very sensitive to the imposed boundary conditions and lattice size, which leads to size-dependent non-Hermitian skin effects. Here, we report the experimental observation of NHSE with different boundary conditions and different lattice size in a unidirectional hopping model based on a circuit platform. The circuit admittance spectra and corresponding eigenstates are very sensitive to the presence of the boundary. Meanwhile, our experimental results show how the lattice size and boundary terms together affect the strength o…
We provide a theoretical framework for encoding arbitrary logical states of a quantum bit (qubit) into a continuous-variable quantum mode through quantum walks. Starting with a squeezed-vacuum state of the quantum mode, we show that quantum walks of the state in phase space can generate output states that are variants of codeword states originally put forward by Gottesman, Kitaev, and Preskill (GKP) [Phys. Rev. A {\bf 64}, 012310 (2001)]. In particular, with a coin-toss transformation that projects the quantum coin onto the diagonal coin-state, we show that the resulting {\em dissipative} quan…
