arXiv subjects

Deepankar Sarmah

Publications and source records attributed to Deepankar Sarmah.

4 recordsLinked to original sources

arXiv2024

A coherence sweet spot with enhanced dipolar coupling

Qubits require a compromise between operation speed and coherence. Here, we demonstrate a compromise-free singlet-triplet (ST) qubit, where the qubit couples maximally to the driving field while simultaneously coupling minimally to the dominant noise sources. The qubit is implemented in a crystal-phase defined double-quantum dot in an InAs nanowire. Using a superconducting resonator, we measure the spin-orbit interaction (SOI) gap, the spin-photon coupling strength and the qubit decoherence rate as a function of the in-plane magnetic-field orientation. We demonstrate a spin qubit sweet spot maximizing the dipolar coupling and simultaneously minimizing the decoherence. Our theoretical description postulates phonons as the most likely dominant noise source. The compromise-free sweet spot originates from the SOI suggesting that it is not restricted to this material platform, but might find applications in any material with SOI. These findings pave the way for enhanced engineering of these nanomaterials for next-generation qubit technologies.

cond-mat.mes-hall↗

arXiv2023

Performance of high impedance resonators in dirty dielectric environments

High-impedance resonators are a promising contender for realizing long-distance entangling gates between spin qubits. Often, the fabrication of spin qubits relies on the use of gate dielectrics which are detrimental to the quality of the resonator. Here, we investigate loss mechanisms of high-impedance NbTiN resonators in the vicinity of thermally grown SiO\textsubscript{2} and Al\textsubscript{2}O\textsubscript{3} fabricated by atomic layer deposition. We benchmark the resonator performance in elevated magnetic fields and at elevated temperatures and find that the internal quality factors are limited by the coupling between the resonator and two-level systems of the employed oxides. Nonetheless, the internal quality factors of high-impedance resonators exceed $10^3$ in all investigated oxide configurations which implies that the dielectric configuration would not limit the performance of resonators integrated in a spin-qubit device. Because these oxides are commonly used for spin qubit device fabrication, our results allow for straightforward integration of high-impedance resonators into spin-based quantum processors. Hence, these experiments pave the way for large-scale, spin-based quantum computers.

cond-mat.mes-hall↗

arXiv2020

On Sampling and Inference using Quantum Algorithms

Quantum computers are projected to handle the Gibbs sampling and the related inference on Markov networks effectively. Apart from noting the background information useful for those starting the explorations in this important thread of Quantum Machine Learning, we capture some results and observations obtained through extensive simulations with two popular paradigms of sampling based on Quantum Annealing and Quantum Approximate Optimization Algorithm.

quant-ph↗

arXiv2018

Exact search algorithm to factorize large biprimes and a triprime on IBM quantum computer

Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by means of classical computation. However, the order can be drastically reduced by converting the factorization problem to an optimization one and solving it using a quantum computer. Recent works involving both theoretical and experimental approaches use Shor's algorithm, adiabatic quantum computation and quantum annealing principles to factorize integers. However, our work makes use of the generalized Grover's algorithm as proposed by Liu, with an optimal version of classical algorithm/analytic algebra. We utilize the phase-matching property of the above algorithm for only amplitude amplification purposes to avoid an inherent phase factor that prevents perfect implementation of the algorithm. Here we experimentally demonstrate the factorization of two bi-primes, 4088459 and 966887 using IBM's 5- and 16-qubit quantum processors, hence making those the largest numbers that have been factorized on a quantum device. Using the above 5-qubit processor, we also realize the factorization of a tri-prime integer 175, which had not been achieved to date. We observe good agreement between experimental and theoretical results with high fidelities. The difficulty of the factorization experiments has been analyzed and it has been concluded that the solution to this problem depends on the level of simplification chosen, not the size of the number factored. In principle, our results can be extended to factorize any multi-prime integer with minimum quantum resources.

quant-ph↗