Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum information theory”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Efficient use of quantum computers for collider physics

Most observables at particle colliders involve physics at a wide variety of distance scales. Due to asymptotic freedom of the strong interaction, the physics at short distances can be calculated reliably using perturbative techniques, while long distance physics is non-perturbative in nature. Factorization theorems separate the contributions from different scales, allowing to identify the pieces that can be determined perturbatively from those that require non-perturbative information, and if the non-perturbative pieces can be reliably determined, one can use experimental measurements to extract the short distance effects, sensitive to possible new physics. Without the ability to compute the non-perturbative ingredients from first principles one typically identifies observables for which the non-perturbative information is universal in the sense that it can be extracted from some experimental observables and then used to predict other observables. In this paper we argue that the future ability to use quantum computers to calculate non-perturbative matrix elements from first principles will allow to make predictions for observables with non-universal non-perturbative long-distance physics.

Algorithms and Theoretical Developments↗
DOE OSTI2024

AdS 3 Einstein gravity and boundary description: pedagogical review

We review the various aspects of the 3D Einstein gravity theory with a negative cosmological constant and its boundary description. We also explore its connections to conformal field theories (CFTs), modular symmetry, and holography. It is worth noting that this particular theory is topological in nature, which means that all the physical degrees of freedom are located on the boundary. Additionally, we can derive the boundary description on a torus, which takes the form of a 2D Schwarzian theory. This observation suggests that the relevant degrees of freedom for the theory can be described using this 2D theory. Because of the renormalizability of the 3D gravity theory, one can probe the quantum regime. This suggests that it is possible to investigate quantum phenomena. Unlike the conventional CFTs, when considering the AdS 3 background, the boundary theory loses modular symmetry. This represents a departure from the usual behavior of CFT and is quite intriguing. The Weyl transformation induces anomaly in CFTs, and we indicate that applying this transformation to the 2D Schwarzian theory leads to similar results. Summing over all geometries with the asymptotic AdS 3 boundary condition is equivalent to summing over a modular group. The partition function is one-loop exact and therefore an analytical expression from the summation. This theory holds potential applications in Quantum Information and is a recurring theme in the study of holography, where gravitational theories are connected with CFTs.

2D Schwarzian theory↗
DOE OSTI2024

The black hole interior from non-isometric codes and complexity

Quantum error correction has given us a natural language for the emergence of spacetime, but the black hole interior poses a challenge for this framework: at late times the apparent number of interior degrees of freedom in effective field theory can vastly exceed the true number of fundamental degrees of freedom, so there can be no isometric (i.e. inner-product preserving) encoding of the former into the latter. In this paper we explain how quantum error correction nonetheless can be used to explain the emergence of the black hole interior, via the idea of “non-isometric codes protected by computational complexity”. We show that many previous ideas, such as the existence of a large number of “null states”, a breakdown of effective field theory for operations of exponential complexity, the quantum extremal surface calculation of the Page curve, post-selection, “state-dependent/state-specific” operator reconstruction, and the “simple entropy” approach to complexity coarse-graining, all fit naturally into this framework, and we illustrate all of these phenomena simultaneously in a soluble model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum reservoir computing implementation on coherently coupled quantum oscillators

Quantum reservoir computing is a promising approach for quantum neural networks, capable of solving hard learning tasks on both classical and quantum input data. However, current approaches with qubits suffer from limited connectivity. We propose an implementation for quantum reservoir that obtains a large number of densely connected neurons by using parametrically coupled quantum oscillators instead of physically coupled qubits. We analyze a specific hardware implementation based on superconducting circuits: with just two coupled quantum oscillators, we create a quantum reservoir comprising up to 81 neurons. We obtain state-of-the-art accuracy of 99% on benchmark tasks that otherwise require at least 24 classical oscillators to be solved. Our results give the coupling and dissipation requirements in the system and show how they affect the performance of the quantum reservoir. Beyond quantum reservoir computing, the use of parametrically coupled bosonic modes holds promise for realizing large quantum neural network architectures, with billions of neurons implemented with only 10 coupled quantum oscillators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Boundaries of quantum supremacy via random circuit sampling

Abstract Google’s quantum supremacy experiment heralded a transition point where quantum computers can evaluate a computational task, random circuit sampling, faster than classical supercomputers. We examine the constraints on the region of quantum advantage for quantum circuits with a larger number of qubits and gates than experimentally implemented. At near-term gate fidelities, we demonstrate that quantum supremacy is limited to circuits with a qubit count and circuit depth of a few hundred. Larger circuits encounter two distinct boundaries: a return of a classical advantage and practically infeasible quantum runtimes. Decreasing error rates cause the region of a quantum advantage to grow rapidly. At error rates required for early implementations of the surface code, the largest circuit size within the quantum supremacy regime coincides approximately with the smallest circuit size needed to implement error correction. Thus, the boundaries of quantum supremacy may fortuitously coincide with the advent of scalable, error-corrected quantum computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Half-Integer Quantized Topological Response in Quasiperiodically Driven Quantum Systems

A spin strongly driven by two harmonic incommensurate drives can pump energy from one drive to the other at a quantized average rate, in close analogy with the quantum Hall effect. The pumping rate is a nonzero integer in the topological regime, while the trivial regime does not pump. The dynamical transition between the regimes is sharp in the zero-frequency limit and is characterized by a Dirac point in a synthetic band structure. We show that the pumping rate is half-integer quantized at the transition and present universal Kibble-Zurek scaling functions for energy transfer processes. Finally, our results adapt ideas from quantum phase transitions, quantum information, and topological band theory to nonequilibrium dynamics, and identify qubit experiments to observe the universal linear and nonlinear response of a Dirac point in synthetic dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Theory of quantum circuits with Abelian symmetries

Quantum circuits with gates (local unitaries) respecting a global symmetry have broad applications in quantum information science and related fields, such as condensed-matter theory and quantum thermodynamics. However, despite their widespread use, fundamental properties of such circuits are not well understood. Recently, it was found that generic unitaries respecting a global symmetry cannot be realized, even approximately, using gates that respect the same symmetry. This observation raises important open questions: What unitary transformations can be realized with k -local gates that respect a global symmetry? In other words, in the presence of a global symmetry, how does the locality of interactions constrain the possible time evolution of a composite system? In this work, we address these questions for the case of Abelian (commutative) symmetries and develop constructive methods for synthesizing circuits with such symmetries. Remarkably, as a corollary, we find that, while the locality of interactions still imposes additional constraints on realizable unitaries, certain restrictions observed in the case of non-Abelian symmetries do not apply to circuits with Abelian symmetries. For instance, in circuits with a general non-Abelian symmetry such as SU ( d ) , the unitary realized in a subspace with one irreducible representation (charge) of the symmetry dictates the realized unitaries in multiple other sectors with inequivalent representations of the symmetry. Furthermore, in certain sectors, rather than all unitaries respecting the symmetry, the realizable unitaries are the symplectic or orthogonal subgroups of this group. We prove that none of these restrictions appears in the case of Abelian symmetries. This result suggests that global non-Abelian symmetries may affect the thermalization of quantum systems in ways not possible under Abelian symmetries. Published by the American Physical Society 2024

Marvian, Iman↗
DOE OSTI2025

Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality

Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.

Combinatorics (math.CO)↗
DOE OSTI2023

Quantum logic gate synthesis as a Markov decision process

Reinforcement learning has witnessed recent applications to a variety of tasks in quantum programming. The underlying assumption is that those tasks could be modeled as Markov decision processes (MDPs). Here, we investigate the feasibility of this assumption by exploring its consequences for single-qubit quantum state preparation and gate compilation. By forming discrete MDPs, we solve for the optimal policy exactly through policy iteration. We find optimal paths that correspond to the shortest possible sequence of gates to prepare a state or compile a gate, up to some target accuracy. Our method works in both the absence and presence of noise and compares favorably to other quantum compilation methods, such as the Ross–Selinger algorithm. This work provides theoretical insight into why reinforcement learning may be successfully used to find optimally short gate sequences in quantum programming.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Hamiltonian systems, Toda lattices, solitons, Lax pairs on weighted Z -graded graphs

In this study, we consider discrete one-dimensional nonlinear equations and present the procedure of lifting them to Z -graded graphs. We identify conditions that allow one to lift one-dimensional solutions to solutions on graphs. In particular, we prove the existence of solitons for static potentials on graded fractal graphs. We also show that even for a simple example of a topologically interesting graph, the corresponding non-trivial Lax pairs and associated unitary transformations do not lift to a Lax pair on the Z -graded graph.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

The QICK (Quantum Instrumentation Control Kit): Readout and control for qubits and detectors

We introduce a Xilinx RF System-on-Chip (RFSoC)-based qubit controller (called the Quantum Instrumentation Control Kit, or QICK for short), which supports the direct synthesis of control pulses with carrier frequencies of up to 6 GHz. The QICK can control multiple qubits or other quantum devices. The QICK consists of a digital board hosting an RFSoC field-programmable gate array, custom firmware, and software and an optional companion custom-designed analog front-end board. We characterize the analog performance of the system as well as its digital latency, important for quantum error correction and feedback protocols. We benchmark the controller by performing standard characterizations of a transmon qubit. We achieve an average gate fidelity of ℱ avg =99.93%. All of the schematics, firmware, and software are open-source.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

First-order crosstalk mitigation in parallel quantum gates driven with multi-photon transitions

Here, we demonstrate an order of magnitude reduction in the sensitivity to optical crosstalk for neighboring trapped-ion qubits during simultaneous single-qubit gates driven with individual addressing beams. Gates are implemented via two-photon Raman transitions, where crosstalk is mitigated by offsetting the drive frequencies for each qubit to avoid first-order crosstalk effects from inter-beam two-photon resonance. The technique is simple to implement, and we find that phase-dependent crosstalk due to optical interference is reduced on the most impacted neighbor from a maximal fractional rotation error of 0.185(4) without crosstalk mitigation to ≤0.006 with the mitigation strategy. Furthermore, we characterize first-order crosstalk in the two-qubit gate and avoid the resulting rotation errors for the arbitrary-axis Mølmer–Sørensen gate via a phase-agnostic composite gate. Finally, we demonstrate holistic system performance by constructing a composite CNOT gate using the improved single-qubit gates and phase-agnostic two-qubit gate. This work is done on the Quantum Scientific Computing Open User Testbed; however, our methods are widely applicable for individual addressing Raman gates and impose no significant overhead, enabling immediate improvement for quantum processors that incorporate this technique.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Randomized measurement protocols for lattice gauge theories

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. Furthermore, this can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Quantum Information Encoding and Decoding for Quantum Sensi

This two-year theory project focused on theoretical investigations of novel paradigms for quantum sensing, building on information encoding and techniques from quantum error correction, quantum computing and other quantum information domains. The outcomes facilitate quantum information technology development, especially at the interface of quantum computing and quantum sensing. The results of the project show new use cases and new paradigms for quantum sensing beyond what has so far been considered. One outcome shows how quantum sensing opens new opportunities for fundamental physics such as the capability of single graviton detection. Another outcome reveals a new application of NISQ quantum computers with error correction for metrology, building on recent advances in practical quantum error correction implementation. The third outcome of the project creates new paradigms of back-action-evading sensing inspired by collective quantum information encoding, which achieves quantum sensing beyond the quantum limit without the use of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Symposium: Quantum Theory, Quantum Materials, Quantum Computing (Final Report, DE-SC0022551)

Quantum mechanics is fundamental to understanding, predicting, and controlling many physical processes in a vast range of scientific and technological areas. In molecules and materials, the quantum mechanics of Coulombic many-body systems determines far more than the ground state and bulk properties. Quantum mechanics governs magnetism, electron and spin transport, chemical reactions and catalysis, superconductivity, photosynthesis, etc. Each plays a vital role in modern society. As digital technologies push both temporal and length-scale limits, fundamental quantum principles become the current focus for a new class of technologies: quantum computing, quantum sensing, quantum encryption, etc. This oncoming quantum information sciences wave is manifest recently in frontier foci of all six Department of Energy Office of Science programs. The Sanibel Symposium offers a proven, influential platform for facilitating and advancing cross-fertilization among theoretical and computational chemists and physicists, computer scientists, and materials engineers. The Symposia have a long, successful record of driving progress on theory and computation of materials, nanostructures, and their molecular constituents. The Symposia thus are well-suited for advancing the quantum information science thrust in the Office of Basic Energy Sciences (BES). With that QIS thrust as the focus, we propose five sessions of the 61st Sanibel Symposium on the theme Quantum Theory, Quantum Materials, Quantum Computing. From a longer perspective, this thematic program for 2022 is the second year of a five year plan of program segments addressed at challenges in quantum information sciences and quantum materials. The rest of the Symposium program will be of considerable relevance, with, for example, sessions on quantum molecular and material dynamics, and new directions in coupled cluster theory. New ideas for methods and applications can be expected to emerge from the stimulus of the formal presentations and informal discussions. The proposed award is targeted at students, post-docs, and junior scientists. Conscious effort, characteristic of the Sanibel Symposia, to stimulate the participation of women and under-represented minorities will continue.

36 MATERIALS SCIENCE↗
DOE OSTI2025

QCD Theory Meets Information Theory

We present a novel technique to incorporate precision calculations from quantum chromodynamics into fully differential particle-level Monte Carlo simulations. By minimizing an information-theoretic quantity subject to constraints, our reweighted Monte Carlo incorporates systematic uncertainties absent in individual Monte Carlo predictions, achieving consistency with the theory input in precision and its estimated systematic uncertainties. Our method can be applied to arbitrary observables known from precision calculations, including multiple observables simultaneously. It generates strictly positive weights, thus offering a clear path to statistically powerful and theoretically precise computations for current and future collider experiments. As a proof of concept, we apply our technique to event-shape observables at electron-positron colliders, leveraging existing precision calculations of thrust. Our analysis highlights the importance of logarithmic moments of event shapes, which have not been previously studied in the collider physics literature.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Theoretical methods to design and test quantum simulators for the compact Abelian Higgs model

The lattice compact Abelian Higgs model is a nonperturbative regularized formulation of low-energy scalar quantum electrodynamics. In 1+1 dimensions, this model can be quantum simulated using a ladder-shaped optical lattice with Rydberg-dressed atoms. In this setup, one spatial dimension is used to carry the angular momentum of the quantum rotors. One can use truncations corresponding to spin-2 and spin-1 to build local Hilbert spaces associated with the links of the lattice. We argue that ladder-shaped configurable arrays of Rydberg atoms can be used for the same purpose. We make concrete proposals involving two and three Rydberg atoms to build one local spin-1 space (a qutrit). We show that the building blocks of the Hamiltonian calculations are models with one and two spins. We compare target and simulators using perturbative and numerical methods. The two-atom setup provides an easily controllable simulator of the one-spin model while the three-atom setup involves solving nonlinear equations. We discuss approximate methods to couple two spin-1 spaces. The article provides analytical and numerical tools necessary to design and build the proposed simulators with current technology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗