Search NASA⌕ Search

Engineering topics

Somma, Rolando D.

Publications and source records attributed to Somma, Rolando D..

Tensor networks for High Energy Physics: contribution to Snowmass 2021

Tensor network methods are becoming increasingly important for high-energy physics, condensed matter physics and quantum information science (QIS). We discuss the impact of tensor network methods on lattice field theory, quantum gravity and QIS in the context of High Energy Physics (HEP). These tools will target calculations for strongly interacting systems that are made difficult by sign problems when conventional Monte Carlo and other importance sampling methods are used. Further development of methods and software will be needed to make a significant impact in HEP. We discuss the roadmap to perform quantum chromodynamics (QCD) related calculations in the coming years. The research is labor intensive and requires state of the art computational science and computer science input for its development and validation. We briefly discuss the overlap with other science domains and industry.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast-forwarding quantum evolution

We investigate the problem of fast-forwarding quantum evolution, whereby the dynamics of certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states. Our definition accounts for any asymptotic complexity improvement of the general case and we use it to demonstrate fast-forwarding in several quantum systems. In particular, we show that some local spin systems whose Hamiltonians can be taken into block diagonal form using an efficient quantum circuit, such as those that are permutation-invariant, can be exponentially fast-forwarded. We also show that certain classes of positive semidefinite local spin systems, also known as frustration-free, can be polynomially fast-forwarded, provided the initial state is supported on a subspace of sufficiently low energies. Last, we show that all quadratic fermionic systems and number-conserving quadratic bosonic systems can be exponentially fast-forwarded in a model where quantum gates are exponentials of specific fermionic or bosonic operators, respectively. Our results extend the classes of physical Hamiltonians that were previously known to be fast-forwarded, while not necessarily requiring methods that diagonalize the Hamiltonians efficiently. We further develop a connection between fast-forwarding and precise energy measurements that also accounts for polynomial improvements.

97 MATHEMATICS AND COMPUTING↗

Long-haul high rate quantum key distribution

Multiple bit values can be encoded on a single photon in a quantum key distribution (QKD) system using a plurality of sidebands of an optical carrier frequency. Computational and conjugate bases can be defined, and photons decoded based on a selected state from either basis. If n sidebands are available, as many as log2n bits can be encoded on a single photon. Errors in detected bit values due to selection of an incorrect basis state or other errors can be at least partially corrected by bit distillation to identity bit strings for which a transmitter and a receiver record the same values, without insecure transmission of these values.

Nordholt, Jane Elizabeth↗

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗

Long-haul high rate quantum key distribution

Multiple bit values can be encoded on a single photon in a quantum key distribution (QKD) system using a plurality of sidebands of an optical carrier frequency. Computational and conjugate bases can be defined, and photons decoded based on a selected state from either basis. If n sidebands are available, as many as log2 n bits can be encoded on a single photon. Errors in detected bit values due to selection of an incorrect basis state or other errors can be at least partially corrected by bit distillation to identity bit strings for which a transmitter and a receiver record the same values, without insecure transmission of these values.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long-haul high rate quantum key distribution

Multiple bit values can be encoded on a single photon in a quantum key distribution (QKD) system using a plurality of sidebands of an optical carrier frequency. Computational and conjugate bases can be defined, and photons decoded based on a selected state from either basis. If n sidebands are available, as many as log.sub.2n bits can be encoded on a single photon. Errors in detected bit values due to selection of an incorrect basis state or other errors can be at least partially corrected by bit distillation to identity bit strings for which a transmitter and a receiver record the same values, without insecure transmission of these values.

97 MATHEMATICS AND COMPUTING↗

Multi-factor authentication using quantum communication

Multi-factor authentication using quantum communication ("QC") includes stages for enrollment and identification. For example, a user enrolls for multi-factor authentication that uses QC with a trusted authority. The trusted authority transmits device factor information associated with a user device (such as a hash function) and user factor information associated with the user (such as an encrypted version of a user password). The user device receives and stores the device factor information and user factor information. For multi-factor authentication that uses QC, the user device retrieves its stored device factor information and user factor information, then transmits the user factor information to the trusted authority, which also retrieves its stored device factor information. The user device and trusted authority use the device factor information and user factor information (more specifically, information such as a user password that is the basis of the user factor information) in multi-factor authentication that uses QC.

99 GENERAL AND MISCELLANEOUS↗

Turbulent Mixing Simulation via a Quantum Algorithm

Probability density function (PDF) methods have been very useful in describing many physical aspects of turbulent mixing. In applications of these methods, modeled PDF transport equations are commonly simulated via classical Monte Carlo techniques, which provide estimates of moments of the PDF at arbitrary accuracy. In this paper, recently developed techniques in quantum computing and quantum enhanced measurements (quantum metrology) are used to construct a quantum algorithm that accelerates the computation of such estimates. This quantum algorithm provides a quadratic speedup over classical Monte Carlo methods in terms of the number of repetitions needed to achieve the desired precision. This paper illustrates the power of this algorithm by considering a binary scalar mixing process modeled by means of the coalescence/dispersion (C/D) closure. The equation is first simulated using classical Monte Carlo methods, where error estimates for the computation of central moments are provided. Then the quantum algorithm for this problem is simulated by sampling from the same probability distribution as that of the output of a quantum computer, and it is shown that significantly fewer resources are required to achieve the same precision. Finally, the results demonstrate potential applications of future quantum computers for simulation of turbulent mixing, and large classes of related problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum algorithms for Gibbs sampling and hitting-time estimation

In this paper, we present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time almost linear in √Nβ/Ζ and polynomial in log(1/ϵ), where N is the Hilbert space dimension, β is the inverse temperature, Ζ is the partition function, and ϵ is the desired precision of the output state. Our quantum algorithm exponentially improves the dependence on 1/ϵ and quadratically improves the dependence on β of known quantum algorithms for this problem. The second algorithm estimates the hitting time of a Markov chain. For a sparse stochastic matrix Ρ, it runs in time almost linear in 1/(ϵΔ 3/2 ), where ϵ is the absolute precision in the estimation and Δ is a parameter determined by Ρ, and whose inverse is an upper bound of the hitting time. Our quantum algorithm quadratically improves the dependence on 1/ϵ and 1/Δ of the analog classical algorithm for hitting-time estimation. Finally, both algorithms use tools recently developed in the context of Hamiltonian simulation, spectral gap amplification, and solving linear systems of equations.

97 MATHEMATICS AND COMPUTING↗

A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation

We present a product formula to approximate the exponential of a skew-Hermitian operator that is a sum of generators of a Lie algebra. The number of terms in the product depends on the structure factors. When the generators have large norm with respect to the dimension of the Lie algebra, or when the norm of the effective operator resulting from nested commutators is less than the product of the norms, the number of terms in the product is significantly less than that obtained from well-known results. We apply our results to construct product formulas useful for the quantum simulation of some continuous-variable and bosonic physical systems, including systems whose potential is not quadratic. For many of these systems, we show that the number of terms in the product can be sublinear or even subpolynomial in the dimension of the relevant local Hilbert spaces, where such a dimension is usually determined by the energy scale of the problem. Our results emphasize the power of quantum computers for the simulation of various quantum systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗