Options
Prabha Mandayam
Loading...
Preferred name
Prabha Mandayam
Official Name
Prabha Mandayam
Alternative Name
Mandayam, Prabha
Mandayam, P.
Main Affiliation
Email
ORCID
Scopus Author ID
Google Scholar ID
4 results
Now showing 1 - 4 of 4
- PublicationQuantum Error Correction: Noise-Adapted Techniques and Applications(01-04-2023)
;Jayashankar, AkshayaThe quantum computing devices of today have tens to hundreds of qubits that are highly susceptible to noise due to unwanted interactions with their environment. The theory of quantum error correction provides a scheme by which the effects of such noise on quantum states can be mitigated, paving the way for realising robust, scalable quantum computers. In this article we survey the current landscape of quantum error correcting (QEC) codes, focusing on recent theoretical advances in the domain of noise-adapted QEC, and highlighting some key open questions. We also discuss the interesting connections that have emerged between such adaptive QEC techniques and fundamental physics, especially in the areas of many-body physics and cosmology. We conclude with a brief review of the theory of quantum fault tolerance which gives a quantitative estimate of the physical noise threshold below which error-resilient quantum computation is possible. - PublicationAchieving fault tolerance against amplitude-damping noise(01-06-2022)
;Jayashankar, Akshaya ;Long, My Duy Hoang ;Ng, Hui KhoonWith 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 paper, 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 paper 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. - PublicationPretty good state transfer via adaptive quantum error correction(07-11-2018)
;Jayashankar, AkshayaWe examine the role of quantum error correction (QEC) in achieving pretty good quantum state transfer over a class of one-dimensional spin Hamiltonians. Recasting the problem of state transfer as one of information transmission over an underlying quantum channel, we identify an adaptive QEC protocol that achieves pretty good state transfer. Using an adaptive recovery and approximate QEC code, we obtain explicit analytical and numerical results for the fidelity of transfer over ideal and disordered one-dimensional Heisenberg chains. In the case of a disordered chain, we study the distribution of the transition amplitude, which in turn quantifies the stochastic noise in the underlying quantum channel. Our analysis helps us to suitably modify the QEC protocol so as to ensure pretty good state transfer for small disorder strengths and indicates a threshold beyond which QEC does not help in improving the fidelity of state transfer. - PublicationFinding good quantum codes using the Cartan form(01-04-2020)
;Jayashankar, Akshaya ;Babu, Anjala M. ;Ng, Hui KhoonWe present a simple and fast numerical procedure to search for good quantum codes for storing logical qubits in the presence of independent per-qubit noise. In a key departure from past work, we use the worst-case fidelity as the figure of merit for quantifying code performance, a much better indicator of code quality than, say, entanglement fidelity. Yet our algorithm does not suffer from inefficiencies usually associated with the use of worst-case fidelity. Specifically, using a near-optimal recovery map, we are able to reduce the triple numerical optimization needed for the search to a single optimization over the encoding map. We can further reduce the search space by using the Cartan decomposition, focusing our search over the nonlocal degrees of freedom resilient against independent per-qubit noise, while not suffering much in code performance.