Efficient qudit based scheme for photonic quantum computing

被引:2
|
作者
Karacsony, Marton [1 ]
Oroszlany, Laszlo [1 ,2 ]
Zimboras, Zoltan [3 ,4 ]
机构
[1] Eotvos Lorand Univ, Dept Phys Complex Syst, H-1117 Budapest, Hungary
[2] Budapest Univ Technol & Econ, MTA BME Lendulet Topol & Correlat Res Grp, H-1521 Budapest, Hungary
[3] Wigner Res Ctr Phys, POB 49, H-1525 Budapest, Hungary
[4] Algorithmiq Ltd, Kanavakatu 3C, FI-00160 Helsinki, Finland
来源
SCIPOST PHYSICS CORE | 2024年 / 7卷 / 02期
关键词
COMPUTATIONAL ADVANTAGE; ENTANGLEMENT; GENERATION; NUMBER; STATES;
D O I
10.21468/SciPostPhysCore.7.2.032
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Linear optics is a promising alternative for the realization of quantum computation protocols due to the recent advancements in integrated photonic technology. In this context, usually qubit based quantum circuits are considered, however, photonic systems naturally allow also for d-ary, i.e., qudit based, algorithms. This work investigates qudits defined by the possible photon number states of a single photon in d > 2 optical modes. We demonstrate how to construct locally optimal non-deterministic many-qudit gates using linear optics and photon number resolving detectors, and explore the use of qudit cluster states in the context of a d-ary optimization problem. We find that the qudit cluster states require less optical modes and are encoded by a fewer number of entangled photons than the qubit cluster states with similar computational capabilities. We illustrate the benefit of our qudit scheme by applying it to the k-coloring problem.
引用
收藏
页数:21
相关论文
共 50 条
  • [31] Clustered entropy computing: a holoentropy based encoding scheme for high efficient computing systems
    Munagala, Venkatesh
    Prasad, K. Satya
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1): : 1429 - 1441
  • [32] Clustered entropy computing: a holoentropy based encoding scheme for high efficient computing systems
    Venkatesh Munagala
    K. Satya Prasad
    Cluster Computing, 2019, 22 : 1429 - 1441
  • [33] Verifiable Quantum Secret Sharing Based on a Single Qudit
    Zhi, Dan-Li
    Li, Zhi-Hui
    Han, Zhao-Wei
    Liu, Li-Juan
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2020, 59 (12) : 3672 - 3684
  • [34] Quantum-Secret-Sharing Scheme Based on Local Distinguishability of Orthogonal Seven-Qudit Entangled States
    Liu, Cheng-Ji
    Li, Zhi-Hui
    Bai, Chen-Ming
    Si, Meng-Meng
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2018, 57 (02) : 428 - 442
  • [35] Quantum coherence measurement of qudit systems using three-dimensional photonic circuits
    Cardoso, W. R.
    Lima, P. M. R.
    Vianna, R. O.
    Padua, S.
    PHYSICAL REVIEW A, 2020, 102 (03)
  • [36] Quantum-Secret-Sharing Scheme Based on Local Distinguishability of Orthogonal Seven-Qudit Entangled States
    Cheng-Ji Liu
    Zhi-Hui Li
    Chen-Ming Bai
    Meng-Meng Si
    International Journal of Theoretical Physics, 2018, 57 : 428 - 442
  • [37] Qudit-based quantum simulation of fermionic systems
    Chizzini, M.
    Tacchino, F.
    Chiesa, A.
    Tavernelli, I.
    Carretta, S.
    Santini, P.
    PHYSICAL REVIEW A, 2024, 110 (06)
  • [38] Verifiable Quantum Secret Sharing Based on a Single Qudit
    Dan-Li Zhi
    Zhi-Hui Li
    Zhao-Wei Han
    Li-Juan Liu
    International Journal of Theoretical Physics, 2020, 59 : 3672 - 3684
  • [39] Efficient distributed quantum computing
    Beals, Robert
    Brierley, Stephen
    Gray, Oliver
    Harrow, Aram W.
    Kutin, Samuel
    Linden, Noah
    Shepherd, Dan
    Stather, Mark
    PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2013, 469 (2153):
  • [40] Efficient quantum computing simulation
    Pavlov, Valentin
    IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, Proceedings, 2006, : 235 - 239