Quantum bit commitment on IBM QX

被引:4
|
作者
Almubayedh, Dhoha A. [1 ]
Alazman, Ghadeer [1 ]
Alkhalis, Mashael [1 ]
Alabdali, Manal [1 ]
Nagy, Naya [1 ]
Nagy, Marius [2 ]
Tatar, Ahmet Emin [3 ]
Alfosail, Malak [1 ]
Rahman, Atta [1 ]
AlMubairik, Norah [1 ]
机构
[1] Imam Abdulrahman Bin Faisal Univ, Coll Comp Sci & IT, Dept Comp Sci, POB 1982, Dammam, Saudi Arabia
[2] Prince Mohammad Bin Fahd Univ, Dept Comp Engn & Sci, Al Khobar, Saudi Arabia
[3] King Fahd Univ Petr & Minerals, Math & Stat Dept, Dhahran, Saudi Arabia
关键词
Quantum; Quantum cryptography; Quantum bit commitment; IBM QX; Real quantum processor;
D O I
10.1007/s11128-019-2543-8
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Quantum bit commitment (QBC) is a quantum version of the classical bit commitment security primitive. As other quantum security primitives and protocols, QBC improves on cheating detection over its classical counterpart. The implementation of the QBC protocol below relies on the use of common quantum gates: the Hadamard gate used for orthonormal bases and the CNOT gate used to swap qubits. The protocol was run and tested on IBM quantum experience (IBM QX). IBM QX offers two different quantum environments: as a simulator and as a real quantum machine. In our implementation, honest and dishonest participants were considered. Results of both the simulation and the quantum execution were compared against the theoretical expectations. The IBM QX simulator gives results that match the theoretical model. The IBM QX real computer deviates from the expected behavior by a measurable amount. Using the standard deviation and the Hamming distance, the conclusion is that the quantum computer is usable as the difference to the simulator is within an acceptable margin of error. The QBC protocol of choice is fully secure against cheating by Bob. The only way Alice can cheat is using multi-dimensional entanglement. The cost for Alice to cheat is exponential in the number of qubits used, namely O(2(6n+3k+1)).
引用
收藏
页数:27
相关论文
共 50 条
  • [41] Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol
    Spekkens, RW
    Rudolph, T
    QUANTUM INFORMATION & COMPUTATION, 2002, 2 (01) : 66 - 96
  • [42] Device-independent bit commitment based on the CHSH inequality
    Aharon, N.
    Massar, S.
    Pironio, S.
    Silman, J.
    NEW JOURNAL OF PHYSICS, 2016, 18
  • [43] Insecurity of a relativistic quantum commitment scheme
    He, Guang Ping
    RESULTS IN PHYSICS, 2023, 50
  • [44] Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
    Koshiba, Takeshi
    Odaira, Takanori
    THEORY OF QUANTUM COMPUTATION, COMMUNICATION, AND CRYPTOGRAPHY, 2009, 5905 : 33 - 46
  • [45] Secure Bit Commitment From Relativistic Constraints
    Kaniewski, Jedrzej
    Tomamichel, Marco
    Haenggi, Esther
    Wehner, Stephanie
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) : 4687 - 4699
  • [46] Secure Relativistic Bit Commitment with Fixed Channel Capacity
    Li, Qin
    Long, Dongyang
    Wang, Changji
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE FOR YOUNG COMPUTER SCIENTISTS, VOLS 1-5, 2008, : 1522 - 1526
  • [47] Quantum bit string sealing
    He, Guang Ping
    INTERNATIONAL JOURNAL OF QUANTUM INFORMATION, 2006, 4 (04) : 677 - 687
  • [48] Quantum random bit generators
    Turiel, Thomas P.
    AMERICAN STATISTICIAN, 2007, 61 (03) : 255 - 259
  • [49] Quantum encryption of superposition states with quantum permutation pad in IBM quantum computers
    Maria Perepechaenko
    Randy Kuang
    EPJ Quantum Technology, 2023, 10
  • [50] Quantum encryption of superposition states with quantum permutation pad in IBM quantum computers
    Perepechaenko, Maria
    Kuang, Randy
    EPJ QUANTUM TECHNOLOGY, 2023, 10 (01)