Fold-transversal surface code cultivation

• URL: http://arxiv.org/abs/2509.05212v1
• Date: Fri, 05 Sep 2025 16:14:46 GMT
• Title: Fold-transversal surface code cultivation
• Authors: Kaavya Sahay, Pei-Kai Tsai, Kathleen Chang, Qile Su, Thomas B. Smith, Shraddha Singh, Shruti Puri,
• Abstract summary: Magic state cultivation is a protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation.<n>We present a new cultivation scheme in which we measure the fold-transversal Hadamard of unrotated surface code.<n>We find that this approach achieves the lowest known spacetime overhead for magic state cultivation.
• Score: 0.5488290895559226
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Magic state cultivation is a state-of-the-art protocol to prepare ultra-high fidelity non-Clifford resource states for universal quantum computation. It offers a significant reduction in spacetime overhead compared to traditional magic state distillation techniques. Cultivation protocols involve measuring a transversal logical Clifford operator on an initial small-distance code and then rapidly growing to a larger-distance code. In this work, we present a new cultivation scheme in which we measure the fold-transversal Hadamard of the unrotated surface code, and leverage unitary techniques to grow within the surface code family. Using both stabilizer and state vector simulations we find that this approach achieves the lowest known spacetime overhead for magic state cultivation. Practical implementation of our protocol is best suited to architectures with non-local connectivity, showing the strength of architectures where such connectivity is readily available.

Related papers

• CoCo-Fed: A Unified Framework for Memory- and Communication-Efficient Federated Learning at the Wireless Edge [50.42067935605982]
  We propose a novel Compression and Combination-based Federated learning framework that unifies local memory efficiency and global communication reduction.<n>CoCo-Fed significantly outperforms state-of-the-art baselines in both memory and communication efficiency while maintaining robust convergence under non-IID settings.
  arXiv  Detail & Related papers  (2026-01-02T03:39:50Z)
• Efficient simulation of logical magic state preparation protocols [0.0]
  We introduce a method for simulating logical magic state preparation protocols under the standard circuit-level noise model.<n>We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements.
  arXiv  Detail & Related papers  (2025-12-29T19:00:05Z)
• Efficient magic state cultivation with lattice surgery [2.6945797019995363]
  Magic state distillation plays a crucial role in fault-tolerant quantum computation.<n>Traditional logical-level distillation offers significant overhead reduction by enabling direct implementation with physical gates.<n>Magic state cultivation is a state-of-the-art physical-level distillation protocol that is compatible with the square-grid connectivity.
  arXiv  Detail & Related papers  (2025-10-28T16:44:34Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Efficient Magic State Cultivation on the Surface Code [0.0]
  We introduce three new cultivation protocols, each yielding a different magic state.<n>We demonstrate that our protocol achieves state-of-the-art infidelities and acceptance rates for magic state generation.<n>In platforms such as cold atoms and trapped ions, where idle error rates are lower than two-qubit gate errors, we demonstrate that cultivation exhibits an even greater advantage.
  arXiv  Detail & Related papers  (2025-02-03T19:00:03Z)
• Error-mitigated initialization of surface codes with non-Pauli stabilizers [1.5688934168773208]
  We enhance the performance of the conventional surface code by incorporating non-Pauli stabilizers. We demonstrate the ability to entangle logical qubits in non-Pauli and Pauli bases via the lattice surgery technique.
  arXiv  Detail & Related papers  (2024-11-10T09:58:53Z)
• Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search [30.003470912691096]
  We introduce a new quantization method called RaBitQ that inherits the theoretical guarantees of RaBitQ and achieves optimality in terms of the trade-off between space and error bounds. Our method consistently outperforms the state-of-the-art baselines in both accuracy and efficiency when using the same amount of memory.
  arXiv  Detail & Related papers  (2024-09-16T01:06:23Z)
• LoCoDL: Communication-Efficient Distributed Learning with Local Training and Compression [56.01900711954956]
  We introduce LoCoDL, a communication-efficient algorithm that leverages the two popular and effective techniques of Local training, which reduces the communication frequency, and Compression, in which short bitstreams are sent instead of full-dimensional vectors of floats.<n>LoCoDL provably benefits from local training and compression and enjoys a doubly-accelerated communication complexity, with respect to the condition number of the functions and the model dimension, in the general heterogenous regime with strongly convex functions.
  arXiv  Detail & Related papers  (2024-03-07T09:22:50Z)
• Scalable Multi-agent Covering Option Discovery based on Kronecker Graphs [49.71319907864573]
  In this paper, we propose multi-agent skill discovery which enables the ease of decomposition. Our key idea is to approximate the joint state space as a Kronecker graph, based on which we can directly estimate its Fiedler vector. Considering that directly computing the Laplacian spectrum is intractable for tasks with infinite-scale state spaces, we further propose a deep learning extension of our method.
  arXiv  Detail & Related papers  (2023-07-21T14:53:12Z)
• Constant Depth Code Deformations in the Parity Architecture [0.0]
  We present a protocol to encode and decode arbitrary quantum states in the parity architecture with constant circuit depth. We show that our method can reduce the depth of implementing the quantum Fourier transform by a factor of two when allowing measurements.
  arXiv  Detail & Related papers  (2023-03-15T13:15:26Z)
• 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)
• Quantum state tomography with tensor train cross approximation [84.59270977313619]
  We show that full quantum state tomography can be performed for such a state with a minimal number of measurement settings. Our method requires exponentially fewer state copies than the best known tomography method for unstructured states and local measurements.
  arXiv  Detail & Related papers  (2022-07-13T17:56:28Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)

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.