Classical Communication Enhanced Quantum State Verification

• URL: http://arxiv.org/abs/2010.10011v2
• Date: Thu, 22 Oct 2020 04:02:36 GMT
• Title: Classical Communication Enhanced Quantum State Verification
• Authors: Wen-Hao Zhang, Xiao Liu, Peng Yin, Xing-Xiang Peng, Gong-Chu Li, Xiao-Ye Xu, Shang Yu, Zhi-Bo Hou, Yong-Jian Han, Jin-Shi Xu, Zong-Quan Zhou, Geng Chen, Chuan-Feng Li and Guang-Can Guo
• Abstract summary: We experimentally implement an adaptive quantum state verification using classical communication. The constant-factor is minimized from 2.5 to 1.5 in this experiment, which means that only 60% measurements are required to achieve a certain value of epsilon.
• Score: 7.954293264301819
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state verification provides an efficient approach to characterize the reliability of quantum devices for generating certain target states. The figure of merit of a specific strategy is the estimated infidelity $\epsilon$ of the tested state to the target state, given a certain number of performed measurements n. Entangled measurements constitute the globally optimal strategy and achieve the scaling that \epsilon is inversely proportional to n. Recent advances show that it is possible to achieve the same scaling simply with non-adaptive local measurements, however, the performance is still worse than the globally optimal bound up to a constant factor. In this work, by introducing classical communication, we experimentally implement an adaptive quantum state verification. The constant-factor is minimized from ~2.5 to 1.5 in this experiment, which means that only 60% measurements are required to achieve a certain value of \epsilon compared to optimal non-adaptive local strategy. Our results indicate that classical communication significantly enhances the performance of quantum state verification, and leads to an efficiency that further approaches the globally optimal bound.

Related papers

• Semi-definite optimization of the measured relative entropies of quantum states and channels [3.9134031118910264]
  We show that measured relative entropies of quantum states and channels can be calculated efficiently by means of semi-definite programming. Not only do the programs output the optimal values of the measured relative entropies of states and channels, but they also provide numerical characterizations of optimal strategies for achieving them.
  arXiv  Detail & Related papers  (2024-06-27T10:20:56Z)
• Adaptive Phase Estimation with Squeezed Vacuum Approaching the Quantum Limit [0.0]
  Phase estimation plays a central role in communications, sensing, and information processing. Quantum correlated states, such as squeezed states, enable phase estimation beyond the shot-noise limit. Physical realizations of optimal quantum measurements for optical phase estimation with quantum-correlated states are still unknown.
  arXiv  Detail & Related papers  (2023-12-12T19:27:04Z)
• Optimal estimation of pure states with displaced-null measurements [0.0]
  We revisit the problem of estimating an unknown parameter of a pure quantum state. We investigate null-measurement' strategies in which the experimenter aims to measure in a basis that contains a vector close to the true system state.
  arXiv  Detail & Related papers  (2023-10-10T16:46:24Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• 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)
• Randomized adaptive quantum state preparation [0.0]
  A cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states.
  arXiv  Detail & Related papers  (2023-01-10T20:32:49Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• A Quantum Optimal Control Problem with State Constrained Preserving Coherence [68.8204255655161]
  We consider a three-level $Lambda$-type atom subjected to Markovian decoherence characterized by non-unital decoherence channels. We formulate the quantum optimal control problem with state constraints where the decoherence level remains within a pre-defined bound.
  arXiv  Detail & Related papers  (2022-03-24T21:31:34Z)
• High Fidelity Quantum State Transfer by Pontryagin Maximum Principle [68.8204255655161]
  We address the problem of maximizing the fidelity in a quantum state transformation process satisfying the Liouville-von Neumann equation. By introducing fidelity as the performance index, we aim at maximizing the similarity of the final state density operator with the one of the desired target state.
  arXiv  Detail & Related papers  (2022-03-07T13:27:26Z)
• Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing [87.17253904965372]
  We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies. We show that these errors decrease exponentially with decay rates given by the measured relative entropies between the two states.
  arXiv  Detail & Related papers  (2021-04-30T00:52:48Z)
• Towards the standardization of quantum state verification using optimal strategies [9.565853956571603]
  We experimentally realize the recently proposed two-qubit entangled state verification strategies. About 3283/536 number of copies ($N$) are required to verify the target quantum state for nonadaptive/adaptive strategies.
  arXiv  Detail & Related papers  (2020-02-03T10:38:15Z)

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.