Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computer”

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 343 records · Page 19

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗

Quantum computation architecture using optical tweezers

We present a complete architecture for scalable quantum computation with ultracold atoms in optical lattices using optical tweezers focused to the size of a lattice spacing. We discuss three different two-qubit gates based on local collisional interactions. The gates between arbitrary qubits require the transport of atoms to neighboring sites. We numerically optimize the nonadiabatic transport of the atoms through the lattice and the intensity ramps of the optical tweezer in order to maximize the gate fidelities. We find overall gate times of a few 100 {mu}s, while keeping the error probability due to vibrational excitations and spontaneous scattering below 10{sup -3}. The requirements on the positioning error and intensity noise of the optical tweezer and the magnetic field stability are analyzed and we show that atoms in optical lattices could meet the requirements for fault-tolerant scalable quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sensor-Assisted Fault Mitigation in Quantum Computation

We propose a method for assisting fault mitigation in quantum computation through the use of sensors, co-located near physical qubits. Specifically, we consider using transition edge sensors co-located on silicon substrates hosting superconducting qubits to monitor for energy injection from ionizing radiation that has been demonstrated to increase decoherence in transmon qubits. We generalize from these two physical device concepts and explore the potential advantages of co-located sensors to assist fault mitigation in quantum computation. In the simplest scheme, co-located sensors beneficially assist rejection of calculations potentially affected by environmental disturbances. Investigating the potential computational advantage further required development of an extension to the standard formulation of quantum error correction. In a specific case the standard three-qubit, bit flip quantum correction code, we show that given a 20% overall error probability per qubit, approximately 90% of repeated calculation attempts are correctable. However, when sensor-detectable errors account for 45% of overall error probability, the use of colocated sensors uniquely associated with independent qubits, boosts the fraction of correct final-state calculations to 96% at the cost of rejecting 7% of repeated calculation attempts.

Orrell, John L.↗

Realization of the Werner-Holevo and Landau-Streater Quantum Channels for Qutrits on Quantum Computers.

We realize the Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on IBM quantum computers. These channels correspond to the interaction between a qutrit and its environment that results in the globally unitarily covariant qutrit transformation violating the multiplicativity of the maximal p-norm. Our realization of the LS and WH channels is based on embedding the qutrit states into states of two qubits and using the single-qubit and two-qubit CNOT gates to implement the specific interaction. We employ the standard quantum gates, hence the developed algorithm suits any quantum computer. We run our algorithm on a 5-qubit computer and a 20-qubit computer, as well as on a simulator. We quantify the quality of the implemented channels comparing their action on different input states with theoretical predictions. The overall efficiency is quantified by the fidelity between the theoretical and experimental Choi states implemented on the 20-qubit computer.

completely-positive trace-preserving map↗

Quantum computing hardware for HEP algorithms and sensing

Quantum information science harnesses the principles of quantum mechanics to realize computational algorithms with complexities vastly intractable by current computer platforms. Typical applications range from quantum chemistry to optimization problems and also include simulations for high energy physics. The recent maturing of quantum hardware has triggered preliminary explorations by several institutions (including Fermilab) of quantum hardware capable of demonstrating quantum advantage in multiple domains, from quantum computing to communications, to sensing. The Superconducting Quantum Materials and Systems (SQMS) Center, led by Fermilab, is dedicated to providing breakthroughs in quantum computing and sensing, mediating quantum engineering and HEP based material science. The main goal of the Center is to deploy quantum systems with superior performance tailored to the algorithms used in high energy physics. In this Snowmass paper, we discuss the two most promising superconducting quantum architectures for HEP algorithms, i.e. three-level systems (qutrits) supported by transmon devices coupled to planar devices and multi-level systems (qudits with arbitrary N energy levels) supported by superconducting 3D cavities. For each architecture, we demonstrate exemplary HEP algorithms and identify the current challenges, ongoing work and future opportunities. Furthermore, we discuss the prospects and complexities of interconnecting the different architectures and individual computational nodes. Finally, we review several different strategies of error protection and correction and discuss their potential to improve the performance of the two architectures. This whitepaper seeks to reach out to the HEP community and drive progress in both HEP research and QIS hardware.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗

Resonant dipole – dipole interaction of Rydberg atoms for realisation of quantum computations

We report the application of the resonant dipole – dipole interaction of Rydberg atoms for the realisation of quantum computations with ultracold neutral atoms. Coherent population oscillations between the collective states of systems consisting of two interacting atoms make it possible to implement two-qubit phase gates, which are necessary for universal quantum computations. The schemes studied are alternatives to two-qubit gates based on the Rydberg dipole blockade effect. In contrast, the schemes we propose do not require large dipole – dipole interaction energies and can be realised for atoms that are at a considerable distance from each other. The bibliography includes 27 references. (paper)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Error detection on quantum computers improving the accuracy of chemical calculations

The ultimate goal of quantum error correction is to achieve the fault-tolerance threshold beyond which quantum computers can be made arbitrarily accurate. This requires extraordinary resources and engineering efforts. We show that even without achieving full fault-tolerance, quantum error detection is already useful on the current generation of quantum hardware. We demonstrate this by executing an end-to-end chemical calculation for the hydrogen molecule encoded in the [[4, 2, 2]] quantum error-detecting code. The encoded calculation with logical qubits significantly improves the accuracy of the molecular ground-state energy.

97 MATHEMATICS AND COMPUTING↗

Realization of universal adiabatic quantum computation with fewer physical resources

The adiabatic quantum computation (AQC) has been proved to be equivalent with the standard circuit model. To realize AQC, we have to realize the target Hamiltonian. However, usually the target Hamiltonian contains k-local terms where k{>=}3 which is difficult to realize in experiment. It has been proved that a k-local Hamiltonian can be reduced to a two-local one. However, the reduction process needs a lot of auxiliary qubits which makes the system very complicated. Here we show that one can reduce a three-local Hamiltonian to a two-local one using only one third of the auxiliary qubits the previous approach needs and, in special cases, only three auxiliary qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Critical issues in the formation of quantum computer test structures by ion implantation

The formation of quantum computer test structures in silicon by ion implantation enables the characterization of spin readout mechanisms with ensembles of dopant atoms and the development of single atom devices. We briefly review recent results in the characterization of spin dependent transport and single ion doping and then discuss the diffusion and segregation behaviour of phosphorus, antimony and bismuth ions from low fluence, low energy implantations as characterized through depth profiling by secondary ion mass spectrometry (SIMS). Both phosphorus and bismuth are found to segregate to the SiO2/Si interface during activation anneals, while antimony diffusion is found to be minimal. An effect of the ion charge state on the range of antimony ions, 121Sb25+, in SiO2/Si is also discussed.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Driven-dissipative quantum mechanics on a lattice: Simulating a fermionic reservoir on a quantum computer

The driven-dissipative many-body problem remains one of the most challenging unsolved problems in quantum mechanics. The advent of quantum computers may provide a unique platform for efficiently simulating such driven-dissipative systems. But, there are many choices for how one can engineer the reservoir. One can simply employ ancilla qubits to act as a reservoir and then digitally simulate them via algorithmic cooling. A more attractive approach, which allows one to simulate an infinite reservoir, is to integrate out the bath degrees of freedom and describe the driven-dissipative system via a master equation, that can also be simulated on a quantum computer. In this work, we consider the particular case of noninteracting electrons on a lattice driven by an electric field and coupled to a fermionic thermostat. Then, we provide two different quantum circuits: the first one reconstructs the full dynamics of the system using Trotter steps, while the second one dissipatively prepares the final nonequilibrium steady state in a single step. We run both circuits on the IBM quantum experience. For circuit (i), we achieved up to five Trotter steps. When partial resets become available on quantum computers, we expect that the maximum simulation time can be significantly increased. Lastly, the methods developed here suggest generalizations that can be applied to simulating interacting driven-dissipative systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Simulating long-range coherence of atoms and photons in quantum computers

Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.

Torre, Emanuele Dalla↗

Closed timelike curves in measurement-based quantum computation

Many results have been recently obtained regarding the power of hypothetical closed timelike curves (CTCs) in quantum computation. Here we show that the one-way model of measurement-based quantum computation encompasses in a natural way the CTC model proposed by Bennett, Schumacher, and Svetlichny. We identify a class of CTCs in this model that can be simulated deterministically and point to a fundamental limitation of Deutsch's CTC model which leads to predictions conflicting with those of the one-way model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗

Simulation of Si:P spin-based quantum computer architecture

We present realistic simulation for single and double phosphorous donors in a silicon-based quantum computer design by solving a valley-orbit coupled effective-mass equation for describing phosphorous donors in strained silicon quantum well (QW). Using a generalized unrestricted Hartree-Fock method, we solve the two-electron effective-mass equation with quantum well confinement and realistic gate potentials. The effects of QW width, gate voltages, donor separation, and donor position shift on the lowest singlet and triplet energies and their charge distributions for a neighboring donor pair in the quantum computer(QC) architecture are analyzed. The gate tunability are defined and evaluated for a typical QC design. Estimates are obtained for the duration of spin half-swap gate operation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Strong entanglement causes low gate fidelity in inaccurate one-way quantum computation

We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality that shows that the mean gate fidelity is upper bounded by a decreasing function of the magnitude of the error of the measurement and the amount of the entanglement between the measured qubit and other register qubits. The consequence of this inequality is that, for a given amount of entanglement, which is theoretically calculated once the algorithm is fixed, we can estimate from this inequality how small the magnitude of the error should be in order not to make the gate fidelity below a threshold, which is specified by a technical requirement in a particular experimental setup or by the threshold theorem of the fault-tolerant quantum computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computation of SU(2) lattice gauge theory with continuous variables

We present a quantum computational framework for pure SU(2) lattice gauge theory, using continuous variables instead of discrete qubits to represent the infinite-dimensional Hilbert space of the gauge fields. We consider a ladder as well as a two-dimensional grid of plaquettes, detailing the use of gauge fixing to reduce the degrees of freedom and simplify the Hamiltonian. We demonstrate how system dynamics, ground states, and energy gaps can be computed using the continuous-variable approach to quantum computing. Our results indicate that it is feasible to study non-Abelian gauge theories with continuous variables, providing new avenues for understanding the real-time dynamics of quantum field theories.

Gauge Symmetry↗

Limitations of quantum computing with Gaussian cluster states

We discuss the potential and limitations of Gaussian cluster states for measurement-based quantum computing. Using a framework of Gaussian-projected entangled pair states, we show that no matter what Gaussian local measurements are performed on systems distributed on a general graph, transport and processing of quantum information are not possible beyond a certain influence region, except for exponentially suppressed corrections. We also demonstrate that even under arbitrary non-Gaussian local measurements, slabs of Gaussian cluster states of a finite width cannot carry logical quantum information, even if sophisticated encodings of qubits in continuous-variable systems are allowed for. This is proven by suitably contracting tensor networks representing infinite-dimensional quantum systems. The result can be seen as sharpening the requirements for quantum error correction and fault tolerance for Gaussian cluster states and points toward the necessity of non-Gaussian resource states for measurement-based quantum computing. The results can equally be viewed as referring to Gaussian quantum repeater networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗