Efficient Verification of Boson Sampling Using a Quantum Computer

• URL: http://arxiv.org/abs/2108.03954v1
• Date: Mon, 9 Aug 2021 11:41:15 GMT
• Title: Efficient Verification of Boson Sampling Using a Quantum Computer
• Authors: Sritam Kumar Satpathy, Vallabh Vibhu, Sudev Pradhan, Bikash K. Behera and Prasanta K. Panigrahi
• Abstract summary: We use the protocols given in the paper [arXiv:2006.03520] to construct a boson sampling experiment using discrete quantum states on IBM quantum computer. We demonstrate the protocols for single mode fidelity estimation, multi mode fidelity estimation and a verification protocol using IBMQ "athens" chip.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Boson sampling is a sub-universal model used to show quantum speed-up. However, the methods of validation to prove quantum speedup are not robust and accurate. All verification methods involve additional or little studied assumptions. Here, we use the protocols given in the paper [arXiv:2006.03520] to construct a boson sampling experiment using discrete quantum states on IBM quantum computer and verify the fidelity of the output states using heterodyne detection. We demonstrate the protocols for single mode fidelity estimation, multi mode fidelity estimation and a verification protocol using IBMQ "athens" chip. Moreover, we illustrate the use of this verification protocol in the quantum key distribution (QKD) process for estimating the fidelity of different types of encoding-decoding basis. This shows that the verification protocols can be used to enable efficient and reliable certification of highly entangled multi-particle states.

Related papers

• Increasing Interference Detection in Quantum Cryptography using the Quantum Fourier Transform [0.0]
  We present two quantum cryptographic protocols leveraging the quantum Fourier transform (QFT) The foremost of these protocols is a novel QKD method that leverages this effectiveness of the QFT. We additionally show how existing quantum encryption methods can be augmented with a QFT-based approach to improve eavesdropping detection.
  arXiv  Detail & Related papers  (2024-04-18T21:04:03Z)
• Protocols and Trade-Offs of Quantum State Purification [4.732131350249]
  We introduce a general state purification framework designed to achieve the highest fidelity with a specified probability. For i.i.d. quantum states under depolarizing noise, our framework can replicate the purification protocol proposed by Barenco and al. We prove the protocols' optimality for two copies of noisy states with any dimension and confirm its optimality for higher numbers of copies and dimensions.
  arXiv  Detail & Related papers  (2024-04-01T14:34:45Z)
• Fidelity estimation of quantum states on a silicon photonic chip [0.03078691410268859]
  We adapt a previously reported optimal state verification protocol (Phys. Rev. Lett. 120, 170502) for fidelity estimation of two-qubit states. We demonstrate the protocol experimentally using a fully-programmable silicon photonic two-qubit chip.
  arXiv  Detail & Related papers  (2023-06-01T18:16:33Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Multi-User Entanglement Distribution in Quantum Networks Using Multipath Routing [55.2480439325792]
  We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
  arXiv  Detail & Related papers  (2023-03-06T18:06:00Z)
• Cross-Platform Verification in Quantum Networks [0.7734726150561088]
  We describe and analyze efficient cross-platform verification protocols for quantum states. We show how these can be used to verify computations. As a proof of principle, we implement basic versions of these schemes on available quantum processors.
  arXiv  Detail & Related papers  (2022-12-15T13:07:33Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Single-photon-memory measurement-device-independent quantum secure direct communication [63.75763893884079]
  Quantum secure direct communication (QSDC) uses the quantum channel to transmit information reliably and securely. In order to eliminate the security loopholes resulting from practical detectors, the measurement-device-independent (MDI) QSDC protocol has been proposed. We propose a single-photon-memory MDI QSDC protocol (SPMQC) for dispensing with high-performance quantum memory.
  arXiv  Detail & Related papers  (2022-12-12T02:23:57Z)
• Sample-efficient device-independent quantum state verification and certification [68.8204255655161]
  Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing. We develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime. We show that device-independent verification can be performed with optimal sample efficiency.
  arXiv  Detail & Related papers  (2021-05-12T17:48:04Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Theory of quantum system certification: a tutorial [1.583842747998493]
  This tutorial explains prominent protocols for certifying the physical layer of quantum devices. We discuss methods of direct quantum state certification, direct fidelity estimation, shadow fidelity estimation, direct quantum process certification, randomized benchmarking and cross-entropy benchmarking.
  arXiv  Detail & Related papers  (2020-10-12T18:00:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.