arXiv subjects

Debjyoti Biswas

Publications and source records attributed to Debjyoti Biswas.

6 recordsLinked to original sources

arXiv2026

Bias-Preserving Gates and Quantum Error Correction With Dual-Rail Cat Codes

Scalable fault-tolerant quantum computation requires quantum error-correcting codes that simultaneously support universal logical operations, suppress hardware-specific noise, and enable efficient handling of photon-loss errors. Bosonic encodings such as the dual-rail and cat codes each offer attractive features but also exhibit important limitations when used in isolation. The dual-rail code enables efficient single-photon-loss detection by converting leakage out of the computational subspace induced by photon-loss errors into an erasure error. In contrast, the cat code provides a resource-efficient, bias-tailored error-correction scheme with bias-preserving logical gate operations. Here, we introduce the dual-rail cat code (DRCC), a concatenated bosonic encoding that combines an inner cat code with an outer dual-rail structure, thereby inheriting and enhancing the advantages of both constituent codes. We analyse the error-correction properties of the DRCC and propose a deterministic single-photon-loss correction protocol by concatenating it with an outer repetition code. Exploiting the code's intrinsic noise bias, we construct a universal set of logical gates using only beam-splitter interactions and demonstrate that all logical operations preserve the erasure-biased noise structure. The DRCC offers several distinctive advantages, including the absence of relative geometric phases during gate operations, deterministic erasure detection and correction, and simultaneous syndrome extraction without interrupting stabilisation. These features make the DRCC a promising bosonic code for hardware-efficient, bias-preserving, and erasure-resilient fault-tolerant quantum computation.

quant-ph↗

arXiv2025

Universal syndrome-based recovery for noise-adapted quantum error correction

Quantum error correction (QEC) is an essential tool for quantum computing that enables reliable information processing in the presence of noise. Syndrome measurements play a central role in QEC, making it possible to unambiguously identify the location and type of errors. While syndrome extraction is natural for conventional QEC protocols, where the errors satisfy certain algebraic constraints \emph{perfectly}, this feature is largely missing in the framework of approximate or noise-adapted QEC. Rather, noise-adapted recovery maps like the Petz map are used in the latter scenario, but implementing such tailored recovery processes on the hardware can be quite challenging. Here, we address this issue by proposing an algorithmic approach to identifying error syndromes for arbitrary codes and noise processes. We then use our algorithm to develop a variant of the Petz recovery map -- a syndrome-based Petz recovery map -- which can then be implemented via syndrome measurements. We demonstrate the efficacy of our approach in the context of amplitude-damping noise, by constructing the syndrome-based Petz map for the $4$-qubit code. We execute our recovery circuits on IBM quantum hardware to successfully demonstrate break-even performance of a noise-adapted QEC protocol with upto a threefold improvement of the qubit $T_{1}$ times.

quant-ph↗

arXiv2025

Noise-adapted qudit codes for amplitude-damping noise

Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a $[4,1]$ qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $γ$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $\mathcal{O}(γ^{2})$. For the $d=2$ case, our QEC scheme is identical to the known example of the $4$-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of $[2M+2, M]$ qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.

quant-ph↗

arXiv2024

Noise-adapted Quantum Error Correction for Non-Markovian Noise

We consider the problem of quantum error correction (QEC) for non-Markovian noise. Using the well known Petz recovery map, we first show that conditions for approximate QEC can be easily generalized for the case of non-Markovian noise, in the strong coupling regime where the noise map becomes non-completely-positive at intermediate times. While certain approximate QEC schemes are ineffective against quantum non-Markovian noise, in the sense that the fidelity vanishes in finite time, the Petz map adapted to non-Markovian noise uniquely safeguards the code space even at the maximum noise limit. Focusing on the case of non-Markovian amplitude damping noise, we further show that the non-Markovian Petz map also outperforms the standard, stabilizer-based QEC code. Since implementing such a non-Markovian map poses practical challenges, we also construct a Markovian Petz map that achieves similar performance, with only a slight compromise on the fidelity.

quant-ph↗

arXiv2024

Noise-adapted recovery circuits for quantum error correction

Implementing quantum error correction (QEC) protocols is a challenging task in today's era of noisy intermediate-scale quantum devices. We present quantum circuits for a universal, noise-adapted recovery map, often referred to as the Petz map, which is known to achieve close-to-optimal fidelity for arbitrary codes and noise channels. While two of our circuit constructions draw upon algebraic techniques such as isometric extension and block encoding, the third approach breaks down the recovery map into a sequence of two-outcome POVMs. In each of the three cases we improve upon the resource requirements that currently exist in the literature. Apart from Petz recovery circuits, we also present circuits that can directly estimate the fidelity between the encoded state and the recovered state. As a concrete example of our circuit constructions, we implement Petz recovery circuits corresponding to the $4$-qubit QEC code tailored to protect against amplitude-damping noise. The efficacy of our noise-adapted recovery circuits is then demonstrated through ideal and noisy simulations.

quant-ph↗

arXiv2023

Where are the photons in a transmission-line pulse?

We develop a photonic description of short, one-dimensional electromagnetic pulses, specifically in the language of electrical transmission lines. Current practice in quantum technology, using arbitrary waveform generators, can readily produce very short, few-cycle pulses in microwave TEM guided structures (coaxial cables or coplanar waveguides) in a very low noise, low temperature setting. We argue that these systems attain the limit of producing pure coherent quantum states, in which the vacuum has been displaced for a short time, and therefore short spatial extent. When the pulse is bipolar, that is, the integrated voltage of the pulse is zero, then the state can be described by the finite displacement of a single mode. Therefore there is a definite mean number of photons, but which have neither a well defined frequency nor position. Due to the Paley-Wiener theorem, the two-component photon 'wavefunction' of this mode is not strictly bounded in space even if the vacuum displacement that defines it is bounded. This wavefunction's components are, for the case of pulses moving in a specific direction, complex valued, with the real and imaginary parts related by a Hilbert transform. They are thus akin to the 'analytic signals' of communication theory. When the pulse is unipolar no photonic description is possible -- the photon number can be considered to be divergent. We consider properties that photon counters and quantum non-demolition detectors must have to optimally convert and detect the photons in several example pulses, and we discuss some consequence of this optimization for the application of very short pulses in quantum cryptography.

quant-ph↗