scholarly journals Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware

2021 ◽  
Vol 104 (6) ◽  
Author(s):  
Shivani Singh ◽  
C. Huerta Alderete ◽  
Radhakrishnan Balu ◽  
Christopher Monroe ◽  
Norbert M. Linke ◽  
...  
2018 ◽  
Vol 29 (10) ◽  
pp. 1850098 ◽  
Author(s):  
R. F. S. Andrade ◽  
A. M. C. Souza

Properties of one-dimensional discrete-time quantum walks (DTQWs) are sensitive to the presence of inhomogeneities in the substrate, which can be generated by defining position-dependent coin operators. Deterministic aperiodic sequences of two or more symbols provide ideal environments where these properties can be explored in a controlled way. Based on an exhaustive numerical study, this work discusses a two-coin model resulting from the construction rules that lead to the usual fractal Cantor set. Although the fraction of the less frequent coin [Formula: see text] as the size of the chain is increased, it leaves peculiar properties in the walker dynamics. They are characterized by the wave function, from which results for the probability distribution and its variance, as well as the entanglement entropy, were obtained. A number of results for different choices of the two coins are presented. The entanglement entropy has shown to be very sensitive to uncovering subtle quantum effects present in the model.


2019 ◽  
Vol 33 (23) ◽  
pp. 1950270 ◽  
Author(s):  
Duc Manh Nguyen ◽  
Sunghwan Kim

The recent paper entitled “Generalized teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles” by Yang et al. [Mod. Phys. Lett. B 33(6) (2019) 1950069] proposed the quantum teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles. However, further investigation shows that the quantum walk over the one-dimensional infinite line can be based over the [Formula: see text]-cycles and cannot be based on [Formula: see text]-lines. The proofs of our claims on quantum walks based on finite lines are also provided in detail.


2017 ◽  
Vol 96 (6) ◽  
Author(s):  
Luca Innocenti ◽  
Helena Majury ◽  
Taira Giordani ◽  
Nicolò Spagnolo ◽  
Fabio Sciarrino ◽  
...  

Author(s):  
Luca Innocenti ◽  
Helena Majury ◽  
Taira Giordani ◽  
Nicolò Spagnolo ◽  
Fabio Sciarrino ◽  
...  

Author(s):  
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.


2017 ◽  
Vol 96 (1) ◽  
Author(s):  
N. Lo Gullo ◽  
C. V. Ambarish ◽  
Th. Busch ◽  
L. Dell'Anna ◽  
C. M. Chandrashekar

Sign in / Sign up

Export Citation Format

Share Document