JFJunyu Fan
Junyu Fan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Junyu Fan has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Alexander Jahn
Department of Physics, Freie Universität Berlin, 14195 Berlin, Germany
1 shared publication - David Elkouss
Okinawa Institute of Science and Technology
1 shared publication - Matthew Steinberg
Quantum Computing Division, QuTech, Delft University of Technology, Delft, the Netherlands
1 shared publication - Robert J. Harris
ARC Centre for Engineered Quantum Systems, School of Mathematics and Physics, The University of Queensland, St Lucia, QLD, 4072, Australia
1 shared publication - Sebastian Feld
Delft University of Technology
1 shared publication
Latest Publications
- Open Access
- 8 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1826
Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic geometry with even , yielding an infinitely large class of subsystem codes. We construct an example for a manifold and describe strategies of logical gauge fixing that lead to different rates and distances , which we calculate analytically, finding distances which range from to . Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with , finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.- 8 August 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1826
Open AccessFar from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed with Hadamard gates, placed on a hyperbolic geometry with even , yielding an infinitely large class of subsystem codes. We construct an example for a manifold and describe strategies of logical gauge fixing that lead to different rates and distances , which we calculate analytically, finding distances which range from to . Investigating threshold performance under erasure, depolarizing, and pure Pauli noise channels, we find that the code exhibits a depolarizing noise threshold of about 19.1% in the code-capacity model and 50% for pure Pauli and erasure channels under suitable gauges. We also test a constant-rate version with , finding excellent error resilience (about 40%) under the erasure channel. Recovery rates for these and other settings are studied both under an optimal decoder as well as a more efficient but non-optimal greedy decoder. We also consider generalizations beyond the CSS tensor construction, compute error rates and thresholds for other hyperbolic geometries, and discuss the relationship to holographic bulk/boundary dualities. Our work indicates that Evenbly codes may show promise for practical quantum computing applications.