Searcharxiv⌕ Search

arXiv subjects

Sagar Silva Pratapsi

Publications and source records attributed to Sagar Silva Pratapsi.

6 recordsLinked to original sources

Medical Imaging Classification with Cold-Atom Reservoir Computing using Auto-Encoders and Surrogate-Driven Training

We introduce a hybrid quantum-classical pipeline, based on neutral-atom reservoir computing, for medical image classification, focusing on the binary classification task of polyp detection. To deal effectively with the high dimensionality, we integrate a guided auto-encoder. This pipeline learns compact and discriminative representations of image data that are also well-suited for quantum reservoir computing. A key challenge in such systems is the non-differentiable nature of quantum measurements, which creates a 'gradient barrier' for standard training. We overcome this barrier by incorporating a differentiable surrogate model that emulates the quantum layer, enabling end-to-end backpropagation through the entire system. This guided training process is jointly optimized for classification accuracy and for faithful image recovery from the auto-encoder. The learned latent representations are encoded as pulse detuning parameters within a Rydberg Hamiltonian, and quantum embeddings are subsequently obtained through expectation values. These embeddings are then passed to a linear classifier. Our simulations show that this method outperforms some traditional approaches that use PCA or unguided autoencoders. We also conduct ablation studies to assess the impact of various quantum and training parameters, demonstrating the robustness and flexibility of our proposed pipeline for real-world medical imaging applications, even in the current NISQ era.

cs.LG↗

An Elementary Characterization of Bargmann Invariants

Bargmann invariants, also known as multivariate traces of quantum states $\operatorname{Tr}(ρ_1 ρ_2 \cdots ρ_n)$, are unitary invariant quantities used to characterize weak values, Kirkwood-Dirac quasiprobabilities, out-of-time-order correlators (OTOCs), and geometric phases. Here we give a complete characterization of the set $B_n$ of complex values that $n$-th order invariants can take, resolving some recently proposed conjectures. We show that $B_n$ is equal to the range of invariants arising from pure states described by Gram matrices of circulant form. We show that both ranges are equal to the $n$-th power of the complex unit $n$-gon, and are therefore convex, which provides a simple geometric intuition. Finally, we show that any Bargmann invariant of order $n$ is realizable using either qubit states, or circulant qutrit states.

quant-ph↗

Quantum speed limit for Kirkwood-Dirac quasiprobabilities

What is the minimal time until a quantum system can exhibit genuine quantum features? To answer this question we derive quantum speed limits for two-time correlation functions arising from statistics of measurements. Generally, these two-time correlators are described by quasiprobabilities, if the initial quantum state of the system does not commute with the measurement observables. Our quantum speed limits are derived from the Heisenberg-Robertson uncertainty relation, and set the minimal time at which a quasiprobability can become non-positive, which is evidence for the onset of non-classical traits in the system dynamics. As an illustrative example, we apply these results to a conditional quantum gate, by determining the optimal condition giving rise to non-classicality at maximum speed. Our analysis also hints at boosted power extraction in genuinely non-classical dynamics.

quant-ph↗

Classical Half-Adder using Trapped-ion Quantum Bits: Towards Energy-efficient Computation

Reversible computation has been proposed as a future paradigm for energy efficient computation, but so far few implementations have been realised in practice. Quantum circuits, running on quantum computers, are one construct known to be reversible. In this work, we provide a proof-of-principle of classical logical gates running on quantum technologies. In particular, we propose, and realise experimentally, Toffoli and Half-Adder circuits suitable for classical computation, using radiofrequency-controlled $^{171}$Yb$^+$ ions in a macroscopic linear Paul-trap as qubits. We analyse the energy required to operate the logic gates, both theoretically and experimentally, with a focus on the control energy. We identify bottlenecks and possible improvements in future platforms for energetically-efficient computation, e.g., trap chips with integrated antennas and cavity QED. Our experimentally verified energetic model also fills a gap in the literature of the energetics of quantum information, and outlines the path for its detailed study, as well as its potential applications to classical computing.

quant-ph↗

Competition of decoherence and quantum speed limits for quantum-gate fidelity in the Jaynes-Cummings model

Quantum computers are operated by external driving fields, such as lasers, microwaves or transmission lines, that execute logical operations on multi-qubit registers, leaving the system in a pure state. However, the drive and the logical system might become correlated in such a way that, after tracing out the degrees of freedom of the driving field, the output state will not be pure. Previous works have pointed out that the resulting error scales inversely with the energy of the drive, thus imposing a limit on the energy-efficiency of quantum computing. In this study, focusing on the Jaynes-Cummings model, we show how the same scaling can be seen as a consequence of two competing phenomena: the entanglement-induced error, which grows with time, and a minimal time for computation imposed by quantum speed limits. This evidence is made possible by quantifying, at any time, the computation error via the spectral radius associated to the density operator of the logical qubit. Moreover, we also prove that, in order to attain a given target state at a chosen fidelity, it is energetically more efficient to perform a single driven evolution of the logical qubits rather than to split the computation in sub-routines, each operated by a dedicated pulse.

quant-ph↗

Improving fidelity of multi-qubit gates using hardware-level pulse parallelization

Quantum computation holds the promise of solving computational problems which are believed to be classically intractable. However, in practice, quantum devices are still limited by their relatively short coherence times and imperfect circuit-hardware mapping. In this work, we present the parallelization of pre-calibrated pulses at the hardware level as an easy-to-implement strategy to optimize quantum gates. Focusing on $R_{ZX}$ gates, we demonstrate that such parallelization leads to improved fidelity and gate time reduction, when compared to serial concatenation. As measured by Cycle Benchmarking, our most modest fidelity gain was from 98.16(7)% to 99.15(3)% for the application of two $R_{ZX}(π/2)$ gates with one shared qubit. We show that this strategy can be applied to other gates like the CNOT and CZ, and it may benefit tasks such as Hamiltonian simulation problems, amplitude amplification, and error-correction codes.

quant-ph↗