Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2202.10624 · Physical Review A

Passive verification protocol for thermal graph states

Kazuki Akimoto, Shunji Tsuchiya, Ryosuke Yoshii, Yuki Takeuchi

Published Jul 5, 2022• 2 citations
arXivHTMLPDF

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 the major ones. In this paper, we show that, for any temperature $T$, the fidelity $\ensuremath{\langle}G|{\ensuremath{\rho}}_{T}|G\ensuremath{\rangle}$ between an ideal graph state $|G\ensuremath{\rangle}$ at zero temperature and a thermal graph state ${\ensuremath{\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.

DOI
10.1103/physreva.106.012405

Related papers

Fidelity-estimation method for graph states with depolarizing noise

Tomonori Tanizawa, Yuki Takeuchi, Shion Yamashika +2 more

Graph states are entangled states that are useful for several quantum information processing tasks, such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods for estimating the fidelity between the ideal graph state and an experimentally realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.

arXiv:2304.10952•Physical Review Research•Dec 19, 2023•5 citations

Verifying commuting quantum computations via fidelity estimation of weighted graph states

Masahito Hayashi, Yuki Takeuchi

Abstract The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some unproven conjectures). In order to experimentally demonstrate the advantage using medium or large-scale IQP circuits, it is inevitable to efficiently verify whether the constructed IQP circuits faithfully work. There exist two types of IQP models, each of which is the sampling on hypergraph states or weighted graph states. For the first-type IQP model, polynomial-time verification protocols have already been proposed. In this paper, we propose verification protocols for the second-type IQP model. To this end, we propose polynomial-time fidelity estimation protocols of weighted graph states for each of the following four situations where a verifier can (i) choose any measurement basis and perform adaptive measurements, (ii) only choose restricted measurement bases and perform adaptive measurements, (iii) choose any measurement basis and only perform non-adaptive measurements, and (iv) only choose restricted measurement bases and only perform non-adaptive measurements. In all of our verification protocols, the verifier’s quantum operations are only single-qubit measurements. Since we assume no independent and identically distributed property on quantum states, our protocols work in any situation.

arXiv:1902.03369•New Journal of Physics•Aug 21, 2019•28 citations

Verification of hypergraph states

Tomoyuki Morimae, Yuki Takeuchi, Masahito Hayashi

Hypergraph states are generalizations of graph states where controlled-$Z$ gates on edges are replaced with generalized controlled-$Z$ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying a certain class of hypergraph states with only sequential single-qubit Pauli measurements. Importantly, no i.i.d. property of samples is assumed in our protocol: any artificial entanglement among samples cannot fool the verifier. As applications of our protocol, we consider verified blind quantum computing with hypergraph states, and quantum computational supremacy demonstrations with hypergraph states.

arXiv:1701.05688•Physical Review A•Dec 20, 2017•76 citations

Verification of blind quantum computation with entanglement witnesses

Qingshan Xu, Xiaoqing Tan, Rui Huang +1 more

Verifiable blind quantum computation provides a cloud scenario for scalable quantum information processing. However, constructing one resource-efficient verification protocol is still an open problem. In this paper, the context of verification we consider is the measurement-based model, in which the client receives the graph state prepared by the server and performs single-qubit measurements on it to drive the computation. We first utilize three entanglement witnesses to estimate the fidelity of the prepared graph state. Applying entanglement witnesses to design the test phase, we propose verification protocols. Our protocol requires overhead in terms of copies of the graph state that scales as $O({n}^{2}logn)$, where $n$ is the number of qubits of the graph state. Furthermore, the soundness of our protocol is improved. The advantages of our protocol are derived from the fact that each entanglement witness can be implemented by the client with a fixed number of measurement settings.

Physical Review A•Oct 12, 2021•20 citations

Quantum Hypergraph States in Noisy Quantum Channels.

Supriyo Dutta, Subhashish Banerjee, Monika Rani

The family of quantum graph and hypergraph states are ubiquitous in quantum information. They have diverse applications ranging from quantum network protocols to measurement based quantum computing. The hypergraph states are a generalization of graph states, a well-known family of entangled multi-qubit quantum states. We can map these states to qudit states. In this work, we analyze a number of noisy quantum channels for qudits, on the family of qudit hypergraph states. The channels studied are the dit-flip noise, phase flip noise, dit-phase flip noise, depolarizing noise, non-Markovian Amplitude Damping Channel (ADC), dephasing noise, and depolarization noise. To gauge the effect of noise on quantum hypergraph states, the fidelity between the original and the final states is studied. The change of coherence under the action of noisy channels is also studied, both analytically and numerically.

•Oct 17, 2021•0 citations

Efficient graph-diagonal characterization of noisy states distributed over quantum networks via Bell sampling

Zherui Jerry Wang, Joshua Carlo A. Casapao, Naphan Benchasattabuse +6 more

Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network. Our approach offers significant advantages over direct diagonal estimation using unentangled single-qubit measurements in terms of scalability. Specifically, we prove that estimating the full vector of diagonal elements requires a sample complexity that scales linearly with the number of qubits ($\mathcal{O}(n)$), providing an exponential reduction in resource overhead compared to the best known $\mathcal{O}(2^n)$ scaling of direct estimation. Furthermore, we demonstrate that global properties, such as state fidelity, can be estimated with a sample complexity independent of the network size. Finally, we present numerical results indicating that the estimation in practice is more efficient than the derived theoretical bounds. Our work thus establishes a promising technique for efficiently estimating noisy graph states in large networks under realistic experimental conditions.

quant-pharXiv:2512.06650•Dec 9, 2025•2 citations
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 the major ones. In this paper, we show that, for any temperature TTT, the fidelity \ensuremath⟨G∣\ensuremathρT∣G\ensuremath⟩\ensuremath{\langle}G|{\ensuremath{\rho}}_{T}|G\ensuremath{\rangle}\ensuremath⟨G∣\ensuremathρT​∣G\ensuremath⟩ between an ideal graph state ∣G\ensuremath⟩|G\ensuremath{\rangle}∣G\ensuremath⟩ at zero temperature and a thermal graph state \ensuremathρT{\ensuremath{\rho}}_{T}\ensuremathρT​, which is a graph state at temperature TTT, 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.
Graph states are entangled states that are useful for several quantum information processing tasks, such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more essential to devise efficient methods for estimating the fidelity between the ideal graph state and an experimentally realized actual state. Any efficient fidelity-estimation method, in general, must use multiple experimental settings, i.e., needs to switch between at least two measurements. Recently, it has been shown that a single measurement is sufficient if the noise can be modeled as the phase-flip error. Since the bit-flip error should also occur in several experiments, it is desired to extend this simplest method to noise models that include phase and bit-flip errors. However, it seems to be nontrivial because their result strongly depends on properties of the phase-flip error. In this paper, by analyzing effects of the bit-flip error on stabilizer operators of graph states, we achieve the extension to the depolarizing noise, which is a major noise model including phase and bit-flip errors. We also numerically evaluate our simplest method for noise models interpolating between the phase-flip and depolarizing noises.
Abstract The instantaneous quantum polynomial time (IQP) model is one of promising models to demonstrate a quantum computational advantage over classical computers. If the IQP model can be efficiently simulated by a classical computer, an unlikely consequence in computer science can be obtained (under some unproven conjectures). In order to experimentally demonstrate the advantage using medium or large-scale IQP circuits, it is inevitable to efficiently verify whether the constructed IQP circuits faithfully work. There exist two types of IQP models, each of which is the sampling on hypergraph states or weighted graph states. For the first-type IQP model, polynomial-time verification protocols have already been proposed. In this paper, we propose verification protocols for the second-type IQP model. To this end, we propose polynomial-time fidelity estimation protocols of weighted graph states for each of the following four situations where a verifier can (i) choose any measurement basis and perform adaptive measurements, (ii) only choose restricted measurement bases and perform adaptive measurements, (iii) choose any measurement basis and only perform non-adaptive measurements, and (iv) only choose restricted measurement bases and only perform non-adaptive measurements. In all of our verification protocols, the verifier’s quantum operations are only single-qubit measurements. Since we assume no independent and identically distributed property on quantum states, our protocols work in any situation.
Hypergraph states are generalizations of graph states where controlled-ZZZ gates on edges are replaced with generalized controlled-ZZZ gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying a certain class of hypergraph states with only sequential single-qubit Pauli measurements. Importantly, no i.i.d. property of samples is assumed in our protocol: any artificial entanglement among samples cannot fool the verifier. As applications of our protocol, we consider verified blind quantum computing with hypergraph states, and quantum computational supremacy demonstrations with hypergraph states.
Verifiable blind quantum computation provides a cloud scenario for scalable quantum information processing. However, constructing one resource-efficient verification protocol is still an open problem. In this paper, the context of verification we consider is the measurement-based model, in which the client receives the graph state prepared by the server and performs single-qubit measurements on it to drive the computation. We first utilize three entanglement witnesses to estimate the fidelity of the prepared graph state. Applying entanglement witnesses to design the test phase, we propose verification protocols. Our protocol requires overhead in terms of copies of the graph state that scales as O(n2logn)O({n}^{2}logn)O(n2logn), where nnn is the number of qubits of the graph state. Furthermore, the soundness of our protocol is improved. The advantages of our protocol are derived from the fact that each entanglement witness can be implemented by the client with a fixed number of measurement settings.
The family of quantum graph and hypergraph states are ubiquitous in quantum information. They have diverse applications ranging from quantum network protocols to measurement based quantum computing. The hypergraph states are a generalization of graph states, a well-known family of entangled multi-qubit quantum states. We can map these states to qudit states. In this work, we analyze a number of noisy quantum channels for qudits, on the family of qudit hypergraph states. The channels studied are the dit-flip noise, phase flip noise, dit-phase flip noise, depolarizing noise, non-Markovian Amplitude Damping Channel (ADC), dephasing noise, and depolarization noise. To gauge the effect of noise on quantum hypergraph states, the fidelity between the original and the final states is studied. The change of coherence under the action of noisy channels is also studied, both analytically and numerically.
Graph states are an important class of entangled states that serve as a key resource for distributed information processing and communication in quantum networks. In this work, we propose a protocol that utilizes a Bell sampling subroutine to characterize the diagonal elements in the graph basis of noisy graph states distributed across a network. Our approach offers significant advantages over direct diagonal estimation using unentangled single-qubit measurements in terms of scalability. Specifically, we prove that estimating the full vector of diagonal elements requires a sample complexity that scales linearly with the number of qubits (O(n)\mathcal{O}(n)O(n)), providing an exponential reduction in resource overhead compared to the best known O(2n)\mathcal{O}(2^n)O(2n) scaling of direct estimation. Furthermore, we demonstrate that global properties, such as state fidelity, can be estimated with a sample complexity independent of the network size. Finally, we present numerical results indicating that the estimation in practice is more efficient than the derived theoretical bounds. Our work thus establishes a promising technique for efficiently estimating noisy graph states in large networks under realistic experimental conditions.