Scalable and fault-tolerant preparation of encoded k-uniform states

• URL: http://arxiv.org/abs/2503.14506v1
• Date: Tue, 18 Mar 2025 17:59:59 GMT
• Title: Scalable and fault-tolerant preparation of encoded k-uniform states
• Authors: Shayan Majidy, Dominik Hangleiter, Michael J. Gullans,
• Abstract summary: We present a scalable, fault-tolerant method for preparing encoded $k$-uniform states.<n>We show that this hybrid approach can outperform fully physical implementations for resource-state preparation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: $k$-uniform states are valuable resources in quantum information, enabling tasks such as teleportation, error correction, and accelerated quantum simulations. The practical realization of $k$-uniform states, at scale, faces major obstacles: verifying $k$-uniformity is as difficult as measuring code distances, and devising fault-tolerant preparation protocols further adds to the complexity. To address these challenges, we present a scalable, fault-tolerant method for preparing encoded $k$-uniform states, and we illustrate our approach using surface and color codes. We first present a technique to determine $k$-uniformity of stabilizer states directly from their stabilizer tableau. We then identify a family of Clifford circuits that ensures both fault tolerance and scalability in preparing these states. Building on the encoded $k$-uniform states, we introduce a hybrid physical-logical strategy that retains some of the error-protection benefits of logical qubits while lowering the overhead for implementing arbitrary gates compared to fully logical algorithms. We show that this hybrid approach can outperform fully physical implementations for resource-state preparation, as demonstrated by explicit constructions of $k$-uniform states.

Related papers

• Efficient construction of fault-tolerant neutral-atom cluster states [0.0]
  We propose a protocol to generate and merge high-fidelity many-atom entangled states into a 3D cluster state.<n>Our simulations indicate that a state-of-the-art high-finesse optical cavity is sufficient for constructing a scalable fault-tolerant cluster state.
  arXiv  Detail & Related papers  (2025-07-26T16:55:52Z)
• Approximate k-uniform states: definition, construction and applications [14.192223215198837]
  We study approximate $k$-uniform states, demonstrating that they are locally indistinguishable from their exact counterparts unless massive measurements are performed.<n>We prove that such states can be constructed with high probability from the Haar-random ensemble and, more efficiently, via shallow random quantum circuits.<n>Our work lays the foundation for the practical application of $k$-uniform states.
  arXiv  Detail & Related papers  (2025-07-25T07:11:57Z)
• Efficient benchmarking of logical magic state [8.565601028339385]
  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.
  arXiv  Detail & Related papers  (2025-05-14T18:00:04Z)
• Investigating Pure State Uniqueness in Tomography via Optimization [4.396311564396993]
  Quantum state (QST) is crucial for understanding and characterizing quantum systems through measurement data.<n>Traditional QST methods face scalability challenges, requiring $mathcalO(d2) measurements for a generaldimensionald state.<n>We develop a unified framework based on the Augmented Lagrangian Method (ALM) to address these issues.
  arXiv  Detail & Related papers  (2024-12-31T07:57:03Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Quantum subspace verification for error correction codes [13.856955493134908]
  We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets. For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced. By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
  arXiv  Detail & Related papers  (2024-10-16T13:28:33Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Transversal Injection: Using the Surface Code to Prepare Non-Pauli Eigenstates [37.94431794242543]
  Quantum Error Correction (QEC) allows us to use systems with a large number of physical qubits and a favourable logical error rate. Transversal Injection is a new method of preparing logical non-Pauliigen estates that can be used as resource states for quantum computation.
  arXiv  Detail & Related papers  (2023-12-27T03:32:03Z)
• Efficient State Preparation for Metrology and Quantum Error Correction with Global Control [0.0]
  We introduce a simple, experimentally realizable protocol that can prepare any specific superposition of permutationally invariant qubit states, also known as Dicke states. We demonstrate the utility of our protocol by numerically preparing several states with theoretical infidelities $1-mathcalF10-4$. We estimate that the protocol achieves fidelities $gtrsim 95%$ in the presence of typical experimental noise levels.
  arXiv  Detail & Related papers  (2023-12-08T14:28:34Z)
• An Exponential Reduction in Training Data Sizes for Machine Learning Derived Entanglement Witnesses [45.17332714965704]
  We propose a support vector machine (SVM) based approach for generating an entanglement witness. For $N$ qubits, the SVM portion of this approach requires only $O(6N)$ training states, whereas an existing method needs $O(24N)$.
  arXiv  Detail & Related papers  (2023-11-30T00:45:04Z)
• Mitigating Temporal Fragility in the XY Surface Code [3.4746204759424715]
  We propose a new logical state preparation protocol based on locally entangling qubits into small Greenberger-Horne-Zeilinger-like states. We prove that in this new procedure $O(sqrtn)$ high-rate errors along a single lattice boundary can cause a logical failure.
  arXiv  Detail & Related papers  (2023-10-26T18:00:02Z)
• Fidelity-based distance bounds for $N$-qubit approximate quantum error correction [0.0]
  Eastin-Knill theorem states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. It is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. We address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost.
  arXiv  Detail & Related papers  (2022-12-08T16:10:58Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

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.