Search for: All records

Quantum error correction is necessary to perform large-scale quantum computation but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical s between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing $k$-qubit Greenberger-Horne-Zeilinger states and distilling or teleporting $k$magic states with $O\left(1\right)$space overhead in $O\left(1\right)$and $O\left(\sqrt{k}\log k\right)$logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads. Published by the American Physical Society2025 

Bosonic pure-loss channel, which represents the process of photons decaying into a vacuum environment, has zero quantum capacity when the channel’s transmissivity is less than 50%. Modeled as a beam splitter interaction between the system and its environment, the performance of bosonic pure-loss channel can be enhanced by controlling the environment state. We show that by choosing the ideal Gottesman-Kitaev-Preskill (GKP) states for the system and its environment, perfect transmission of quantum information through a beam splitter is achievable at arbitrarily low transmissivities. Our explicit constructions allow for experimental demonstration of the improved performance of a quantum channel through passive environment assistance, which is potentially useful for quantum transduction where the environment state can be naturally controlled. In practice, it is crucial to consider finite-energy constraints, and high-fidelity quantum communication through a beam splitter remains achievable with GKP states at the few-photon level. 

Charge distribution offers a unique fingerprint of important properties of electronic systems, including dielectric response, charge ordering, and charge fractionalization. We develop an architecture for charge sensing in two-dimensional electronic systems in a strong magnetic field. We probe local change of the chemical potential in a proximitized detector layer using scanning tunneling microscopy, allowing us to infer the chemical potential and the charge profile in the sample. Our technique has both high energy (<0.3 meV) and spatial (<10 nm) resolution exceeding that of previous studies by an order of magnitude. We apply our technique to study the chemical potential of quantum Hall liquids in monolayer graphene under high magnetic fields and their responses to charge impurities. The chemical potential measurement provides a local probe of the thermodynamic gap of quantum Hall ferromagnets and fractional quantum Hall states. The screening charge profile reveals spatially oscillatory response of the quantum Hall liquids to charge impurities and is consistent with the composite Fermi liquid picture close to the half-filling. Our technique also paves the way to map moiré potentials, probe Wigner crystals, and investigate fractional charges in quantum Hall and Chern insulators. 

Midcircuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing MCMs, a systematic method for characterizing noisy MCMs is still under exploration. In this work, we develop a cycle benchmarking (CB)-type algorithm to characterize noisy MCMs. The key idea is to use a joint Fourier transform on the classical and quantum registers and then estimate parameters in the Fourier space, analogous to Pauli fidelities used in CB-type algorithms for characterizing the Pauli-noise channel of Clifford gates. Furthermore, we develop a theory of the noise learnability of MCMs, which determines what information can be learned about the noise model (in the presence of state preparation and terminating measurement noise) and what cannot, which shows that all learnable information can be learned using our algorithm. As an application, we show how to use the learned information to test the independence between measurement noise and state-preparation noise in an MCM. Finally, we conduct numerical simulations to illustrate the practical applicability of the algorithm. Similar to other CB-type algorithms, we expect the algorithm to provide a useful toolkit that is of experimental interest. Published by the American Physical Society2025