Shivani Singh’s research while affiliated with Homi Bhabha National Institute and other places

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (4)


Figure 1. (a) Shows an illustration of a real qubit state. (b) Shows a mapping between the two states of position Hilbert space in one-dimension to the computational basis of second qubit in two qubit system, and (c) shows a mapping between the position Hilbert space in one-dimensional closed quantum walk state to the computational basis of the second and third qubits in the three qubit system. These two graphs for quantum walk form the building blocks for the scheme to perform computation using quantum walks.
Figure 7. Schematic illustration of the controlled-NOT gate on the computational basis of three-qubit system using position-dependent quantum walk operators. Form of the shift operator S j ± is given in Eq. (2).
Figure 8. Schematic illustration of the Toffoli gate on a three-qubit system using position dependent quantum walk operators.
Quantum circuit on three qubit system and equivalent quantum walk scheme to implement same circuit is illustrated. Red circle represents |0⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert 0\rangle $$\end{document} of the real particle and green circle represents |1⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert 1\rangle $$\end{document} of the real particle. The input state is |Ψ⟩in=|000⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert \Psi \rangle _{in} = \vert 000\rangle $$\end{document} and output state is a superposition of four states |Ψ⟩out=12(|000⟩+|011⟩+|100⟩+|111⟩)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert \Psi \rangle _{out} = \frac{1}{2}\Big ( \vert 000\rangle + \vert 011\rangle + \vert 100\rangle + \vert 111\rangle \Big )$$\end{document}. CNOT23\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$CNOT_{23}$$\end{document} is a position dependent shift operation given by S^-0S^-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\hat{S}}^{0}_{-}{\hat{S}}^{1}_{-}$$\end{document} at position |01⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert 01\rangle $$\end{document} and identity at other states.
Quantum circuit to create GHZ-state on three qubit system and equivalent quantum walk scheme to obtain GHZ-state is illustrated. Red circle represents |0⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert 0\rangle $$\end{document} of the real particle and green circle represents |1⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert 1\rangle $$\end{document} of the real particle. Here the QW-based scheme is more simplified compared to quantum circuit implementation. The input state is |Ψ⟩in=|000⟩\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert \Psi \rangle _{in} = \vert 000\rangle $$\end{document} and output state is a GHZ-state |Ψ⟩out=12(|000⟩+|111⟩)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\vert \Psi \rangle _{out} = \frac{1}{\sqrt{2}}\Big ( \vert 000\rangle + \vert 111\rangle \Big )$$\end{document}.

+10

Universal quantum computing using single-particle discrete-time quantum walk
  • Article
  • Full-text available

June 2021

·

550 Reads

·

50 Citations

Shivani Singh

·

·

·

Quantum walk has been regarded as a primitive to universal quantum computation. In this paper, we demonstrate the realization of the universal set of quantum gates on two- and three-qubit systems by using the operations required to describe the single particle discrete-time quantum walk on a position space. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.

Download

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer

July 2020

·

291 Reads

·

70 Citations

·

Shivani Singh

·

·

[...]

·

Norbert M. Linke

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 automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation. Implementations of quantum walks on ion trap quantum computers have been so far limited to the analogue simulation approach. Here, the authors implement a quantum-circuit-based discrete quantum walk in one-dimensional position space, realizing a Dirac cellular automaton with tunable mass parameter.


Universal quantum computation using single qubit discrete-time quantum walk

April 2020

·

63 Reads

·

1 Citation

Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single qubit discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of the scheme is demonstrated by using a set of walk operations on a closed lattice form to implement the universal set of quantum gates on multi-qubit system. We also present a set of experimentally realizable walk operations that can implement Grover's algorithm, quantum Fourier transformation and quantum phase estimation algorithms. Analysis of space and time complexity of the scheme highlights the advantages of quantum walk based model for quantum computation on systems where implementation of quantum walk evolution operations is inherent feature of the system.


Accelerated quantum walk, two-particle entanglement generation and localization

October 2018

·

60 Reads

We present a scheme to describe accelerating discrete-time quantum walk dynamics for single- and two-particle in a one-dimensional position space. We show the effect of acceleration in enhancing the entanglement between the particle and position space and in generation of entanglement between the two unentangled particle. By introducing the disorder in the form of phase operator we study the transition from localization to deloclaization as a function of acceleration. These interwinding connection between acceleration, entanglement generation and localization along with well established connection of quantum walks with Dirac equation can be used to probe further in the direction of understanding the role of acceleration, mass and entanglement in relativistic quantum mechanics and quantum field theory. Expansion of operational tools for quantum simulations using quantum walks is another direction where these results can play an important role.

Citations (3)


... Quantum walks on graphs are one of the few established design strategies for quantum algorithms. Despite their simple description, quantum walks are extremely powerful, as they are universal for quantum computation [3,4]. Owing to their non-classical spreading dynamics, localization property, and potential algorithmic advantages, quantum walks have been extensively explored both theoretically and experimentally [5][6][7]. ...

Reference:

Simulating discrete-time quantum walk with urn model
Universal quantum computing using single-particle discrete-time quantum walk

... Quantum walks have found successful applications across a wide range of domains, including quantum search algorithms [23], community detection in complex networks [24], modeling energy transfer in photosynthesis [25][26][27], modeling quantum mechanics in curved space-time [28,29], to name a few. The split-step quantum walk is particularly notable for its ability to simulate relativistic quantum dynamics [30,31]. Discrete-time quantum walks have also proven to be powerful tools for simulating topological insulators [32,33], enabling the study of topologically protected edge states and phase transitions through precise control over coin and shift parameters. ...

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer

... The continuous-time quantum walk (CTQW), however, is defined solely on the position space, with the evolution operator being dependent on the construction of the position space [8]. Both variants of quantum walks have been used to develop various quantum algorithms to perform various tasks, schemes for quantum simulation [9][10][11][12][13][14][15][16][17][18], and for realizing universal quantum computation [19][20][21][22]. A quadratically B Prateek Chawla ...

Universal quantum computation using single qubit discrete-time quantum walk
  • Citing Preprint
  • April 2020