arXiv subjects

Minh T. P. Nguyen

Publications and source records attributed to Minh T. P. Nguyen.

5 recordsLinked to original sources

arXiv2026

Disassembling qLDPC codes for depth-optimal parity-check circuits

Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computing, but their practical implementation requires efficient circuits for syndrome extraction. Many qLDPC families are assembled from a small set of components through explicit operations that imprint edge symmetries on their Tanner graphs. We show that disassembling the code by quotienting its symmetries one at a time, reduces parity-check circuit design to a much smaller problem acting only on the underlying components. Solutions to the reduced problem can then be lifted to the full code, yielding circuit constructions that apply to entire families of codes built from the same components. For lifted-product codes, our approach provides an optimal analytical construction for parity-check circuits achieving the lower bound on CNOT depth. We obtain analogous constructions for balanced-product codes and quantum--classical homological product codes. For quantum Tanner codes, the reduced problem is small enough to solve numerically, reaching the CNOT-depth lower bound for nearly all instance tested, including codes with up to 576 data qubits.

quant-ph↗

arXiv2026

Fault-Tolerant Non-Clifford GKP Gates using Polynomial Phase Gates and On-Demand Noise Biasing

The Gottesman-Kitaev-Preskill (GKP) error correcting code uses a bosonic mode to encode a logical qubit, and has the attractive property that its logical Clifford gates can be implemented using Gaussian unitary gates. In contrast, a direct unitary implementation of the ${T}$ gate using the cubic phase gate has been shown to have logical error floor unless the GKP codestate has a biased noise profile [1]. In this work, we propose a method for on-demand noise biasing based on a standard GKP error correction circuit. This on-demand biasing circuit can be used to bias the GKP codestate before a $T$ gate and return it to a non-biased state afterwards. With the on-demand biasing circuit, we prove that the logical error rate of the $T$ gate can be made arbitrarily small as the quality of the GKP codestates increases. We complement our proof with a numerical investigation of the cubic phase gate subject to a phenomenological noise model, showing that the ${T}$ gate can achieve average gate fidelities above $99\%$ with 12 dB of GKP squeezing without the use of postselection. Moreover, we develop a formalism for finding optimal unitary representations of logical diagonal gates in higher levels of the Clifford hierarchy that is based on a framework of ``polynomial phase stabilizers'' whose exponents are polynomial functions of one of the quadrature operators. This formalism naturally extends to multi-qubit logical gates and even to number-phase bosonic codes, providing a powerful algebraic tool for analyzing non-Clifford gates in bosonic quantum codes. [1] J. Hastrup, M. V. Larsen, J. S. Neergaard-Nielsen, N. C. Menicucci, and U. L. Andersen, Phys. Rev. A 103, 032409 (2021)

quant-ph↗

arXiv2026

Color it, Code it, Cancel it: k-local dynamical decoupling from classical additive codes

Dynamical decoupling is a central technique in quantum computing for actively suppressing decoherence and systematic imperfections through sequences of single-qubit operations. Conventional sequences typically aim to completely freeze system dynamics, often resulting in long protocols whose length scales exponentially with system size. In this work, we introduce a general framework for constructing time-optimal, selectively-tailored sequences that remove only specific local interactions. By combining techniques from graph coloring and classical coding theory, our approach enables compact and hardware-tailored sequences across diverse qubit platforms, efficiently canceling undesired Hamiltonian terms while preserving target interactions. This opens up broad applications in quantum computing and simulation. At the core of our method is a mapping between dynamical decoupling sequence design and error-detecting codes, which allows us to leverage powerful coding-theoretic tools to construct customized sequences. To overcome exponential overheads, we exploit symmetries in colored interaction hypergraphs, extending graph-coloring strategies to arbitrary many-body Hamiltonians. We demonstrate the effectiveness of our framework through concrete examples, including compact sequences that suppress residual ZZ and ZZZ interactions in superconducting qubits and Heisenberg exchange coupling in spin qubits. We also show how it enables Hamiltonian engineering by simulating the anisotropic Kitaev honeycomb model using only isotropic Heisenberg interactions.

quant-ph↗

arXiv2025

Many-body interferometry with semiconductor spins

Quantum simulators enable studies of many-body phenomena which are intractable with classical hardware. Spins in devices based on semiconductor quantum dots promise precise electrical control and scalability advantages, but accessing many-body phenomena has so far been restricted by challenges in nanofabrication and simultaneous control of multiple interactions. Here, we perform spectroscopy of up to eight interacting spins using a 2x4 array of gate-defined germanium quantum dots. The spectroscopy protocol is based on Ramsey interferometry and adiabatic mapping of many-body eigenstates to single-spin eigenstates, enabling a complete energy spectrum reconstruction. As the interaction strength exceeds magnetic disorder, we observe signatures of the crossover from localization to a chaotic phase marking a step towards the observation of many-body phenomena in quantum dot systems.

cond-mat.mes-hall↗

arXiv2025

Single-step high-fidelity three-qubit gates by anisotropic chiral interactions

Direct multi-qubit gates are becoming critical to facilitate quantum computations in near-term devices by reducing the gate counts and circuit depth. Here, we demonstrate that fast and high fidelity three-qubit gates can be realized in a single step by leveraging small anisotropic and chiral three-qubit interactions. These ingredients naturally arise in state-of-the-art spin-based quantum hardware through a combination of spin-orbit interactions and orbital magnetic fields. These interactions resolve the key synchronization issues inherent in protocols relying solely on two-qubit couplings, which significantly limit gate fidelity. We confirm with numerical simulations that our single-step three-qubit gate can outperform existing protocols, potentially achieving infidelity $\leq 10^{-4}$ in 80-100 ns under current experimental conditions. To further benchmark its performance, we also propose an alternative composite three-qubit gate sequence based on anisotropic two-qubit interactions with built-in echo sequence and show that the single-step protocol can outperform it, making it highly suitable for near-term quantum processors.

cond-mat.mes-hall↗