Sumeet Khatri

Sumeet Khatri

Auto-generated profile, based on publicly available information

Sumeet Khatri

Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, Berlin, Germany

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 May 2019 in Quantum
Verified
Journal Article
Open access
SKSumeet Khatri
Sumeet Khatri
RLRyan LaRose
Ryan LaRose
APAlexander Poremba
Alexander Poremba
LCLukasz Cincio
Lukasz Cincio
ASAndrew T. Sornborger
Andrew T. Sornborger
PCPatrick J. Coles
Patrick J. Coles
Compiling quantum algorithms for near-term quantum computers (accounting for connectivity and native gate alphabets) is a major challenge that has received significant attention both by industry and academia. Avoiding the exponential overhead of classical simulation of quantum dynamics will allow compilation of larger algorithms, and a strategy for this is to evaluate an algorithm's cost on a quantum computer. To this end, we propose a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC). In QAQC, we use the overlap between a target unitaryUand a trainable unitaryVas the cost function to be evaluated on the quantum computer. More precisely, to ensure that QAQC scales well with problem size, our cost involves not only the global overlapTr(V†U)but also the local overlaps with respect to individual qubits. We introduce novel short-depth quantum circuits to quantify the terms in our cost function, and we prove that our cost cannot be efficiently approximated with a classical algorithm under reasonable complexity assumptions. We present both gradient-free and gradient-based approaches to minimizing this cost. As a demonstration of QAQC, we compile various one-qubit gates on IBM's and Rigetti's quantum computers into their respective native gate alphabets. Furthermore, we successfully simulate QAQC up to a problem size of 9 qubits, and these simulations highlight both the scalability of our cost function as well as the noise resilience of QAQC. Future applications of QAQC include algorithm depth compression, black-box compiling, noise mitigation, and benchmarking.

1 April 2020 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
KSKunal Sharma
Kunal Sharma
SKSumeet Khatri
Sumeet Khatri
MCM. Cerezo
M. Cerezo
PCPatrick J Coles
Patrick J Coles
Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM’s noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

25 July 2024 in Nature Physics
Verified
Journal Article
Open access
PDF file
YQYihui Quek
Yihui Quek
DFDaniel Stilck França
Daniel Stilck França
SKSumeet Khatri
Sumeet Khatri
JMJohannes Jakob Meyer
Johannes Jakob Meyer
JEJens Eisert
Jens Eisert
Quantum error mitigation has been proposed as a means to combat unwanted and unavoidable errors in near-term quantum computing without the heavy resource overheads required by fault-tolerant schemes. Recently, error mitigation has been successfully applied to reduce noise in near-term applications. In this work, however, we identify strong limitations to the degree to which quantum noise can be effectively ‘undone’ for larger system sizes. Our framework rigorously captures large classes of error-mitigation schemes in use today. By relating error mitigation to a statistical inference problem, we show that even at shallow circuit depths comparable to those of current experiments, a superpolynomial number of samples is needed in the worst case to estimate the expectation values of noiseless observables, the principal task of error mitigation. Notably, our construction implies that scrambling due to noise can kick in at exponentially smaller depths than previously thought. Noise also impacts other near-term applications by constraining kernel estimation in quantum machine learning, causing an earlier emergence of noise-induced barren plateaus in variational quantum algorithms and ruling out exponential quantum speed-ups in estimating expectation values in the presence of noise or preparing the ground state of a Hamiltonian.

4 January 2021 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
SKSumeet Khatri
Sumeet Khatri
ABAnthony J. Brady
Anthony J. Brady
RDRenée A. Desporte
Renée A. Desporte
MBManon Bart
Manon Bart
JDJonathan P. Dowling
Jonathan P. Dowling
Recent experimental breakthroughs in satellite quantum communications have opened up the possibility of creating a global quantum internet using satellite links. This approach appears to be particularly viable in the near term, due to the lower attenuation of optical signals from satellite to ground, and due to the currently short coherence times of quantum memories. The latter prevents ground-based entanglement distribution using atmospheric or optical-fiber links at high rates over long distances. In this work, we propose a global-scale quantum internet consisting of a constellation of orbiting satellites that provides a continuous, on-demand entanglement distribution service to ground stations. The satellites can also function as untrusted nodes for the purpose of long-distance quantum-key distribution. We develop a technique for determining optimal satellite configurations with continuous coverage that balances both the total number of satellites and entanglement-distribution rates. Using this technique, we determine various optimal satellite configurations for a polar-orbit constellation, and we analyze the resulting satellite-to-ground loss and achievable entanglement-distribution rates for multiple ground station configurations. We also provide a comparison between these entanglement-distribution rates and the rates of ground-based quantum repeater schemes. Overall, our work provides the theoretical tools and the experimental guidance needed to make a satellite-based global quantum internet a reality.

29 January 2018 in Physical Review A
Verified
Journal Article
Open access
PDF file
Siddhartha DasSiddhartha Das
Siddhartha Das
SKSumeet Khatri
Sumeet Khatri
JDJonathan P. Dowling
Jonathan P. Dowling
Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.

6 July 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
SKSumeet Khatri
Sumeet Khatri
KSKunal Sharma
Kunal Sharma
MWMark M. Wilde
Mark M. Wilde
The generalized amplitude-damping channel (GADC) is one of the sources of noise in superconducting-circuit-based quantum computing. It can be viewed as the qubit analog of the bosonic thermal channel, and it thus can be used to model lossy processes in the presence of background noise for low-temperature systems. In this work, we provide an information-theoretic study of the GADC. We first determine the parameter range for which the GADC is entanglement breaking and the range for which it is antidegradable. We then establish several upper bounds on its classical, quantum, and private capacities. These bounds are based on data-processing inequalities and the uniform continuity of information-theoretic quantities, as well as other techniques. Our upper bounds on the quantum capacity of the GADC are tighter than the known upper bound reported recently in Rosati et al., [ Nat. Commun. 9, 4339 (2018)] for the entire parameter range of the GADC, thus reducing the gap between the lower and upper bounds. We also establish upper bounds on the two-way assisted quantum and private capacities of the GADC. These bounds are based on the squashed entanglement, and they are established by constructing particular squashing channels. We compare these bounds with the max-Rains information bound, the mutual information bound, and another bound based on approximate covariance. For all capacities considered, we find that a large variety of techniques are useful in establishing bounds.