Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 865 records · Page 48

Lieb-Robinson Light Cone for Power-Law Interactions

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as 1 / r α at distance r ? Here, we present a definitive answer to this question for all exponents α > 2 d and all spatial dimensions d . Schematically, information takes time at least r min { 1 , α - 2 d } to propagate a distance r . As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deterministic generation of remote entanglement with active quantum feedback

We develop and study protocols for deterministic remote entanglement generation using quantum feedback, without relying on an entangling Hamiltonian. In order to formulate the most effective experimentally feasible protocol, we introduce the notion of average-sense locally optimal feedback protocols, which do not require real-time quantum state estimation, a difficult component of real-time quantum feedback control. We use this notion of optimality to construct two protocols that can deterministically create maximal entanglement: a semiclassical feedback protocol for low-efficiency measurements and a quantum feedback protocol for high-efficiency measurements. The latter reduces to direct feedback in the continuous-time limit, whose dynamics can be modeled by a Wiseman-Milburn feedback master equation, which yields an analytic solution in the limit of unit measurement efficiency. Our formalism can smoothly interpolate between continuous-time and discrete-time descriptions of feedback dynamics and we exploit this feature to derive a superior hybrid protocol for arbitrary nonunit measurement efficiency that switches between quantum and semiclassical protocols. Lastly, we show using simulations incorporating experimental imperfections that deterministic entanglement of remote superconducting qubits may be achieved with current technology using the continuous-time feedback protocol alone.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiparameter Estimation in Networked Quantum Sensors

We introduce a general model for a network of quantum sensors, and we use this model to consider the question: When can entanglement between the sensors, and/or global measurements, enhance the precision with which the network can measure a set of unknown parameters? We rigorously answer this question by presenting precise theorems proving that for a broad class of problems there is, at most, a very limited intrinsic advantage to using entangled states or global measurements. Moreover, for many estimation problems separable states and local measurements are optimal, and can achieve the ultimate quantum limit on the estimation uncertainty. This immediately implies that there are broad conditions under which simultaneous estimation of multiple parameters cannot outperform individual, independent estimations. Our results apply to any situation in which spatially localized sensors are unitarily encoded with independent parameters, such as when estimating multiple linear or non-linear optical phase shifts in quantum imaging, or when mapping out the spatial profile of an unknown magnetic field. We conclude by showing that entangling the sensors can enhance the estimation precision when the parameters of interest are global properties of the entire network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Holonomic Quantum Control by Coherent Optical Excitation in Diamond

Although geometric phases in quantum evolution are historically overlooked, their active control now stimulates strategies for constructing robust quantum technologies. Here, we demonstrate arbitrary singlequbit holonomic gates from a single cycle of nonadiabatic evolution, eliminating the need to concatenate two separate cycles. Our method varies the amplitude, phase, and detuning of a two-tone optical field to control the non-Abelian geometric phase acquired by a nitrogen-vacancy center in diamond over a coherent excitation cycle. Here, we demonstrate the enhanced robustness of detuned gates to excited-state decoherence and provide insights for optimizing fast holonomic control in dissipative quantum systems.

36 MATERIALS SCIENCE↗

Application of Quantum Annealing to Nurse Scheduling Problem

Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is potentially achievable for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine returned results by using the annealing process a second time. We compare the performance of NSP using both forward and reverse annealing methods and describe how this approach might be used in practice.

97 MATHEMATICS AND COMPUTING↗

Practical quantum computation of chemical and nuclear energy levels using quantum imaginary time evolution and Lanczos algorithms

Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization in the presence of noise. The quantum imaginary-time evolution (QITE) and quantum Lanczos (QLanczos) methods proposed in Motta et al. (2020) eschew the aforementioned issues. In this study, we demonstrate the practical application of these algorithms to challenging quantum computations of relevance for chemistry and nuclear physics, using the deuteron-binding energy and molecular hydrogen binding and excited state energies as examples. With the correct choice of initial and final states, we show that the number of timesteps in QITE and QLanczos can be reduced significantly, which commensurately simplifies the required quantum circuit and improves compatibility with NISQ devices. We have performed these calculations on cloud-accessible IBM Q quantum computers. With the application of readout-error mitigation and Richardson error extrapolation, we have obtained ground and excited state energies that agree well with exact results obtained from diagonalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum key distribution with finite resources: Secret key rates via Renyi entropies

A realistic quantum key distribution (QKD) protocol necessarily deals with finite resources, such as the number of signals exchanged by the two parties. We derive a bound on the secret key rate which is expressed as an optimization problem over Renyi entropies. Under the assumption of collective attacks by an eavesdropper, a computable estimate of our bound for the six-state protocol is provided. This bound leads to improved key rates in comparison to previous results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient energy transfer in light-harvesting systems: Quantum-classical comparison, flux network, and robustness analysis

Following the calculation of optimal energy transfer in thermal environment in our first paper [J. L. Wu, F. Liu, Y. Shen, J. S. Cao, and R. J. Silbey, New J. Phys. 12, 105012 (2010)], full quantum dynamics and leading-order 'classical' hopping kinetics are compared in the seven-site Fenna-Matthews-Olson (FMO) protein complex. The difference between these two dynamic descriptions is due to higher-order quantum corrections. Two thermal bath models, classical white noise (the Haken-Strobl-Reineker (HSR) model) and quantum Debye model, are considered. In the seven-site FMO model, we observe that higher-order corrections lead to negligible changes in the trapping time or in energy transfer efficiency around the optimal and physiological conditions (2% in the HSR model and 0.1% in the quantum Debye model for the initial site at BChl 1). However, using the concept of integrated flux, we can identify significant differences in branching probabilities of the energy transfer network between hopping kinetics and quantum dynamics (26% in the HSR model and 32% in the quantum Debye model for the initial site at BChl 1). This observation indicates that the quantum coherence can significantly change the distribution of energy transfer pathways in the flux network with the efficiency nearly the same. The quantum-classical comparison of the average trapping time with the removal of the bottleneck site, BChl 4, demonstrates the robustness of the efficient energy transfer by the mechanism of multi-site quantum coherence. To reconcile with the latest eight-site FMO model which is also investigated in the third paper [J. Moix, J. L. Wu, P. F. Huo, D. F. Coker, and J. S. Cao, J. Phys. Chem. Lett. 2, 3045 (2011)], the quantum-classical comparison with the flux network analysis is summarized in Appendix C. The eight-site FMO model yields similar trapping time and network structure as the seven-site FMO model but leads to a more disperse distribution of energy transfer pathways.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Gaussian capacity of the quantum bosonic memory channel with additive correlated Gaussian noise

We present an algorithm for calculation of the Gaussian classical capacity of a quantum bosonic memory channel with additive Gaussian noise. The algorithm, restricted to Gaussian input states, is applicable to all channels with noise correlations obeying certain conditions and works in the full input energy domain, beyond previous treatments of this problem. As an illustration, we study the optimal input states and capacity of a quantum memory channel with Gauss-Markov noise [J. Schaefer, Phys. Rev. A 80, 062313 (2009)]. We evaluate the enhancement of the transmission rate when using these optimal entangled input states by comparison with a product coherent-state encoding and find out that such a simple coherent-state encoding achieves not less than 90% of the capacity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Imaginary Time Propagation on a Quantum Chip

We report evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter, and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device of a unitary operation in an extended Hilbert space. However, we prove that for simple problems it can also be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Monotonic multi-state quantum f -divergences

We use the Tomita–Takesaki modular theory and the Kubo–Ando operator mean to write down a large class of multi-state quantum f-divergences and prove that they satisfy the data processing inequality. For two states, this class includes the (α, z)-Rényi divergences, the f-divergences of Petz, and the Rényi Belavkin-Staszewski relative entropy as special cases. The method used is the interpolation theory of non-commutative Lωp spaces, and the result applies to general von Neumann algebras, including the local algebra of quantum field theory. We conjecture that these multi-state Rényi divergences have operational interpretations in terms of the optimal error probabilities in asymmetric multi-state quantum state discrimination.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Increased Reliability for Near-Term Quantum Computers via Low-Level Control (CRADA Final Report)

This project helped narrow the gap between near-term hardware and practical applications of quantum computing through the development and implementation of optimized compilation and error mitigation techniques. These advances were enabled by low-level control available on the Advanced Quantum Testbed, and led to methods that characterized and improved the platform’s performance on quantum algorithms. Results of this work were published in the scientific literature and used to inform internal software development of partner Super.tech.

97 MATHEMATICS AND COMPUTING↗

Enhancing quantum annealing accuracy through replication-based error mitigation *

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Djidjev, Hristo N. (ORCID:0000000192868824)↗

Sterile Neutrinos in Cold Climates

Measurements of neutrino oscillations at short baselines contain an intriguing set of experimental anomalies that may be suggestive of new physics such as the existence of sterile neutrinos. This three-part thesis presents research directed towards understanding these anomalies and searching for sterile neutrino oscillations. Part I contains a theoretical discussion of neutrino coherence properties. The open-quantum-system picture of neutrino beams, which allows a rigorous prediction of coherence distances for accelerator neutrinos, is presented. Validity of the standard treatment of active and sterile neutrino oscillations at short baselines is verified and non-standard coherence loss effects at longer baselines are predicted. Part II concerns liquid argon detector development for the MicroBooNE experiment, which will search for short-baseline oscillations in the Booster Neutrino Beam at Fermilab. Topics include characterization and installation of the MicroBooNE optical system; test-stand measurements of liquid argon optical properties with dissolved impurities; optimization of wavelength-shifting coatings for liquid argon scintillation light detection; testing and deployment of high-voltage surge arrestors to protect TPC field cages; and software development for optical and TPC simulation and reconstruction. Part III presents a search for sterile neutrinos using the IceCube neutrino telescope, which has collected a large sample of atmospheric-neutrino-induced events in the 1-10 TeV energy range. Sterile neutrinos would modify the detected neutrino flux shape via MSW-resonant oscillations. Following a careful treatment of systematic uncertainties in the sample, no evidence for MSW-resonant oscillations is observed, and exclusion limits on 3+1 model parameter space are derived. Under the mixing assumptions made, the 90\% confidence level exclusion limit extends to $\mathrm{sin}^2 2\theta_{24} \leq 0.02$ at $\Delta m^2 \sim 0.3\,eV^2$, and the LSND and MiniBooNE allowed regions are excluded at~>99\% confidence level.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Noise resilience of variational quantum compiling

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.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Anomalous thermodynamic properties of quantum critical superconductors

Recent high-precision measurements employing different experimental techniques have unveiled an anomalous peak in the doping dependence of the London penetration depth which is accompanied by anomalies in the heat capacity in iron-pnictide superconductors at the optimal composition associated with the hidden antiferromagnetic quantum critical point. Here, we argue that finite temperature effects can be a cause of observed features. Specifically we show that quantum critical magnetic fluctuations under superconducting dome can give rise to a nodal-like temperature dependence of both specific heat and magnetic penetration depth in a fully gapped superconductor. In the presence of line nodes in the superconducting gap fluctuations can lead to the significant renormalization of the relative slope of T-linear penetration depth which is steepest at the quantum critical point. The results we obtain are general and can be applied beyond the model we use.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

CHESS: The future direct geometry spectrometer at the second target station

CHESS, chopper spectrometer examining small samples, is a planned direct geometry neutron chopper spectrometer designed to detect and analyze weak signals intrinsic to small cross sections (e.g., small mass, small magnetic moments, or neutron absorbing materials) in powders, liquids, and crystals. CHESS is optimized to enable transformative investigations of quantum materials, spin liquids, thermoelectrics, battery materials, and liquids. The broad dynamic range of the instrument is also well suited to study relaxation processes and excitations in soft and biological matter. The 15 Hz repetition rate of the Second Target Station at the Spallation Neutron Source enables the use of multiple incident energies within a single source pulse, greatly expanding the information gained in a single measurement. Furthermore, the high flux grants an enhanced capability for polarization analysis. This enables the separation of nuclear from magnetic scattering or coherent from incoherent scattering in hydrogenous materials over a large range of energy and momentum transfer. This paper presents optimizations and technical solutions to address the key requirements envisioned in the science case and the anticipated uses of this instrument.

47 OTHER INSTRUMENTATION↗

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗