52 citations · 87 across the 13 of their papers we have counts for
15 papers
Efficient Logic with Ultra-High-Rate Quantum Codes
Nishad Maskara, Rohan Mehta, Zhiyang He +4
Quantum low-density parity-check (qLDPC) codes offer a promising route to reducing the qubit overhead of fault tolerance, with recent ultra-high-rate constructions achieving encodi…
Full Extractors for Logical Processing in Hypergraph Product Codes
John Blue, Zhiyang He, Hengyun Zhou +1
Quantum low-density parity-check (QLDPC) codes are promising candidates for practical low-overhead quantum memories. For large-scale fault-tolerant quantum computation, we further…
Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes
John Blue, Harshil Avlani, Zhiyang He +2
Fault-tolerant quantum computers will depend crucially on the performance of the classical decoding algorithm which takes in the results of measurements and outputs corrections to…
Extractors: QLDPC Architectures for Efficient Pauli-Based Computation
Zhiyang He, Alexander Cowtan, Dominic J. Williamson +1
In pursuit of large-scale fault-tolerant quantum computation, quantum low-density parity-check (LDPC) codes have been established as promising candidates for low-overhead memory wh…
Parallel Logical Measurements via Quantum Code Surgery
Alexander Cowtan, Zhiyang He, Dominic J. Williamson +1
Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes, which generalises lattice surgery. In this work…
Quantum Codes with Addressable and Transversal Non-Clifford Gates
Zhiyang He, Vinod Vaikuntanathan, Adam Wills +1
The development of quantum codes with good error correction parameters and useful sets of transversal gates is a problem of major interest in quantum error-correction. Abundant pri…
Experimental Demonstration of Logical Magic State Distillation
Pedro Sales Rodriguez, John M. Robinson, Paul Niklas Jepsen +70
Realizing universal fault-tolerant quantum computation is a key goal in quantum information science. By encoding quantum information into logical qubits utilizing quantum error cor…
Permutation gates in the third level of the Clifford hierarchy
Zhiyang He, Luke Robitaille, Xinyu Tan
The Clifford hierarchy is a fundamental structure in quantum computation, classifying unitary operators based on their commutation relations with the Pauli group. Despite its signi…
Improved QLDPC Surgery: Logical Measurements and Bridging Codes
Andrew W. Cross, Zhiyang He, Patrick J. Rall +1
In this paper, we introduce the gauge-fixed QLDPC surgery scheme, an improved logical measurement scheme based on the construction of Cohen et al. (Sci. Adv. 8, eabn1717). Our sche…
Single-shot decoding of good quantum LDPC codes
Shouzhen Gu, Eugene Tang, Libor Caha +3
Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article,…
Quantum Locally Testable Code with Constant Soundness
Andrew Cross, Zhiyang He, Anand Natarajan +2
In this paper, we present two constructions of quantum locally testable codes (QLTC) with constant soundness. In the first approach, we introduce an operation called check product,…
Uncertainty Quantification for Gradient and Accelerated Gradient Descent Methods on Strongly Convex Functions
Conor McMeel, Panos Parpas
We consider the problem of minimizing a strongly convex function that depends on an uncertain parameter . The uncertainty in the objective function means that the optimum, $x^*(…
Near-linear-time, Optimal Vertex Cut Sparsifiers in Directed Acyclic Graphs
Zhiyang He, Jason Li, Magnus Wahlström
Let be a graph and be (possibly overlapping) sets of terminals, . We are interested in computing a vertex sparsifier for terminal cuts in ,…
New Upper Bound on Extremal Number of Even Cycles
Zhiyang He
In this paper, we prove . We improved on Bukh--Jiang's method used in their 2017 publication, thereby redu…
Hypergraphs with few Berge paths of fixed length between vertices
Zhiyang He, Michael Tait
In this paper we study the maximum number of hyperedges which may be in an -uniform hypergraph under the restriction that no pair of vertices has more than Berge paths of le…