Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum information Science”

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 469 records · Page 26

Hamiltonian simulation in the low-energy subspace

Abstract We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian H . This is a central problem in physics with vast applications in many-body systems and beyond, where the interesting physics takes place in the low-energy sector. We analyze error bounds induced by product formulas that approximate the evolution operator and show that these bounds depend on an effective low-energy norm of H . We find improvements over the best previous complexities of product formulas that apply to the general case, and these improvements are more significant for long evolution times that scale with the system size and/or small approximation errors. To obtain these improvements, we prove exponentially decaying upper bounds on the leakage to high-energy subspaces due to the product formula. Our results provide a path to a systematic study of Hamiltonian simulation at low energies, which will be required to push quantum simulation closer to reality.

97 MATHEMATICS AND COMPUTING↗

Generalized geometric speed limits for quantum observables

Leveraging quantum information geometry, we derive generalized quantum speed limits on the rate of change of the expectation values of observables. These bounds subsume and, for Hilbert space dimension ≥3, tighten existing bounds—in some cases by an arbitrarily large multiplicative constant. Our theoretical results are supported by illustrative examples and an experimental demonstration using a superconducting qutrit. We also derive two upper bounds on the generalized quantum Fisher information in terms of the condition number of the density matrix. One of these bounds applies only to coherent dynamics and depends also on the variance of the Hamiltonian. The other bound depends also on the so-called Wigner-Yanase skew information. These bounds generalize well-known bounds on the symmetric logarithmic derivative quantum Fisher information and are tighter than the existing bounds for sufficiently mixed states (e.g., for sufficiently high temperature thermal states).

open quantum systems & decoherence↗

Hamiltonian Simulation [Slides]

Given a (qubit) quantum system modeled by a Hamiltonian H, use a quantum computer to obtain time-evolved properties of the system. One way of solving this problem is by actually preparing the evolved quantum state (in some encoded fashion). The goal is to provide a sequence of elementary 1 and 2-qubit gates that would prepare such a state.

97 MATHEMATICS AND COMPUTING↗

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗

Security proof of practical quantum key distribution with detection-efficiency mismatch

Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cutoff of incoming signals such that our security proof is directly applicable to practical situations. We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes. In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed. For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cutoff assumption. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.

97 MATHEMATICS AND COMPUTING↗

A parametrically programmable delay line for microwave photons

Delay lines that store quantum information are crucial for advancing quantum repeaters and hardware efficient quantum computers. Traditionally, they are realized as extended systems that support wave propagation but provide limited control over the propagating fields. Here, we introduce a parametrically addressed delay line for microwave photons that provides a high level of control over the stored pulses. By parametrically driving a three-wave mixing circuit element that is weakly hybridized with an ensemble of resonators, we engineer a spectral response that simulates that of a physical delay line, while providing fast control over the delay line’s properties. We demonstrate this novel degree of control by choosing which photon echo to emit, translating pulses in time, and even swapping two pulses, all with pulse energies on the order of a single photon. We also measure the noise added from our parametric interactions and find it is much less than one photon.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The 2021 quantum materials roadmap

In recent years, the notion of ‘Quantum Materials’ has emerged as a powerful unifying concept across diverse fields of science and engineering, from condensed-matter and coldatom physics to materials science and quantum computing. Beyond traditional quantum materials such as unconventional superconductors, heavy fermions, and multiferroics, the field has significantly expanded to encompass topological quantum matter, two-dimensional materials and their van der Waals heterostructures, Moiré materials, Floquet time crystals, as well as materials and devices for quantum computation with Majorana fermions. In this Roadmap collection we aim to capture a snapshot of the most recent developments in the field, and to identify outstanding challenges and emerging opportunities. The format of the Roadmap, whereby experts in each discipline share their viewpoint and articulate their vision for quantum materials, reflects the dynamic and multifaceted nature of this research area, and is meant to encourage exchanges and discussions across traditional disciplinary boundaries. It is our hope that this collective vision will contribute to sparking new fascinating questions and activities at the intersection of materials science, condensed matter physics, device engineering, and quantum information, and to shaping a clearer landscape of quantum materials science as a new frontier of interdisciplinary scientific inquiry. We stress that this article is not meant to be a fully comprehensive review but rather an up-to-date snapshot of different areas of research on quantum materials with a minimal number of references focusing on the latest developments.

2D materials↗

Enhancing detection of topological order by local error correction

The exploration of topologically-ordered states of matter is a long-standing goal at the interface of several subfields of the physical sciences. Such states feature intriguing physical properties such as long-range entanglement, emergent gauge fields and non-local correlations, and can aid in realization of scalable fault-tolerant quantum computation. However, these same features also make creation, detection, and characterization of topologically-ordered states particularly challenging. Motivated by recent experimental demonstrations, we introduce a paradigm for quantifying topological states—locally error-corrected decoration (LED)—by combining methods of error correction with ideas of renormalization-group flow. Our approach allows for efficient and robust identification of topological order, and is applicable in the presence of incoherent noise sources, making it particularly suitable for realistic experiments. We demonstrate the power of LED using numerical simulations of the toric code under a variety of perturbations. We subsequently apply it to an experimental realization, providing new insights into a quantum spin liquid created on a Rydberg-atom simulator. Finally, we extend LED to generic topological phases, including those with non-abelian order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Intrinsic and induced quantum quenches for enhancing qubit-based quantum noise spectroscopy

Quantum sensing protocols that exploit the dephasing of a probe qubit are powerful and ubiquitous methods for interrogating an unknown environment. They have a variety of applications, ranging from noise mitigation in quantum processors, to the study of correlated electron states. Here, we discuss a simple strategy for enhancing these methods, based on the fact that they often give rise to an inadvertent quench of the probed system: there is an effective sudden change in the environmental Hamiltonian at the start of the sensing protocol. These quenches are extremely sensitive to the initial environmental state, and lead to observable changes in the sensor qubit evolution. We show how these new features give access to environmental response properties. This enables methods for direct measurement of bath temperature, and for detecting non-thermal equilibrium states. We also discuss how to deliberately control and modulate this quench physics, which enables reconstruction of the bath spectral function. Extensions to non-Gaussian quantum baths are also discussed, as is the application of our ideas to a range of sensing platforms (e.g., nitrogen-vacancy (NV) centers in diamond, semiconductor quantum dots, and superconducting circuits).

59 BASIC BIOLOGICAL SCIENCES↗

Field programmable spin arrays for scalable quantum repeaters

The large scale control over thousands of quantum emitters desired by quantum network technology is limited by the power consumption and cross-talk inherent in current microwave techniques. Here we propose a quantum repeater architecture based on densely-packed diamond color centers (CCs) in a programmable electrode array, with quantum gates driven by electric or strain fields. This ‘field programmable spin array’ (FPSA) enables high-speed spin control of individual CCs with low cross-talk and power dissipation. Integrated in a slow-light waveguide for efficient optical coupling, the FPSA serves as a quantum interface for optically-mediated entanglement. We evaluate the performance of the FPSA architecture in comparison to a routing-tree design and show an increased entanglement generation rate scaling into the thousand-qubit regime. Our results enable high fidelity control of dense quantum emitter arrays for scalable networking.

42 ENGINEERING↗

Studying phonon coherence with a quantum sensor

Nanomechanical oscillators offer numerous advantages for quantum technologies. Their integration with superconducting qubits shows promise for hardware-efficient quantum error-correction protocols involving superpositions of mechanical coherent states. Limitations of this approach include mechanical decoherence processes, particularly two-level system (TLS) defects, which have been widely studied using classical fields and detectors. In this manuscript, we use a superconducting qubit as a quantum sensor to perform phonon number-resolved measurements on a piezoelectrically coupled phononic crystal cavity. This enables a high-resolution study of mechanical dissipation and dephasing in coherent states of variable size ($\overline{n}$ ≃ 1 – 10 phonons). We observe nonexponential relaxation and state size-dependent reduction of the dephasing rate, which we attribute to TLS. Using a numerical model, we reproduce the dissipation signatures (and to a lesser extent, the dephasing signatures) via emission into a small ensemble (N = 5) of rapidly dephasing TLS. Our findings comprise a detailed examination of TLS-induced phonon decoherence in the quantum regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational quantum state eigensolver

Extracting eigenvalues and eigenvectors of exponentially large matrices will be an important application of near-term quantum computers. The variational quantum eigensolver (VQE) treats the case when the matrix is a Hamiltonian. Here, we address the case when the matrix is a density matrix ρ. We introduce the variational quantum state eigensolver (VQSE), which is analogous to VQE in that it variationally learns the largest eigenvalues of ρ as well as a gate sequence V that prepares the corresponding eigenvectors. VQSE exploits the connection between diagonalization and majorization to define a cost function C=Tr(ρ~H) where H is a non-degenerate Hamiltonian. Due to Schur-concavity, C is minimized when ρ~=VρV† is diagonal in the eigenbasis of H. VQSE only requires a single copy of ρ (only n qubits) per iteration of the VQSE algorithm, making it amenable for near-term implementation. We heuristically demonstrate two applications of VQSE: (1) Principal component analysis, and (2) Error mitigation.

97 MATHEMATICS AND COMPUTING↗

Logical quantum processor based on reconfigurable atom arrays

Suppressing errors is the central challenge for useful quantum computing, requiring quantum error correction (QEC) for large-scale processing. However, the overhead in the realization of error-corrected ‘logical’ qubits, in which information is encoded across many physical qubits for redundancy, poses substantial challenges to large-scale logical quantum computing. Here we report the realization of a programmable quantum processor based on encoded logical qubits operating with up to 280 physical qubits. Using logical-level control and a zoned architecture in reconfigurable neutral-atom arrays, our system combines high two-qubit gate fidelities, arbitrary connectivity, as well as fully programmable single-qubit rotations and mid-circuit readout. Operating this logical processor with various types of encoding, we demonstrate improvement of a two-qubit logic gate by scaling surface-code distance from d = 3 to d = 7, preparation of colour-code qubits with break-even fidelities, fault-tolerant creation of logical Greenberger–Horne–Zeilinger (GHZ) states and feedforward entanglement teleportation, as well as operation of 40 colour-code qubits. Finally, using 3D [[8,3,2]] code blocks, we realize computationally complex sampling circuits with up to 48 logical qubits entangled with hypercube connectivity with 228 logical two-qubit gates and 48 logical CCZ gates. We find that this logical encoding substantially improves algorithmic performance with error detection, outperforming physical-qubit fidelities at both cross-entropy benchmarking and quantum simulations of fast scrambling. These results herald the advent of early error-corrected quantum computation and chart a path towards large-scale logical processors.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum-parallel vectorized data encodings and computations on trapped-ion and transmon QPUs

Compact data representations in quantum systems are crucial for the development of quantum algorithms for data analysis. In this study, we present two innovative data encoding techniques, known as QCrank and QBArt, which exhibit significant quantum parallelism via uniformly controlled rotation gates. The QCrank method encodes a series of real-valued data as rotations on data qubits, resulting in increased storage capacity. On the other hand, QBArt directly incorporates a binary representation of the data within the computational basis, requiring fewer quantum measurements and enabling well-established arithmetic operations on binary data. We showcase various applications of the proposed encoding methods for various data types. Notably, we demonstrate quantum algorithms for tasks such as DNA pattern matching, Hamming weight computation, complex value conjugation, and the retrieval of a binary image with 384 pixels, all executed on the Quantinuum trapped-ion QPU. Furthermore, we employ several cloud-accessible QPUs, including those from IBMQ and IonQ, to conduct supplementary benchmarking experiments.

97 MATHEMATICS AND COMPUTING↗

Fast optical transport of ultracold molecules over long distances

Abstract Optically trapped laser-cooled polar molecules hold promise for new science and technology in quantum information and quantum simulation. Large numerical aperture optical access and long trap lifetimes are needed for many studies, but these requirements are challenging to achieve in a magneto-optical trap (MOT) vacuum chamber that is connected to a cryogenic buffer gas beam source, as is the case for all molecule laser cooling experiments so far. Long distance transport of molecules greatly eases fulfilling these requirements as molecules are placed into a region separate from the MOT chamber. We realize a fast transport method for ultracold molecules based on an electronically focus-tunable lens combined with an optical lattice. The high transport speed is achieved by the 1D red-detuned optical lattice, which is generated by interference of a focus-tunable laser beam and a focus-fixed laser beam. Efficiency of 48(8)% is realized in the transport of ultracold calcium monofluoride (CaF) molecules over 46 cm distance in 50 ms, with a moderate heating from 32(2) μ K to 53(4) μ K. Positional stability of the molecular cloud allows for stable loading of an optical tweezer array with single molecules.

74 ATOMIC AND MOLECULAR PHYSICS↗

Enhancement of Rydberg Blockade via Microwave Dressing

Experimental control over the strength and angular dependence of interactions between atoms is a key capability for advancing quantum technologies. Here, in this work, we use microwave dressing to manipulate and enhance Rydberg-Rydberg interactions in an atomic ensemble. By varying the cloud length relative to the blockade radius and measuring the statistics of the light retrieved from the ensemble, we demonstrate a clear enhancement of the interaction strength due to microwave dressing. These results are successfully captured by a theoretical model that accounts for the excitation dynamics, atomic density distribution, and phase-matched retrieval efficiency. Our approach offers a versatile platform for further engineering interactions by exploiting additional features of the microwave fields, such as polarization and detuning, opening pathways for new quantum control strategies.

collective effects in quantum optics↗

Reformulation of the No-Free-Lunch Theorem for Entangled Datasets

The No-Free-Lunch (NFL) theorem is a celebrated result in learning theory that limits one’s ability to learn a function with a training data set. With the recent rise of quantum machine learning, it is natural to ask whether there is a quantum analog of the NFL theorem, which would restrict a quantum computer’s ability to learn a unitary process with quantum training data. However, in the quantum setting, the training data can possess entanglement, a strong correlation with no classical analog. In this work, we show that entangled data sets lead to an apparent violation of the (classical) NFL theorem. This motivates a reformulation that accounts for the degree of entanglement in the training set. As our main result, we prove a quantum NFL theorem whereby the fundamental limit on the learnability of a unitary is reduced by entanglement. We employ Rigetti's quantum computer to test both the classical and quantum NFL theorems. In conclusion, our work establishes that entanglement is a commodity in quantum machine learning.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗