Passive verification protocol for thermal graph states

Abstract

Graph states are entangled resource states for universal measurement-based quantum computation. Although matter qubits such as superconducting circuits and trapped ions are promising candidates to generate graph states, it is technologically hard to entangle a large number of them due to several types of noise. Since they must be sufficiently cooled to maintain their quantum properties, thermal noise is one of major ones. In this paper, we show that for any temperature $T$, the fidelity $⟨G|{\rho }_T|G⟩$ between an ideal graph state $|G⟩$ at zero temperature and a thermal graph state ${\rho }_T$, which is a graph state at temperature $T$, can be efficiently estimated by using only one measurement setting. A remarkable property of our protocol is that it is passive, while existing protocols are active, namely they switch between at least two measurement settings. Since thermal noise is equivalent to an independent phase-flip error, our estimation protocol also works for that error. By generalizing our protocol to hypergraph states, we apply our protocol to the quantum-computational-supremacy demonstration with instantaneous quantum polynomial time circuits. Our results should make the characterization of entangled matter qubits extremely feasible under thermal noise.

arXiv comment10 pages, 5 figures, close to published version

References in corpus (38)

• Fault-tolerant quantum computation by anyons
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Persistent entanglement in arrays of interacting particles
• Experimental One-Way Quantum Computing
• An Open-System Quantum Simulator with Trapped Ions
• Quantum algorithms: an overview
• Quantum Computational Supremacy
• Experimental entanglement of six photons in graph states
• Quantum state estimation
• Quantum Computation by Adiabatic Evolution
• Direct Fidelity Estimation from Few Pauli Measurements
• A fault-tolerant one-way quantum computer
• Maximum-likelihood estimation of the density matrix
• Average-case complexity versus approximate simulation of commuting quantum computations
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Blind quantum computation protocol in which Alice only makes measurements
• Quantum Hypergraph States
• Instantaneous Quantum Computation
• Measurement-based quantum computation with trapped ions
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Hierarchy of universal entanglement in 2D measurement-based quantum computation
• Verification of Many-Qubit States
• General framework for verifying pure quantum states in the adversarial scenario
• Direct certification of a class of quantum simulations
• Verified measurement-based quantum computing with hypergraph states
• Resource-efficient verification of quantum computing using Serfling's bound
• Verifiable fault-tolerance in measurement-based quantum computation
• Efficient verification of Boson Sampling
• Quantum proofs can be verified using only single qubit measurements
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• One-way quantum computing in superconducting circuits
• Quantum computation via measurements on the low-temperature state of a many-body system
• Entanglement in pure and thermal cluster states
• Nonadaptive fault-tolerant verification of quantum supremacy with noise
• Linear-optical simulation of the cooling of a cluster-state Hamiltonian system
• Constant-time one-shot testing of large-scale graph states
• Minimum number of experimental settings required to verify bipartite pure states and unitaries

Cited by in corpus (1)

• Phase Transitions and Noise Robustness of Quantum Graph States