arXiv subjects

Hui Khoon Ng

Publications and source records attributed to Hui Khoon Ng.

At least 19 recordsLinked to original sources

arXiv2026

Single-tone drive-enhanced CROT gate for bosonic quantum error correction

Bosonic error correction provides a hardware-efficient route to protected qubits for accurate quantum information processing. A critical component for error correction of rotation-symmetric bosonic (RSB) codes, like the well-known cat codes, is the two-mode controlled-rotation (CROT) operation. The CROT gate is useful because of its code-agnostic generality and its error-propagation properties. While the CROT gate can in principle be composed from existing bosonic physical primitives, the desirable properties are typically lost when composed as a sequence of imperfect primitive operations. Past work has focused on direct implementations that rely on features of specific codes. Here, we present a direct route to CROT within the circuit-QED architecture that retains its code-agnostic and error-propagation characteristics. By driving a transmon simultaneously coupled to two microwave cavities, we controllably enhance the effective nonlinearities between the microwave cavities and thus engineer the necessary two-mode interaction underlying the CROT gate. Using only a single drive frequency, we can achieve an on-off ratio sufficient for gate implementation, while minimizing mode distortions. We provide simple analytical formulas that permit the identification of potential working regimes, further refined by exact numerics, and illustrate the efficacy of our CROT approach in an error-correction example involving different RSB codes within the same circuit. Our CROT gate adds to the arsenal of direct two-mode gates available for general bosonic information processing.

quant-ph↗

arXiv2026

Towards fault-tolerance with universal phase-error-transparent gates for high-spin cat codes

High-dimensional nuclear spins offer a hardware-efficient route to quantum error correction (QEC), with the spin cat code providing intrinsic robustness against phase errors -- the dominant noise channel in donor-in-silicon architectures. However, realizing the full potential of this encoding requires gate operations that preserve its error-correcting properties. In this work, we construct a universal logical gate set that is error-transparent (ET) to phase errors, and discuss its practical implementations and challenges. The ET gates ensure that phase errors occurring stochastically during gate operations are propagated in a systematically traceable manner and remain correctable in a subsequent QEC step. Among the universal gate set constructed, we identify the logical $X$ gate as the primary challenge and discuss potential realization schemes. In addition, to fully leverage the spin cat code's advantage over an unencoded qubit, multi-tone microwave driving of the logical $CZ$ gate is essential. Our simulations show that ET gates significantly outperform non-ET gates and may be necessary to surpass the break-even point. We further show how logical measurement and recovery can be constructed from ET operations, and explain why state-preparation cannot be made ET. In particular, ET measurement in the computational basis is realizable via spin parity measurement, and that error correction circuits constructed from ET operations achieve optimal error correction capacity. Our work charts a concrete path toward full fault-tolerant quantum computation with high-dimensional nuclear spin systems.

quant-ph↗

arXiv2026

Hamiltonian Benchmark of a Solid-State Spin-Photon Interface for Computation

Light-matter interfaces are pivotal for quantum computation and communication. While typically analyzed using single-mode or open-quantum-system approximations, these models often neglect multi-mode field states and light-matter entanglement, hindering exact protocol modeling. Here, we solve the full Hamiltonian dynamics of a solid-state spin-photon interface for three key protocols: the generation of photon-number superpositions, a controlled photon-photon gate, and the production of photonic cluster states. By deriving exact fidelities, we identify fundamental performance limits. Our results reveal that while realistic imperfections severely limit photon-photon gates, they only slightly affect linear photonic clusters and are nearly harmless for photon-number state superpositions.

quant-ph↗

arXiv2026

Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes

Concatenated error-correction schemes are well-understood routes to fault-tolerant quantum computing, and research on such schemes continues, including recent claims that they may be competitive with surface codes, and show potential when combined with high-rate Quantum Low Density Parity Check codes. However, there are few tools to evaluate the qubit resources required by concatenated schemes. We propose such a tool here. Its equations are closed-form and remain simple for an arbitrary number of levels of concatenation, making it ideal for comparing and minimizing the resource costs of such schemes. We use this tool to evaluate the resources for gate operations that require the injection of so-called ``magic states'', needed to complete the set of logical operations. It was expected that the complexity of such ``magic operations" would make them dominate the resource costs of a calculation, with numerous works proposing optimizations of these cost. Our work reveals that this expectation is often inaccurate: Magic operations are rarely the dominant cost of concatenated schemes, mirroring similar conclusions from past work for surface codes. Optimizations affecting all operations naturally have more impact than those on magic operations alone, yet we unexpected find that the former can reduce qubit resources by a few orders of magnitude while the latter give only marginal reductions. We show this in detail for a 7-qubit concatenated scheme with Steane error-correction gadgets or flag-qubits gadgets, and argue that our findings are representative of most concatenated schemes.

quant-ph↗

arXiv2026

Simultaneous High-Fidelity Readout and Strong Coupling for a Donor-Based Spin Qubit

Superconducting resonators coupled to solid-state qubits offer a scalable architecture for long-range entangling operations and fast, high-fidelity readout. Realizing this requires low photon-loss rates and qubits with tunable electric dipole moments that couple strongly to the resonator's electric field while maintaining long coherence times. For spin qubits, spin-photon coupling is typically achieved via spin-charge hybridization. However, this introduces a fundamental trade-off: a large spin-charge admixture enhances the coupling strength, which boosts readout and resonator-mediated gate speeds, but exposes the qubit to increased decoherence, thereby increasing the threshold required for strong coupling and limiting the time available for accurate state measurement. This makes it essential to identify optimal operating points for each qubit platform. We address this for the donor-based flip-flop qubit, whose microwave-controllable electron-nuclear spin states make it suitable for coupling to microwave resonators. We demonstrate that, by choosing intermediate tunnel couplings that balance strong interaction with long qubit lifetimes, high-fidelity readout and strong coupling are simultaneously achievable. We also map out the respective charge-photon couplings and photon-loss rates required. Furthermore, we show that experimental constraints on charge-photon coupling and photon loss can be mitigated using squeezed input fields. As similar trade-offs appear in quantum-dot-based qubits, our methods and insights extend naturally to these platforms, offering a potential route toward scalable architectures.

cond-mat.mes-hall↗

arXiv2026

A direct controlled-phase gate between microwave photons

The rich dynamics and large Hilbert space of quantum harmonic oscillators make them natural candidates for hardware-efficient and error-correctable quantum information processing. However, implementing direct entangling operations between oscillators remains an outstanding challenge. Existing strategies typically rely on parametrically activating interactions that populate the excited states of a nonlinear element, which introduces additional dissipation channels and potential leakage from the encoded manifold. Here, we engineer a Raman-assisted cross-Kerr interaction between microwave photons hosted in two superconducting cavities. Crucially, this dynamics does not excite the mediating nonlinear coupler, thereby suppressing coupler induced decoherence and leakage out of the bosonic code space. We use this direct nonlinear coupling to implement a controlled-phase gate within the single- and two-photon subspaces of two oscillators, deterministically generating entanglement between them. Finally, we use these engineered dynamics to implement a photon-number parity check on a storage cavity via purely bosonic interactions with an ancillary cavity, demonstrating an enhancement in the storage lifetime. Our work provides a promising pathway toward engineering robust operations that act entirely within a protected bosonic code space and realizing fault-tolerant quantum information processing with bosonic elements.

quant-ph↗

arXiv2026

Simulating general noise nearly as cheaply as Pauli noise

Stabilizer simulation of Clifford quantum circuits - error-correction circuits, Clifford subroutines, etc. - on classical computers has played a central role in our understanding of circuit performance. The stabilizer description, however, restricts the accessible noise one can incorporate into the simulation to Pauli-type noise. More general noise, including coherent errors, may have more severe impact on circuit performance than Pauli noise; yet, such general noise have been difficult to access, much less investigate fully, in numerical simulations. Here, through the use of stratified importance sampling, we show how general noise can be simulated within the stabilizer formalism in reasonable time, with non-unitary noise being nearly as cheap as Pauli noise. Unitary (or coherent) noise can require an order of magnitude more time for the simulation, but nevertheless completes in very reasonable times, a drastic improvement over past approaches that typically fail to converge altogether. Our work thus enables detailed beyond-Pauli understanding of circuit performance in the presence of real device noise, which is rarely Pauli in nature. Among other examples, we present direct simulation results for the performance of the popular rotated planar surface codes under circuit-level general noise, previously available only in limited situations and/or through mappings to efficiently simulatable physical models.

quant-ph↗

arXiv2026

Sampling quantum states with inequality constraints

Random samples of quantum states with specific properties are useful for various applications, such as Monte Carlo integration over the state space. In the high-dimensional situations that one encounters already for a few qubits, the quantum state space has a very complicated boundary, and it is challenging to incorporate the specific properties into the sampling algorithm. In this paper, we present the Sequentially Constrained Monte Carlo (SCMC) algorithm as a powerful and versatile method for sampling quantum states in accordance with any desired properties that can be stated as inequalities. We apply the SCMC algorithm to the generation of samples of bound entangled states; for example, we obtain nearly ten thousand bound entangled two-qutrit states in a few minutes -- a colossal speed-up over independence sampling, which yields less than ten such states per day. In the second application, we draw samples of high-dimensional quantum states from a narrowly peaked target distribution and observe that SCMC sampling remains efficient as the dimension grows. In yet another application, the SCMC algorithm produces uniformly distributed quantum states in regions bounded by values of the problem-specific target distribution; such samples are needed when estimating parameters from the probabilistic data acquired in quantum experiments.

quant-ph↗

arXiv2026

Information-efficient decoding of surface codes

Surface codes are a popular error-correction route to fault-tolerant quantum computation. The so-called exponential backlog problem that can arise when one has to do logical $T$-gates within the surface code demands real-time decoding of the syndrome information to diagnose the appropriate Pauli frame in which to do the gate. This in turn puts a minimum requirement on the communication rate between the quantum processing unit, where the syndrome information is collected, and the classical processor, where the decoding algorithm is run. This minimum communication rate can be difficult to achieve while preserving the quality of the quantum processor. Here, we present two decoders that make use of a reduced syndrome information volume, relying on a number of syndrome bits that scale only as the width -- and not the usual area -- of the surface-code patch. This eases the communication requirements necessary for real-time decoding.

quant-ph↗

arXiv2025

High-fidelity regimes of resonator-mediated controlled-Z gates between quantum-dot qubits

Semiconductor double quantum dot (DQD) qubits coupled via superconducting microwave resonators provide a powerful means of long-range manipulation of the qubits' spin and charge degrees of freedom. Quantum gates can be implemented by parametrically driving the qubits while their transition frequencies are detuned from the resonator frequency. Long-range two-qubit controlled-Z (CZ) gates have been proposed for the DQD spin qubit within the rotating-wave approximation (RWA). Rapid gates demand strong coupling, but RWA breaks down when coupling strengths become significant relative to system frequencies. Therefore, understanding the errors arising from approximations used is critical for high-fidelity operation. Here, we go beyond RWA to study CZ gate fidelity for both DQD spin and charge qubits. We propose a novel parametric drive on the charge qubit that produces smaller errors and show that the fidelity of the CZ gate outperforms its spin counterpart, resulting in a much smaller fidelity loss of $0.05\%$ compared to $0.80\%$ for the spin qubit, and greater robustness against qubit dephasing and photon loss. We find that drive amplitude -- a parameter dropped in RWA -- is critical for optimizing fidelity, with the charge qubit exhibiting better tolerance to drive amplitude variations. Our results demonstrate the necessity of going beyond RWA in understanding how long-range gates can be realized in DQD qubits, with charge qubits offering considerable advantages in high-fidelity operation.

cond-mat.mes-hall↗

arXiv2025

Circuit-level fault tolerance of cat codes

Bosonic codes encode quantum information into a single infinite-dimensional physical system endowed with error correction capabilities. This reduces the need for complex management of many physical constituents compared with standard approaches employing multiple physical qubits. Recent discussions of bosonic codes centre around correcting only boson-loss errors, with phase errors either actively suppressed or deferred to subsequent layers of encoding with standard qubit codes. Rotationally symmetric bosonic (RSB) codes, which include the well-known cat and binomial codes, are capable of simultaneous correction of loss and phase errors, offering an alternate route that deals with arbitrary errors already at the base layer. Here, we investigate the robustness of such codes, moving away from the more idealistic past studies towards a circuit-level noise analysis closer to the practical situation where every physical component in the device is potentially faulty. We extend the concept of fault tolerance to the case of RSB codes, and then examine the performance of two known error correction circuits under circuit-level noise. Our analysis reveals a significantly more stringent noise threshold for fault-tolerant operation than found in past works; nevertheless, we show how, through waiting-time optimization and the use of squeezing, we can restore the noise requirements to a regime achievable with near-term quantum hardware. While our focus here is on cat codes for concreteness, a similar analysis applies for general RSB codes.

quant-ph↗

arXiv2025

Fault tolerance against amplitude-damping noise using Bacon-Shor codes

Designing efficient fault tolerance schemes is crucial for building useful quantum computers. Most standard schemes assume no knowledge of the underlying device noise and rely on general-purpose quantum error-correcting (QEC) codes capable of handling arbitrary errors. Biased-noise alternatives focus on only correcting a subset of some generic error basis (e.g., Pauli error basis), and lower resource needs by channeling the redundancy to dealing only with that subset. Yet, the most resource-efficient codes are expected to be those that directly target the specific noise process that afflicts the quantum device, rather than using a generic error-basis description. However, the question of whether such noise-adapted QEC protocols are amenable to fault-tolerant implementations remains largely unexplored. Here, we design a fault tolerance scheme based on the Bacon-Shor codes which can protect against amplitude-damping noise in the device. We construct a universal set of logical gadgets tolerant to multiple damping errors and estimate the fault tolerance threshold of our scheme. Our work thus establishes the possibility of achieving fault tolerance against amplitude-damping noise using noise-adapted quantum codes, while highlighting some of the unique challenges that arise in this context.

quant-ph↗

arXiv2024

Fault-tolerant embedding of quantum circuits on hardware architectures via swap gates

In near-term quantum computing devices, connectivity between qubits remain limited by architectural constraints. A computational circuit with given connectivity requirements necessary for multi-qubit gates have to be embedded within physical hardware with fixed connectivity. Long-distance gates have to be done by first routing the relevant qubits together. The simplest routing strategy involves the use of swap gates to swap the information carried by two unconnected qubits to connected ones. Ideal swap gates just permute the qubits; real swap gates, however, have the added possibilities of causing simultaneous errors on the qubits involved and spreading errors across the circuit. A general swap scheme thus changes the error-propagation properties of a circuit, including those necessary for fault-tolerant functioning of a circuit. Here, we present a simple strategy to design the swap scheme needed to embed an abstract circuit onto a physical hardware with constrained connectivity, in a manner that preserves the fault-tolerant properties of the abstract circuit. The embedded circuit will, of course, be noisier, compared to a native implementation of the abstract circuit, but we show in the examples of embedding surface codes on heavy-hexagonal and hexagonal lattices that the deterioration is not severe. This then offers a straightforward solution to implementing circuits with fault-tolerance properties on current hardware.

quant-ph↗

arXiv2024

High-Fidelity CZ Gates in Double Quantum Dot -- Circuit QED Systems Beyond the Rotating-Wave Approximation

Semiconductor double quantum dot (DQD) qubits coupled via superconducting microwave resonators provide a powerful means of long-range manipulation of the qubits' spin and charge degrees of freedom. Quantum gates can be implemented by parametrically driving the qubits while their transition frequencies are detuned from the resonator frequency. Long-range two-qubit CZ gates have been proposed for the DQD spin qubit within the rotating-wave approximation (RWA). Rapid gates demand strong coupling, but RWA breaks down when coupling strengths become significant relative to system frequencies. Therefore, understanding the detrimental impact of time-dependent terms ignored by RWA is critical for high-fidelity operation. Here, we go beyond RWA to study CZ gate fidelity for both DQD spin and charge qubits. We propose a novel parametric drive on the charge qubit that produces fewer time-dependent terms and show that it outperforms its spin counterpart. We find that drive amplitude - a parameter dropped in RWA - is critical for optimizing fidelity and map out high-fidelity regimes. Our results demonstrate the necessity of going beyond RWA in understanding how long-range gates can be realized in DQD qubits, with charge qubits offering considerable advantages in high-fidelity operation.

cond-mat.mes-hall↗

arXiv2023

Optimizing resource efficiencies for scalable full-stack quantum computers

In the race to build scalable quantum computers, minimizing the resource consumption of their full stack to achieve a target performance becomes crucial. It mandates a synergy of fundamental physics and engineering: the former for the microscopic aspects of computing performance, and the latter for the macroscopic resource consumption. For this we propose a holistic methodology dubbed Metric-Noise-Resource (MNR) able to quantify and optimize all aspects of the full-stack quantum computer, bringing together concepts from quantum physics (e.g., noise on the qubits), quantum information (e.g., computing architecture and type of error correction), and enabling technologies (e.g., cryogenics, control electronics, and wiring). This holistic approach allows us to define and study resource efficiencies as ratios between performance and resource cost. As a proof of concept, we use MNR to minimize the power consumption of a full-stack quantum computer, performing noisy or fault-tolerant computing with a target performance for the task of interest. Comparing this with a classical processor performing the same task, we identify a quantum energy advantage in regimes of parameters distinct from the commonly considered quantum computational advantage. This provides a previously overlooked practical argument for building quantum computers. While our illustration uses highly idealized parameters inspired by superconducting qubits with concatenated error correction, the methodology is universal -- it applies to other qubits and error-correcting codes -- and provides experimenters with guidelines to build energy-efficient quantum processors. In some regimes of high energy consumption, it can reduce this consumption by orders of magnitudes. Overall, our methodology lays the theoretical foundation for resource-efficient quantum technologies.

quant-ph↗

arXiv2023

Efficacy of noisy dynamical decoupling

Dynamical decoupling (DD) refers to a well-established family of methods for error mitigation, comprising pulse sequences aimed at averaging away slowly evolving noise in quantum systems. Here, we revisit the question of its efficacy in the presence of noisy pulses in scenarios important for quantum devices today: pulses with gate control errors, and the computational setting where DD is used to reduce noise in every computational gate. We focus on the well-known schemes of periodic (or universal) DD, and its extension, concatenated DD, for scaling up its power. The qualitative conclusions from our analysis of these two schemes nevertheless apply to other DD approaches. In the presence of noisy pulses, DD does not always mitigate errors. It does so only when the added noise from the imperfect DD pulses do not outweigh the increased ability in averaging away the original background noise. We present breakeven conditions that delineate when DD is useful, and further find that there is a limit in the performance of concatenated DD, specifically in how far one can concatenate the DD pulse sequences before the added noise no longer offers any further benefit in error mitigation.

quant-ph↗

arXiv2022

On the fault-tolerance threshold for surface codes with general noise

Fault-tolerant quantum computing based on surface codes has emerged as a popular route to large-scale quantum computers capable of accurate computation even in the presence of noise. Its popularity is, in part, because the fault-tolerance or accuracy threshold for surface codes is believed to be less stringent than competing schemes. This threshold is the noise level below which computational accuracy can be increased by increasing physical resources for noise removal, and is an important engineering target for realising quantum devices. The current conclusions about surface code thresholds are, however, drawn largely from studies of probabilistic noise. While a natural assumption, current devices experience noise beyond such a model, raising the question of whether conventional statements about the thresholds apply. Here, we attempt to extend past proof techniques to derive the fault-tolerance threshold for surface codes subjected to general noise with no particular structure. Surprisingly, we found no nontrivial threshold, i.e., there is no guarantee the surface code prescription works for general noise. While this is not a proof that the scheme fails, we argue that current proof techniques are likely unable to provide an answer. A genuinely new idea is needed, to reaffirm the feasibility of surface code quantum computing.

quant-ph↗

arXiv2022

Achieving fault tolerance against amplitude-damping noise

With the intense interest in small, noisy quantum computing devices comes the push for larger, more accurate -- and hence more useful -- quantum computers. While fully fault-tolerant quantum computers are, in principle, capable of achieving arbitrarily accurate calculations using devices subjected to general noise, they require immense resources far beyond our current reach. An intermediate step would be to construct quantum computers of limited accuracy enhanced by lower-level, and hence lower-cost, noise-removal techniques. This is the motivation for our work, which looks into fault-tolerant encoded quantum computation targeted at the dominant noise afflicting the quantum device. Specifically, we develop a protocol for fault-tolerant encoded quantum computing components in the presence of amplitude-damping noise, using a 4-qubit code and a recovery procedure tailored to such noise. We describe a universal set of fault-tolerant encoded gadgets and compute the pseudothreshold for the noise, below which our scheme leads to more accurate computation. Our work demonstrates the possibility of applying the ideas of quantum fault tolerance to targeted noise models, generalizing the recent pursuit of biased-noise fault tolerance beyond the usual Pauli noise models. We also illustrate how certain aspects of the standard fault tolerance intuition, largely acquired through Pauli-noise considerations, can fail in the face of more general noise.

quant-ph↗