Constant-time one-shot testing of large-scale graph states
- URL: http://arxiv.org/abs/2201.11127v1
- Date: Wed, 26 Jan 2022 19:00:00 GMT
- Title: Constant-time one-shot testing of large-scale graph states
- Authors: Hayata Yamasaki, Sathyawageeswar Subramanian
- Abstract summary: Fault-tolerant measurement-based quantum computation (MBQC) leads to a promising scalable platform for realizing quantum computation.
Existing state-of-the-art protocols for graph-state verification by fidelity estimation have required measurements on many copies of the entire graph state.
We here construct an efficient alternative framework for testing graph states for fault-tolerant MBQC based on the theory of property testing.
- Score: 5.33024001730262
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Fault-tolerant measurement-based quantum computation (MBQC) with recent
progress on quantum technologies leads to a promising scalable platform for
realizing quantum computation, conducted by preparing a large-scale graph state
over many qubits and performing single-qubit measurements on the state. With
fault-tolerant MBQC, even if the graph-state preparation suffers from errors
occurring at an unknown physical error rate, we can suppress the effect of the
errors. Verifying graph states is vital to test whether we can conduct MBQC as
desired even with such errors. However, problematically, existing
state-of-the-art protocols for graph-state verification by fidelity estimation
have required measurements on many copies of the entire graph state and hence
have been prohibitively costly in terms of the number of qubits and the
runtime. We here construct an efficient alternative framework for testing graph
states for fault-tolerant MBQC based on the theory of property testing. Our
test protocol accepts with high probability when the physical error rate is
small enough to make fault-tolerant MBQC feasible and rejects when the rate is
above the threshold of fault-tolerant MBQC. The novelty of our protocol is that
we use only a single copy of the $N$-qubit graph state and single-qubit Pauli
measurements only on a constant-sized subset of the qubits; thus, the protocol
has a constant runtime independently of $N$. Furthermore, we can immediately
use the rest of the graph state for fault-tolerant MBQC if the protocol
accepts. These results achieve a significant advantage over prior art for
graph-state verification in the number of qubits and the total runtime.
Consequently, our work offers a new route to a fast and practical framework for
benchmarking large-scale quantum state preparation.
Related papers
- CondiQuant: Condition Number Based Low-Bit Quantization for Image Super-Resolution [59.91470739501034]
We propose CondiQuant, a condition number based low-bit post-training quantization for image super-resolution.
We show that CondiQuant outperforms existing state-of-the-art post-training quantization methods in accuracy without computation overhead.
arXiv Detail & Related papers (2025-02-21T14:04:30Z) - Achieving computational gains with quantum error correction primitives: Generation of long-range entanglement enhanced by error detection [0.0]
We show that the strategic application of QEC primitives without logical encoding can yield significant advantages on superconducting processors.
We present a novel protocol for implementing long-range CNOT gates that relies on a unitarily-prepared Greenberger-Horne-Zeilinger (GHZ) state as well as a unitary disentangling step.
We generate a 75-qubit GHZ state exhibiting genuine multipartite entanglement, the largest reported to date.
arXiv Detail & Related papers (2024-11-22T00:08:23Z) - Efficient separate quantification of state preparation errors and
measurement errors on quantum computers and their mitigation [0.5439020425819]
Current noisy quantum computers have multiple types of errors, which can occur in the state preparation, measurement/readout, and gate operation.
We propose a simple and resource-efficient approach to quantify separately the state preparation and readout error rates.
arXiv Detail & Related papers (2023-10-29T02:51:06Z) - 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) - A Universal Error Measure for Input Predictions Applied to Online Graph
Problems [57.58926849872494]
We introduce a novel measure for quantifying the error in input predictions.
The measure captures errors due to absent predicted requests as well as unpredicted actual requests.
arXiv Detail & Related papers (2022-05-25T15:24:03Z) - Measurement based estimator scheme for continuous quantum error
correction [52.77024349608834]
Canonical discrete quantum error correction (DQEC) schemes use projective von Neumann measurements on stabilizers to discretize the error syndromes into a finite set.
Quantum error correction (QEC) based on continuous measurement, known as continuous quantum error correction (CQEC), can be executed faster than DQEC and can also be resource efficient.
We show that by constructing a measurement-based estimator (MBE) of the logical qubit to be protected, it is possible to accurately track the errors occurring on the physical qubits in real time.
arXiv Detail & Related papers (2022-03-25T09:07:18Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Conditionally rigorous mitigation of multiqubit measurement errors [0.0]
measurement errors are significantly larger than gate errors on some platforms.
We develop a measurement error mitigation technique, conditionally rigorous TMEM, that is not sensitive to state-preparation errors.
arXiv Detail & Related papers (2021-09-09T17:49:13Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Quantum tomography of noisy ion-based qudits [0.0]
We show that it is possible to construct a quantum measurement protocol that contains no more than a single quantum operation in each measurement circuit.
The measures described can significantly improve the accuracy of quantum tomography of real ion-based qudits.
arXiv Detail & Related papers (2020-11-09T04:10:32Z) - Fast and robust quantum state tomography from few basis measurements [65.36803384844723]
We present an online tomography algorithm designed to optimize all the aforementioned resources at the cost of a worse dependence on accuracy.
The protocol is the first to give provably optimal performance in terms of rank and dimension for state copies, measurement settings and memory.
Further improvements are possible by executing the algorithm on a quantum computer, giving a quantum speedup for quantum state tomography.
arXiv Detail & Related papers (2020-09-17T11:28:41Z)
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.