Hari Krovi
Research Subjects
Hari Krovi has a total of 35 co-authors. Here are the top co-authors by number of shared publications:
- Luke C. G. Govia
Quantum Engineering and Computing, Raytheon BBN Technologies, Cambridge, Massachusetts 02138, USA
4 shared publications - Diego Ristè
Kavli Institute of Nanoscience, Delft University of Technology, PO Box 5046, 2600 GA Delft, The Netherlands
2 shared publications - Dirk Englund
Massachusetts Institute of Technology, Cambridge, USA
2 shared publications - Matthew Ware
Department of Physics, Syracuse University, Syracuse, New York 13244-1130, USA
2 shared publications Saikat Guha
Quantum Information Processing Group, Raytheon BBN Technologies, Cambridge, USA
2 shared publicationsZachary Dutton
Quantum Information Processing Group, Raytheon BBN Technologies, Cambridge, USA
2 shared publications
Latest Publications
- Open Access
Improved quantum algorithms for linear and nonlinear differential equations
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In Berry et al., (2017), a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices. The algorithm here is also exponentially faster than the bounds derived in Berry et al., (2017) for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in Liu et al., (2021)). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by Xue et al., (2021), but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse, invertible matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas Liu et al., (2021) and Xue et al., (2021) additionally require normality.
Open AccessImproved quantum algorithms for linear and nonlinear differential equations
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In Berry et al., (2017), a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices. The algorithm here is also exponentially faster than the bounds derived in Berry et al., (2017) for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in Liu et al., (2021)). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by Xue et al., (2021), but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse, invertible matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas Liu et al., (2021) and Xue et al., (2021) additionally require normality.
- Top Cited PapersOpen Access
- 2 February 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 913
Improved quantum algorithms for linear and nonlinear differential equations
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In \cite{BCOW17}, a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in \cite{BCOW17} for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in \cite{Liue2026805118}). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by \cite{Xue_2021}, but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas \cite{Liue2026805118} and \cite{Xue_2021} additionally require normality.
- 2 February 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 913
Top Cited PapersOpen AccessImproved quantum algorithms for linear and nonlinear differential equations
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In \cite{BCOW17}, a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in \cite{BCOW17} for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in \cite{Liue2026805118}). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by \cite{Xue_2021}, but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas \cite{Liue2026805118} and \cite{Xue_2021} additionally require normality.
- 20 January 2022
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 17 (1) , 014024
Deep-Neural-Network Discrimination of Multiplexed Superconducting-Qubit States
Demonstrating a quantum computational advantage will require high-fidelity control and readout of multiqubit systems. As system size increases, multiplexed qubit readout becomes a practical necessity to limit the growth of resource overhead. Many contemporary qubit-state discriminators presume single-qubit operating conditions or require considerable computational effort, limiting their potential extensibility. Here, we present multiqubit readout using neural networks as state discriminators. We compare our approach to contemporary methods employed on a quantum device with five superconducting qubits and frequency-multiplexed readout. We find that fully connected feedforward neural networks increase the qubit-state-assignment fidelity for our system. Relative to contemporary discriminators, the assignment error rate is reduced by up to 25% due to the compensation of system-dependent nonidealities such as readout crosstalk, which is reduced by up to one order of magnitude. Our work demonstrates a potentially extensible building block for high-fidelity readout relevant to both near-term devices and future fault-tolerant systems.
- 20 January 2022
- Published by American Physical Society (APS) in Physical Review Applied
- Vol. 17 (1) , 014024
Deep-Neural-Network Discrimination of Multiplexed Superconducting-Qubit States
Demonstrating a quantum computational advantage will require high-fidelity control and readout of multiqubit systems. As system size increases, multiplexed qubit readout becomes a practical necessity to limit the growth of resource overhead. Many contemporary qubit-state discriminators presume single-qubit operating conditions or require considerable computational effort, limiting their potential extensibility. Here, we present multiqubit readout using neural networks as state discriminators. We compare our approach to contemporary methods employed on a quantum device with five superconducting qubits and frequency-multiplexed readout. We find that fully connected feedforward neural networks increase the qubit-state-assignment fidelity for our system. Relative to contemporary discriminators, the assignment error rate is reduced by up to 25% due to the compensation of system-dependent nonidealities such as readout crosstalk, which is reduced by up to one order of magnitude. Our work demonstrates a potentially extensible building block for high-fidelity readout relevant to both near-term devices and future fault-tolerant systems.
- Open Access
- 19 November 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (5) , 052612
Subexponential rate versus distance with time-multiplexed quantum repeaters
Quantum communications capacity using direct transmission over length- optical fiber scales as , where is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs), and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., , with . We show that the introduction of temporal multiplexing—i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at different time steps—leads to a subexponential rate-vs-distance scaling, i.e., , which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time multiplexing degrades the rate-vs-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. Quantum memory decoherence is seen to be more detrimental to the repeater's performance over switching losses.- 19 November 2021
- Published by American Physical Society (APS) in Physical Review A
- Vol. 104 (5) , 052612
Open AccessSubexponential rate versus distance with time-multiplexed quantum repeaters
Quantum communications capacity using direct transmission over length- optical fiber scales as , where is the fiber's loss coefficient. The rate achieved using a linear chain of quantum repeaters equipped with quantum memories, probabilistic Bell state measurements (BSMs), and switches used for spatial multiplexing, but no quantum error correction, was shown to surpass the direct-transmission capacity. However, this rate still decays exponentially with the end-to-end distance, viz., , with . We show that the introduction of temporal multiplexing—i.e., the ability to perform BSMs among qubits at a repeater node that were successfully entangled with qubits at distinct neighboring nodes at different time steps—leads to a subexponential rate-vs-distance scaling, i.e., , which is not attainable with just spatial or spectral multiplexing. We evaluate analytical upper and lower bounds to this rate and obtain the exact rate by numerically optimizing the time-multiplexing block length and the number of repeater nodes. We further demonstrate that incorporating losses in the optical switches used to implement time multiplexing degrades the rate-vs-distance performance, eventually falling back to exponential scaling for very lossy switches. We also examine models for quantum memory decoherence and describe optimal regimes of operation to preserve the desired boost from temporal multiplexing. Quantum memory decoherence is seen to be more detrimental to the repeater's performance over switching losses. - Open Access
- 18 December 2020
- Published by Springer Nature in npj Quantum Information
- Vol. 6 (1) , 1-12
Numerical finite-key analysis of quantum key distribution
Quantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many QKD experiments, however, predict their achievable key rates using asymptotic formulas, which assume the transmission of an infinite number of signals, partly because QKD proofs with finite transmissions (and finite-key lengths) can be difficult. Here we develop a robust numerical approach for calculating the key rates for QKD protocols in the finite-key regime in terms of two semi-definite programs (SDPs). The first uses the relation between conditional smooth min-entropy and quantum relative entropy through the quantum asymptotic equipartition property, and the second uses the relation between the smooth min-entropy and quantum fidelity. The numerical programs are formulated under the assumption of collective attacks from the eavesdropper and can be promoted to withstand coherent attacks using the postselection technique. We then solve these SDPs using convex optimization solvers and obtain numerical calculations of finite-key rates for several protocols difficult to analyze analytically, such as BB84 with unequal detector efficiencies, B92, and twin-field QKD. Our numerical approach democratizes the composable security proofs for QKD protocols where the derived keys can be used as an input to another cryptosystem.
- 18 December 2020
- Published by Springer Nature in npj Quantum Information
- Vol. 6 (1) , 1-12
Open AccessNumerical finite-key analysis of quantum key distribution
Quantum key distribution (QKD) allows for secure communications safe against attacks by quantum computers. QKD protocols are performed by sending a sizeable, but finite, number of quantum signals between the distant parties involved. Many QKD experiments, however, predict their achievable key rates using asymptotic formulas, which assume the transmission of an infinite number of signals, partly because QKD proofs with finite transmissions (and finite-key lengths) can be difficult. Here we develop a robust numerical approach for calculating the key rates for QKD protocols in the finite-key regime in terms of two semi-definite programs (SDPs). The first uses the relation between conditional smooth min-entropy and quantum relative entropy through the quantum asymptotic equipartition property, and the second uses the relation between the smooth min-entropy and quantum fidelity. The numerical programs are formulated under the assumption of collective attacks from the eavesdropper and can be promoted to withstand coherent attacks using the postselection technique. We then solve these SDPs using convex optimization solvers and obtain numerical calculations of finite-key rates for several protocols difficult to analyze analytically, such as BB84 with unequal detector efficiencies, B92, and twin-field QKD. Our numerical approach democratizes the composable security proofs for QKD protocols where the derived keys can be used as an input to another cryptosystem.
- 9 June 2020
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (6) , 062318
Clifford-group-restricted eavesdroppers in quantum key distribution
Quantum key distribution (QKD) promises provably secure cryptography, even to attacks from an all-powerful adversary. However, with quantum computing development lagging behind QKD, the assumption that there exists an adversary equipped with a universal fault-tolerant quantum computer is unrealistic for at least the near-future. Here, we explore the effect of restricting the eavesdropper's computational capabilities on the security of QKD and find that improved secret key rates are possible. Specifically, we show that for a large class of discrete variable protocols higher key rates are possible if the eavesdropper is restricted to a unitary operation from the Clifford group. Further, we consider Clifford-random channels consisting of mixtures of Clifford gates. We numerically calculate a secret-key-rate lower bound for BB84 with this restriction and show that, in contrast to the case of a single restricted unitary attack, the mixture of Clifford-based unitary attacks does not result in an improved key rate.
- 9 June 2020
- Published by American Physical Society (APS) in Physical Review A
- Vol. 101 (6) , 062318
Clifford-group-restricted eavesdroppers in quantum key distribution
Quantum key distribution (QKD) promises provably secure cryptography, even to attacks from an all-powerful adversary. However, with quantum computing development lagging behind QKD, the assumption that there exists an adversary equipped with a universal fault-tolerant quantum computer is unrealistic for at least the near-future. Here, we explore the effect of restricting the eavesdropper's computational capabilities on the security of QKD and find that improved secret key rates are possible. Specifically, we show that for a large class of discrete variable protocols higher key rates are possible if the eavesdropper is restricted to a unitary operation from the Clifford group. Further, we consider Clifford-random channels consisting of mixtures of Clifford gates. We numerically calculate a secret-key-rate lower bound for BB84 with this restriction and show that, in contrast to the case of a single restricted unitary attack, the mixture of Clifford-based unitary attacks does not result in an improved key rate.
- Open Access
- 27 February 2020
- Published by Springer Nature in Nature Communications
- Vol. 11 (1) , 1-9
Bootstrapping quantum process tomography via a perturbative ansatz
Quantum process tomography has become increasingly critical as the need grows for robust verification and validation of candidate quantum processors, since it plays a key role in both performance assessment and debugging. However, as these processors grow in size, standard process tomography becomes an almost impossible task. Here, we present an approach for efficient quantum process tomography that uses a physically motivated ansatz for an unknown quantum process. Our ansatz bootstraps to an effective description for an unknown process on a multi-qubit processor from pairwise two-qubit tomographic data. Further, our approach can inherit insensitivity to system preparation and measurement error from the two-qubit tomography scheme. We benchmark our approach using numerical simulation of noisy three-qubit gates, and show that it produces highly accurate characterizations of quantum processes. Further, we demonstrate our approach experimentally on a superconducting quantum processor, building three-qubit gate reconstructions from two-qubit tomographic data.
- 27 February 2020
- Published by Springer Nature in Nature Communications
- Vol. 11 (1) , 1-9
Open AccessBootstrapping quantum process tomography via a perturbative ansatz
Quantum process tomography has become increasingly critical as the need grows for robust verification and validation of candidate quantum processors, since it plays a key role in both performance assessment and debugging. However, as these processors grow in size, standard process tomography becomes an almost impossible task. Here, we present an approach for efficient quantum process tomography that uses a physically motivated ansatz for an unknown quantum process. Our ansatz bootstraps to an effective description for an unknown process on a multi-qubit processor from pairwise two-qubit tomographic data. Further, our approach can inherit insensitivity to system preparation and measurement error from the two-qubit tomography scheme. We benchmark our approach using numerical simulation of noisy three-qubit gates, and show that it produces highly accurate characterizations of quantum processes. Further, we demonstrate our approach experimentally on a superconducting quantum processor, building three-qubit gate reconstructions from two-qubit tomographic data.
- Open Access
- 14 February 2019
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 3, 122
An efficient high dimensional quantum Schur transform
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an fold tensor product of a vector space of dimension . Bacon, Chuang and Harrow [5] gave a quantum algorithm for this transform that is polynomial in , and , where is the precision. In a footnote in Harrow's thesis [18], a brief description of how to make the algorithm of [5] polynomial in is given using the unitary group representation theory (however, this has not been explained in detail anywhere). In this article, we present a quantum algorithm for the Schur transform that is polynomial in , and using a different approach. Specifically, we build this transform using the representation theory of the symmetric group and in this sense our technique can be considered a ''dual" algorithm to [5]. A novel feature of our algorithm is that we construct the quantum Fourier transform over the so called , which could have other applications.- 14 February 2019
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 3, 122
Open AccessAn efficient high dimensional quantum Schur transform
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an fold tensor product of a vector space of dimension . Bacon, Chuang and Harrow [5] gave a quantum algorithm for this transform that is polynomial in , and , where is the precision. In a footnote in Harrow's thesis [18], a brief description of how to make the algorithm of [5] polynomial in is given using the unitary group representation theory (however, this has not been explained in detail anywhere). In this article, we present a quantum algorithm for the Schur transform that is polynomial in , and using a different approach. Specifically, we build this transform using the representation theory of the symmetric group and in this sense our technique can be considered a ''dual" algorithm to [5]. A novel feature of our algorithm is that we construct the quantum Fourier transform over the so called , which could have other applications. - Open Access
An efficient high dimensional quantum Schur transform
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an $n$ fold tensor product $V^{\otimes n}$ of a vector space $V$ of dimension $d$. Bacon, Chuang and Harrow \cite{BCH07} gave a quantum algorithm for this transform that is polynomial in $n$, $d$ and $\log\epsilon^{-1}$, where $\epsilon$ is the precision. In a footnote in Harrow's thesis \cite{H05}, a brief description of how to make the algorithm of \cite{BCH07} polynomial in $\log d$ is given using the unitary group representation theory (however, this has not been explained in detail anywhere. In this article, we present a quantum algorithm for the Schur transform that is polynomial in $n$, $\log d$ and $\log\epsilon^{-1}$ using a different approach. Specifically, we build this transform using the representation theory of the symmetric group and in this sense our technique can be considered a "dual" algorithm to \cite{BCH07}. A novel feature of our algorithm is that we construct the quantum Fourier transform over the so called \emph{permutation modules}, which could have other applications.Open AccessAn efficient high dimensional quantum Schur transform
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and unitary groups on an $n$ fold tensor product $V^{\otimes n}$ of a vector space $V$ of dimension $d$. Bacon, Chuang and Harrow \cite{BCH07} gave a quantum algorithm for this transform that is polynomial in $n$, $d$ and $\log\epsilon^{-1}$, where $\epsilon$ is the precision. In a footnote in Harrow's thesis \cite{H05}, a brief description of how to make the algorithm of \cite{BCH07} polynomial in $\log d$ is given using the unitary group representation theory (however, this has not been explained in detail anywhere. In this article, we present a quantum algorithm for the Schur transform that is polynomial in $n$, $\log d$ and $\log\epsilon^{-1}$ using a different approach. Specifically, we build this transform using the representation theory of the symmetric group and in this sense our technique can be considered a "dual" algorithm to \cite{BCH07}. A novel feature of our algorithm is that we construct the quantum Fourier transform over the so called \emph{permutation modules}, which could have other applications. - 10 March 2016
- Published by Springer Nature in Applied Physics B
- Vol. 122 (3) , 1-8
Practical quantum repeaters with parametric down-conversion sources
- 10 March 2016
- Published by Springer Nature in Applied Physics B
- Vol. 122 (3) , 1-8
Practical quantum repeaters with parametric down-conversion sources