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 an IBM quantum supercomputer London IBM-Q with 5 qubits. This quantum computer has non perfect gates based on superconducting qubits, therefore we analyze the impact of errors on the fidelity of the Walker circuit.
The work proposes an extension of the quantum circuit formalism where qubits (wires) are circular instead of linear. The left-to-right interpretation of a quantum circuit is replaced by a circular representation which allows to select the starting point and the direction in which gates are executed. The representation supports all the circuits obtained after computing cyclic permutations of an initial quantum gate list. Two circuits, where one has a gate list which is a cyclic permutation of the other, will implement different functions. The main question appears in the context of scalable qua…
Open quantum walks (OQW) are formulated as quantum Markov chains on graphs. It is shown that OQWs are a very useful tool for the formulation of dissipative quantum computing algorithms and for dissipative quantum state preparation. In particular, single qubit gates and the CNOT-gate are implemented as OQWs on fully connected graphs. Also, dissipative quantum state preparation of arbitrary single qubit states and of all two-qubit Bell-states is demonstrated. Finally, the discrete time version of dissipative quantum computing is shown to be more efficient if formulated in the language of OQWs.
It is well-known that any quantum gate can be decomposed into the universal gate set {T, H, CNOT}, and recent results have shown that each of these gates can be implemented using a dynamic quantum walk, which is a continuous-time quantum walk on a sequence of graphs. This procedure for converting a quantum gate into a dynamic quantum walk, however, can result in long sequences of graphs. To alleviate this, in this paper, we develop a length-3 dynamic quantum walk that implements any single-qubit gate. Furthermore, we extend this result to give length-3 dynamic quantum walks that implement any …
It is well known that a parallel quantum computer is more powerful than a classical one. So far, there are some important works about the construction of universal quantum logic gates, the key elements in quantum computation. However, they are focused on operating on one degree of freedom (DOF) of quantum systems. Here, we investigate the possibility of achieving scalable hyper-parallel quantum computation based on two DOFs of photon systems. We construct a deterministic hyper-controlled-not (hyper-CNOT) gate operating on both the spatial-mode and the polarization DOFs of a two-photon system s…
Quantum networks are complex systems formed by the interaction among quantum processors through quantum channels. Analogous to classical computer networks, quantum networks allow for the distribution of quantum computation among quantum computers. In this work, we describe a quantum walk protocol to perform distributed quantum computing in a quantum network. The protocol uses a quantum walk as a quantum control signal to perform distributed quantum operations. We consider a generalization of the discrete-time coined quantum walk model that accounts for the interaction between a quantum walker …
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as having self-loops, so they all evolved by a phase under the quantum walk. In this paper, we permit isolated vertices to be loopless or looped, and loopless isolated vertices do not evolve at all under the quantum walk. Using this distinction, we construct simpler dynamic graphs that implement the Pauli gates and a set of universal quantum gates consisting of…
Usually, the hyperparallel quantum computation can speed up quantum computing, reduce the quantum resource consumed largely, resist to noise, and simplify the storage of quantum information. Here, we present the first scheme for the self-error-corrected hyperparallel photonic quantum computation working with both the polarization and the spatial-mode degrees of freedom of photon systems simultaneously. It can prevent bit-flip errors from happening with an imperfect nonlinear interaction in the nearly realistic condition. We give the way to design the universal hyperparallel photonic quantum co…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional $LC$ electric circuit can simulate a Schrödinger equation and hence a quantum walk. Especially, we propose a physical realization of a set of universal quantum gates consisting of the CNOT, Hadamard and $π/4$ phase-shift gates with the use of telegrapher wires and mixing bridges. Furthermore, we construct the $π/2^{n}$ phase-shift gate for an arbitrary integ…
Quantum anomalies lead to finite expectation values that defy the apparent symmetries of a system. These anomalies are at the heart of topological effects in fundamental, electronic, photonic and ultracold atomic systems, where they result in a unique response to external fields but generally escape a more direct observation. Here, we implement an optical-network realization of a topological discrete-time quantum walk (DTQW), which we design so that such an anomaly can be observed directly in the unique circular polarization of a topological midgap state. This feature arises in a single-step p…
Quantum logic gates are the key elements in quantum computing. Here we investigate the possibility of achieving a scalable and compact quantum computing based on stationary electron-spin qubits, by using the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics. We design the compact quantum circuits for implementing universal and deterministic quantum gates for electron-spin systems, including the two-qubit CNOT gate and the three-qubit Toffoli gate. They are compact and economic, and they do not r…
Geometric phase plays a fundamental role in quantum theory and accounts for wide phenomena ranging from the Aharanov-Bohm effect, the integer and fractional quantum hall effects, and topological phases of matter, including topological insulators, to name a few. In this thesis, we have proposed a fresh perspective of geodesics and null phase curves, which are key ingredients in understanding the geometric phase. We have also looked at a number of applications of geometric phases in topological phases, quantum walks, and non-inertial quantum systems. The shortest curve between any two points on …
We present a scheme for implementing high-fidelity quantum logic gates using the quantum walk of a few interacting bosons on a one-dimensional lattice. The gate operation is carried out by a single compact lattice described by a one-dimensional Bose-Hubbard model with only nearest-neighbor hopping and on-site interactions. We find high-fidelity deterministic logic operations for a gate set (including the CNOT gate) that is universal for quantum information processing. We discuss the applicability of this scheme in light of recent developments in controlling and monitoring cold-atoms in optical…
We propose and analyze the design of a programmable photonic integrated circuit for high-fidelity quantum computation and simulation. We demonstrate that the reconfigurability of our design allows us to overcome two major impediments to quantum optics on a chip: it removes the need for a full fabrication cycle for each experiment and allows for compensation of fabrication errors using numerical optimization techniques. Under a pessimistic fabrication model for the silicon-on-insulator process, we demonstrate a dramatic fidelity improvement for the linear optics CNOT and CPHASE gates and, showi…
The possibility of fine-tuning the couplings between optical modes is a key requirement in photonic circuits for quantum simulations. In these architectures, emulating the long-time evolution of particles across large lattices requires sophisticated setups, that are often intrinsically lossy. Here we report ultra-long photonic quantum walks across several hundred optical modes, obtained by propagating a light beam through very few closely-stacked liquid-crystal metasurfaces. By exploiting spin-orbit effects, these implement space-dependent polarization transformations that mix circularly polar…
We have frozen the coherent evolution of a field in a cavity by repeated measurements of its photon number. We use circular Rydberg atoms dispersively coupled to the cavity mode for an absorption-free photon counting. These measurements inhibit the growth of a Field injected in the cavity by a classical source. This manifestation of the Quantum Zeno effect illustrates the back action of the photon number determination onto the Field phase. The residual growth of the Field can be seen as a random walk of its amplitude in the two-dimensional phase space. This experiment sheds light onto the meas…
