Preparation of an exciton condensate of photons on a 53-qubit quantum computer
Not Available
79 ASTRONOMY AND ASTROPHYSICS↗
SEARCH · Engineering Papers
Results for “Quantum Computing Qubit”
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.
How to benchmark a 100-qubit quantum computer using fewer than 100 circuits.
Abstract not provided.
Proctor, Timothy↗
Quantum computing using chiral qubits
An apparatus for performing quantum computing includes multiple qubits, each of at least a subset of the qubits comprising a loop formed of a Dirac or Weyl semimetal and having at least two stable quantum states. The apparatus further includes at least one terahertz cavity coupled with the qubits, the terahertz cavity being configured to detect the quantum states of the qubits. Each of at least the subset of qubits is configured to receive a circularly polarized radiation source. The radiation source is adapted to excite a chiral current in each of at least the subset of qubits, the quantum states of the plurality of qubits being a function of the chiral current.
97 MATHEMATICS AND COMPUTING↗
Quantum Algorithm Implementations for Beginners
As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.
97 MATHEMATICS AND COMPUTING↗
Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model
Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits
Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods have been proposed to mitigate the impact of noise on variational algorithms, including several that model the noise as damping expectation values of observables. In this work, we benchmark various methods, including a new method proposed here. Here, we compare their performance in estimating the ground-state energies of several instances of the 1D mixed-field Ising model using the variational-quantum-eigensolver algorithm with up to 20 qubits on two of IBM's quantum computers. We find that several error-mitigation techniques allow us to recover energies to within 10% of the true values for circuits containing up to about 25 ansatz layers, where each layer consists of CNOT gates between all neighboring qubits and Y-rotations on all qubits.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Measuring and Simulating T1 and T2 for Qubits
Quantum computers perform computations exploiting quantum mechanics to a possible advantage, allowing us to prepare and manipulate states that do not have a classical equivalent. In particular, phenomena like superposition and entanglement may enable quantum computers to outperform their classical counterparts in certain applications. Implementing these useful quantum algorithms is contingent upon building accurate quantum hardware that is not affected by noise. Environmental noise decreases coherence time of qubits, meaning that qubits do not stay in a desired state long enough to carry out a complex computation. To that end, harnessing the full power of quantum computers necessitate characterization of noise sources and how they impact a given quantum system. Often times, T1and T2 are used to quantify noise. In this project, we provide an approach as to how T1 and T2 values are calculated and simulated for quantum systems. In addition, we compare simulated values of T1 and T2 with those of real quantum computer’s measurements. IBMQ Experience, an open source software allowing users to simulate and use real quantum hardware, is used. QuTip, a Python-based toolbox offering quantum simulation tools for open quantum systems, is also used.
Youssef, Rahaf↗
(3 + 1)-dimensional Schwinger pair production with quantum computers
Real-time quantum simulation of quantum field theory in (3+1)D requires large quantum computing resources. With a few-qubit quantum computer, we develop a novel algorithm and experimentally study the Schwinger effect, the electron-positron pair production in a strong electric field, in (3+1)D. The resource reduction is achieved by treating the electric field as a background field, working in Fourier space transverse to the electric field direction, and considering parity symmetry, such that we successfully map the three spatial dimension problems into one spatial dimension problems. In this work, we observe that the rate of pair production of electrons and positrons is consistent with the theoretical predication of the Schwinger effect. Our work paves the way towards exploring quantum simulation of quantum field theory beyond one spatial dimension.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
\texttt{qec\_code\_sim}: An open-source Python framework for estimating the effectiveness of quantum-error correcting codes on superconducting qubits
Quantum computers are highly susceptible to errors due to unintended interactions with their environment. It is crucial to correct these errors without gaining information about the quantum state, which would result in its destruction through back-action. Quantum Error Correction (QEC) provides information about occurred errors without compromising the quantum state of the system. However, the implementation of QEC has proven to be challenging due to the current performance levels of qubits -- break-even requires fabrication and operation quality that is beyond the state-of-the-art. Understanding how qubit performance factors into the success of a QEC code is a valuable exercise for tracking progress towards fault-tolerant quantum computing. Here we present \texttt{qec\_code\_sim}, an open-source, lightweight Python framework for studying the performance of small quantum error correcting codes under the influence of a realistic error model appropriate for superconducting transmon qubits, with the goal of enabling useful hardware studies and experiments. \texttt{qec\_code\_sim} requires minimal software dependencies and prioritizes ease of use, ease of change, and pedagogy over execution speed. As such, it is a tool well-suited to small teams studying systems on the order of one dozen qubits.
Lopez, Santiago↗
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↗
A Perspective on Quantum Computing Applications in Quantum Chemistry Using 25-100 Logical Qubits
The intersection of quantum computing and quantum chemistry represents a promising frontier for achieving quantum utility in domains of both scientific and societal relevance. Owing to the exponential growth of classical resource requirements for simulating quantum systems, quantum chemistry has long been recognized as a natural candidate for quantum computation. This perspective focuses on identifying scientifically meaningful use cases where early fault-tolerant quantum computers, which are considered to be equipped with approximately 25-100 logical qubits, could deliver tangible impact. While recent advances in classical computing have pushed the boundaries of tractable simulations to unprecedented scales, this logical-qubit regime represents the first window where quantum devices can pursue qualitatively distinct strategies, such as polynomial-scaling phase estimation, direct simulation of quantum dynamics, and active-space embedding, that remain challenging for classical solvers, such as multireference charge-transfer and conical-intersection states central to photochemistry and materials design. We highlight near-term opportunities in algorithm and software design, discuss representative chemical problems suited for quantum acceleration, and propose strategic roadmaps and collaborative pathways for advancing practical quantum utility in quantum chemistry.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Fundamental understanding of magnetic vortex dynamics on superconducting qubits for quantum computing
Explore the source record for details and available documents.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Open quantum system violates generalized Pauli constraints on quantum device
Abstract The Pauli exclusion principle governs the fundamental structure and function of fermionic systems from molecules to materials. Nonetheless, when such a fermionic system is in a pure state, it is subject to additional restrictions known as the generalized Pauli constraints (GPCs). Here we verify experimentally the violation of the GPCs for an open quantum system using data from a superconducting-qubit quantum computer. We prepare states of systems with three-to-seven qubits directly on the quantum device and measure the one-fermion reduced density matrix (1-RDM) from which we can test the GPCs. We find that the GPCs of the 1-RDM are sufficiently sensitive to detect the openness of the 3-to-7 qubit systems in the presence of a single-qubit environment. Results confirm experimentally that the openness of a many-fermion quantum system can be decoded from only a knowledge of the 1-RDM with potential applications from quantum computing and sensing to noise-assisted energy transfer.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Quantum Computing with Exciton Qubits in Colloidal Semiconductor Nanocrystals
The present work evaluates the feasibility of quantum computing with exciton qubits in coupled colloidal semiconductor nanocrystals (NCs). A strategy for manipulating two-qubit states of colloidal NC hetero-dimers is described. We show that a sequence of laser pulses with the same photon energy can bring excitonic states of a nanocrystal hetero-dimer into entanglement and perform arbitrary qubit rotations (quantum gates). Our simulations of a realistic two-particle assembly of CdSe/CdS core/shell NCs demonstrate that such two-qubit gate operations can be driven by optical parametric oscillators with a theoretical error of 0.1%. Furthermore, a strategy for upscaling two-qubit hetero-dimers to N-qubit exciton gates in semiconductor NC assemblies is discussed.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Sachdev-Ye-Kitaev model on a noisy quantum computer
Here we study the SYK model -- an important toy model for quantum gravity on IBM's superconducting qubit quantum computers. By using a graph-coloring algorithm to minimize the number of commuting clusters of terms in the qubitized Hamiltonian, we find the gate complexity of the time evolution using the first-order product formula for N Majorana fermions is $\mathscr{O}$(N 5 J 2 t 2 /ε) where J is the dimensionful coupling parameter, t is the evolution time, and ε is the desired precision. With this improved resource requirement, we perform the time evolution for N=6,8 with maximum two-qubit circuit depth of 343. We perform different error mitigation schemes on the noisy hardware results and find good agreement with the exact diagonalization results on classical computers and noiseless simulators. In particular, we compute return probability after time t and out-of-time order correlators (OTOC) which is a standard observable of quantifying the chaotic nature of quantum systems.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Enhancing Qubit Readout with Autoencoders
In addition to the need for stable and precisely controllable qubits, quantum computers take advantage of good readout schemes. Superconducting qubit states can be inferred from the readout signal transmitted through a dispersively coupled resonator. Here, this work proposes a readout classification method for superconducting qubits based on a neural network pretrained with an autoencoder approach. A neural network is pretrained with qubit readout signals as autoencoders in order to extract relevant features from the data set. Afterward, the pretrained-network inner-layer values are used to perform a classification of the inputs in a supervised manner. We demonstrate that this method can enhance classification performance, particularly for short- and long-time measurements where more traditional methods present inferior performance.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge
Here, tools necessary for quantum simulations of 1+1 dimensional quantum chromodynamics are developed. When formulated in axial gauge and with two flavors of quarks, this system requires 12 qubits per spatial site with the gauge fields included via nonlocal interactions. Classical computations and D-wave’s quantum annealer advantage are used to determine the hadronic spectrum, enabling a decomposition of the masses and a study of quark entanglement. Color “edge” states confined within a screening length of the end of the lattice are found. IBM’s seven-qubit quantum computers, ibmq_jakarta and ibm_perth, are used to compute dynamics from the trivial vacuum in one-flavor QCD with one spatial site. More generally, the Hamiltonian and quantum circuits for time evolution of 1+1 dimensional SU(N c ) gauge theory with Nf flavors of quarks are developed, and the resource requirements for large-scale quantum simulations are estimated.
1+1 dimensions↗
Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes
We introduce a framework for simulating, on an ( n + 1 )-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2 n modes. Specifically, we encode the initial bosonic state’s expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼ 8 × 10 9 modes, illustrating the power of our framework. Published by the American Physical Society 2025
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗