Directionally-Unbiased Unitary Optical Devices in Discrete-Time Quantum Walks

被引:7
|
作者
Osawa, Shuto [1 ]
Simon, David S. [1 ,2 ]
Sergienko, Alexander, V [1 ,3 ,4 ]
机构
[1] Boston Univ, Dept Elect & Comp Engn, 8 St Marys St, Boston, MA 02215 USA
[2] Stonehill Coll, Dept Phys & Astron, 320 Washington St, Easton, MA 02357 USA
[3] Boston Univ, Dept Phys, 590 Commonwealth Ave, Boston, MA 02215 USA
[4] Boston Univ, Photon Ctr, 8 St Marys St, Boston, MA 02215 USA
基金
美国国家科学基金会;
关键词
quantum walks; linear optics; quantum information processing; SCATTERING-THEORY; SEARCH; ALGORITHMS; SCHEME;
D O I
10.3390/e21090853
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The optical beam splitter is a widely-used device in photonics-based quantum information processing. Specifically, linear optical networks demand large numbers of beam splitters for unitary matrix realization. This requirement comes from the beam splitter property that a photon cannot go back out of the input ports, which we call "directionally-biased". Because of this property, higher dimensional information processing tasks suffer from rapid device resource growth when beam splitters are used in a feed-forward manner. Directionally-unbiased linear-optical devices have been introduced recently to eliminate the directional bias, greatly reducing the numbers of required beam splitters when implementing complicated tasks. Analysis of some originally directional optical devices and basic principles of their conversion into directionally-unbiased systems form the base of this paper. Photonic quantum walk implementations are investigated as a main application of the use of directionally-unbiased systems. Several quantum walk procedures executed on graph networks constructed using directionally-unbiased nodes are discussed. A significant savings in hardware and other required resources when compared with traditional directionally-biased beam-splitter-based optical networks is demonstrated.
引用
收藏
页数:32
相关论文
共 41 条
  • [31] Quantum Proxy Signature Scheme with Discrete Time Quantum Walks and Quantum One-Time Pad CNOT Operation
    Feng, Yanyan
    Zhang, Qian
    Shi, Jinjing
    Chen, Shuhui
    Shi, Ronghua
    APPLIED SCIENCES-BASEL, 2020, 10 (17):
  • [32] On the Relationship Between Continuous- and Discrete-Time Quantum Walk
    Childs, Andrew M.
    COMMUNICATIONS IN MATHEMATICAL PHYSICS, 2010, 294 (02) : 581 - 603
  • [33] An Aligned Subgraph Kernel Based on Discrete-Time Quantum Walk
    Liu, Kai
    Wang, Lulu
    Zhang, Yi
    ASIAN CONFERENCE ON MACHINE LEARNING, VOL 157, 2021, 157 : 145 - 157
  • [34] Discrete-time quantum walk-based optimization algorithm
    Liliopoulos, Ioannis
    Varsamis, Georgios D.
    Karafyllidis, Ioannis G.
    QUANTUM INFORMATION PROCESSING, 2024, 23 (01)
  • [35] Discrete-time quantum walk-based optimization algorithm
    Ioannis Liliopoulos
    Georgios D. Varsamis
    Ioannis G. Karafyllidis
    Quantum Information Processing, 23
  • [36] Parrondo's game using a discrete-time quantum walk
    Chandrashekar, C. M.
    Banerjee, Subhashish
    PHYSICS LETTERS A, 2011, 375 (14) : 1553 - 1558
  • [37] Deterministic discrete-time quantum walk search on complete bipartite graphs
    Peng, Fangjie
    Li, Meng
    Sun, Xiaoming
    PHYSICAL REVIEW RESEARCH, 2024, 6 (03):
  • [38] Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
    Stefanak, M.
    Skoupy, S.
    QUANTUM INFORMATION PROCESSING, 2017, 16 (03)
  • [39] Universal and optimal coin sequences for high entanglement generation in 1D discrete time quantum walks
    Gratsea, Aikaterini
    Metz, Friederike
    Busch, Thomas
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2020, 53 (44)
  • [40] CONNECTION BETWEEN CONTINUOUS AND DISCRETE TIME QUANTUM WALKS. FROM D-DIMENSIONAL LATTICES TO GENERAL GRAPHS
    D'Alessandro, Domenico
    REPORTS ON MATHEMATICAL PHYSICS, 2010, 66 (01) : 85 - 102