001     1038557
005     20250131215342.0
024 7 _ |a arXiv:2407.08566
|2 arXiv
037 _ _ |a FZJ-2025-01540
088 _ _ |a arXiv:2407.08566
|2 arXiv
100 1 _ |a de la Fuente, Julio C. Magdalena
|0 P:(DE-HGF)0
|b 0
245 _ _ |a The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
260 _ _ |c 2025
336 7 _ |a Preprint
|b preprint
|m preprint
|0 PUB:(DE-HGF)25
|s 1738315709_12723
|2 PUB:(DE-HGF)
336 7 _ |a WORKING_PAPER
|2 ORCID
336 7 _ |a Electronic Article
|0 28
|2 EndNote
336 7 _ |a preprint
|2 DRIVER
336 7 _ |a ARTICLE
|2 BibTeX
336 7 _ |a Output Types/Working Paper
|2 DataCite
500 _ _ |a 59 pages, 26 figures
520 _ _ |a Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ ruby codes. Based on the projective symmetries of the building blocks of the tensor network we develop a framework of Pauli flows. Pauli flows allow for a graphical understanding of all quantities entering an error correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement- and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z3 automorphism to the logical Pauli group every three timesteps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of 0.18%, comparable with other Floquet codes and 2+1d color codes.
536 _ _ |a 5221 - Advanced Solid-State Qubits and Qubit Systems (POF4-522)
|0 G:(DE-HGF)POF4-5221
|c POF4-522
|f POF IV
|x 0
588 _ _ |a Dataset connected to arXivarXiv
700 1 _ |a Old, Josias
|0 P:(DE-Juel1)192118
|b 1
|u fzj
700 1 _ |a Townsend-Teague, Alex
|0 P:(DE-HGF)0
|b 2
700 1 _ |a Rispler, Manuel
|0 P:(DE-Juel1)187504
|b 3
|u fzj
700 1 _ |a Eisert, Jens
|0 P:(DE-HGF)0
|b 4
700 1 _ |a Müller, Markus
|0 P:(DE-Juel1)204218
|b 5
|e Corresponding author
|u fzj
909 C O |o oai:juser.fz-juelich.de:1038557
|p VDB
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 1
|6 P:(DE-Juel1)192118
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 3
|6 P:(DE-Juel1)187504
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 5
|6 P:(DE-Juel1)204218
913 1 _ |a DE-HGF
|b Key Technologies
|l Natural, Artificial and Cognitive Information Processing
|1 G:(DE-HGF)POF4-520
|0 G:(DE-HGF)POF4-522
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Quantum Computing
|9 G:(DE-HGF)POF4-5221
|x 0
914 1 _ |y 2025
920 _ _ |l yes
920 1 _ |0 I:(DE-Juel1)PGI-2-20110106
|k PGI-2
|l Theoretische Nanoelektronik
|x 0
980 _ _ |a preprint
980 _ _ |a VDB
980 _ _ |a I:(DE-Juel1)PGI-2-20110106
980 _ _ |a UNRESTRICTED


LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21