Efficient benchmarking of logical magic state

• URL: http://arxiv.org/abs/2505.09687v1
• Date: Wed, 14 May 2025 18:00:04 GMT
• Title: Efficient benchmarking of logical magic state
• Authors: Su-un Lee, Ming Yuan, Senrui Chen, Kento Tsubouchi, Liang Jiang,
• Abstract summary: We show that benchmarking schemes measuring one copy of the magic state per round requires $Omega (1/epsilon2)$ samples for single-qubit magic states.<n>We propose two approaches to overcome this limitation: (i) Bell measurements on two copies of the twirled state and (ii) single-copy schemes leveraging twirled multi-qubit magic states.
• Score: 8.565601028339385
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-fidelity logical magic states are a critical resource for fault-tolerant quantum computation, enabling non-Clifford logical operations through state injection. However, benchmarking these states presents significant challenges: one must estimate the infidelity $\epsilon$ with multiplicative precision, while many quantum error-correcting codes only permit Clifford operations to be implemented fault-tolerantly. Consequently, conventional state tomography requires $\sim1/\epsilon^2$ samples, making benchmarking impractical for high-fidelity states. In this work, we show that any benchmarking scheme measuring one copy of the magic state per round necessarily requires $\Omega(1/\epsilon^2)$ samples for single-qubit magic states. We then propose two approaches to overcome this limitation: (i) Bell measurements on two copies of the twirled state and (ii) single-copy schemes leveraging twirled multi-qubit magic states. Both benchmarking schemes utilize measurements with stabilizer states orthogonal to the ideal magic state and we show that $O(1/\epsilon)$ sample complexity is achieved, which we prove to be optimal. Finally, we demonstrate the robustness of our protocols through numerical simulations under realistic noise models, confirming that their advantage persists even at moderate error rates currently achievable in state-of-the-art experiments.

Related papers

• Augmenting Simulated Noisy Quantum Data Collection by Orders of Magnitude Using Pre-Trajectory Sampling with Batched Execution [47.60253809426628]
  We present the Pre-Trajectory Sampling technique, increasing efficiency and utility of trajectory simulations by tailoring error types.<n>We generate massive datasets of one trillion and one million shots, respectively.
  arXiv  Detail & Related papers  (2025-04-22T22:36:18Z)
• Highly-entangled, highly-doped states that are efficiently cross-device verifiable [0.0]
  We introduce a class of highly entangled real quantum states that cannot be approximated by circuits with $log$-many non-Clifford gates.<n>We prove that Bell sampling enables efficient cross-device verification (or distributed inner product estimation) for these states.<n>We anticipate that these results could have applications in quantum cryptography and verification.
  arXiv  Detail & Related papers  (2025-01-20T19:12:34Z)
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold [1.7359033750147501]
  This work employs a qubit-efficient rotated heavy-hexagonal surface code for IBM quantum processors.<n>We report error thresholds for both logical bit- and phase-flip errors, of $approx0.37%$ and $approx0.31%$, respectively.<n>Our work demonstrates the potential for realising non-Clifford logical gates by producing high-fidelity logical magic states on IBM quantum devices.
  arXiv  Detail & Related papers  (2024-12-02T12:35:52Z)
• Experimental demonstration of the Bell-type inequalities for four qubit Dicke state using IBM Quantum Processing Units [5.361677484495031]
  We theoretically and experimentally investigate the violation of Bell-type inequalities using two- and four-qubit Dicke states on IBM Quantum Processing Units (QPUs)<n>For the two-qubit case, we demonstrate clear violations of the CHSH inequality, with the highest observed Bell parameter reaching $2.821 pm 0.0019$ using M3 error mitigation.<n>In the four-qubit case, we employ a Bell-type inequality tailored for Dicke states and achieve a maximum violation of $2.607 pm 0.029$ without the need for additional mitigation.
  arXiv  Detail & Related papers  (2024-10-26T18:04:06Z)
• DB-LLM: Accurate Dual-Binarization for Efficient LLMs [83.70686728471547]
  Large language models (LLMs) have significantly advanced the field of natural language processing. Existing ultra-low-bit quantization always causes severe accuracy drops. We propose a novel Dual-Binarization method for LLMs, namely DB-LLM.
  arXiv  Detail & Related papers  (2024-02-19T09:04:30Z)
• Encoding a magic state with beyond break-even fidelity [1.449788466039287]
  We propose and implement a scheme to prepare a magic state on a superconducting qubit array using error correction. We find that our scheme produces better magic states than those we can prepare using the individual qubits of the device. Our prototype will be invaluable in the future as it can reduce the number of physical qubits needed to produce high-fidelity magic states.
  arXiv  Detail & Related papers  (2023-05-23T01:19:53Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• 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)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Towards Sample-Optimal Compressive Phase Retrieval with Sparse and Generative Priors [59.33977545294148]
  We show that $O(k log L)$ samples suffice to guarantee that the signal is close to any vector that minimizes an amplitude-based empirical loss function. We adapt this result to sparse phase retrieval, and show that $O(s log n)$ samples are sufficient for a similar guarantee when the underlying signal is $s$-sparse and $n$-dimensional.
  arXiv  Detail & Related papers  (2021-06-29T12:49:54Z)
• Detecting entanglement in arbitrary two-mode Gaussian state: a Stokes-like operator based approach [1.3999481573773072]
  Detection of entanglement in quantum states is one of the most important problems in quantum information processing. We present an interferometric scheme to test the same separability criterion in which the measurements are being done via Stokes-like operators.
  arXiv  Detail & Related papers  (2021-03-24T04:54:35Z)
• Efficient Verification of Anticoncentrated Quantum States [0.38073142980733]
  I present a novel method for estimating the fidelity $F(mu,tau)$ between a preparable quantum state $mu$ and a classically specified target state $tau$. I also present a more sophisticated version of the method, which uses any efficiently preparable and well-characterized quantum state as an importance sampler.
  arXiv  Detail & Related papers  (2020-12-15T18:01:11Z)

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.