Refining quantum computing models by removing gauge freedom
Explore the source record for details and available documents.
Gonzalez De Mendoza Prada, Juan Jesus [Sandia Nati↗
SEARCH · Engineering Papers
Results for “quantum computing models”
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.
Endo-Fullerene and Doped Diamond Nanocrystallite Based Models of Qubits for Solid-State Quantum Computers
Models of encapsulated 1/2 nuclear spin H-1 and P-31 atoms in fullerene and diamond nanocrystallite, respectively, are proposed and examined with ab-initio local density functional method for possible applications as single quantum bits (qubits) in solid-state quantum computers. A H-1 atom encapsulated in a fully deuterated fullerene, C(sub 20)D(sub 20), forms the first model system and ab-initio calculation shows that H-1 atom is stable in atomic state at the center of the fullerene with a barrier of about 1 eV to escape. A P-31 atom positioned at the center of a diamond nanocrystallite is the second model system, and 3 1P atom is found to be stable at the substitutional site relative to interstitial sites by 15 eV, Vacancy formation energy is 6 eV in diamond so that substitutional P-31 atom will be stable against diffusion during the formation mechanisms within the nanocrystallite. The coupling between the nuclear spin and weakly bound (valance) donor electron coupling in both systems is found to be suitable for single qubit applications, where as the spatial distributions of (valance) donor electron wave functions are found to be preferentially spread along certain lattice directions facilitating two or more qubit applications. The feasibility of the fabrication pathways for both model solid-state qubit systems within practical quantum computers is discussed with in the context of our proposed solid-state qubits.
Park, Seongjun↗
Cost of emulating a small quantum annealing problem in the circuit model
Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.
Quantum algorithms & computation↗
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↗
Multireference Embedding and Fragmentation Methods for Classical and Quantum Computers: From Model Systems to Realistic Applications
One of the primary challenges in quantum chemistry is the accurate modeling of strong electron correlation. While multireference methods effectively capture such correlation, their steep scaling with system size prohibits their application to large molecules and extended materials. Quantum embedding offers a promising solution by partitioning complex systems into manageable subsystems. In this Review, we highlight recent advances in multireference density matrix embedding and localized active space self-consistent field approaches for complex molecules and extended materials. We discuss both classical implementations and the emerging potential of these methods on quantum computers. Here, by extending classical embedding concepts to the quantum landscape, these algorithms have the potential to expand the reach of multireference methods in quantum chemistry and materials.
Algorithms↗
Exploring Network-Related Optimization Problems Using Quantum Heuristics
Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics.One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.
Wang, Zhihui↗
Study network-related optimization problems using quantum alternating optimization ansatz
Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.
Zhihui Wang↗
Quantum Computation Using Optically Coupled Quantum Dot Arrays
A solid state model for quantum computation has potential advantages in terms of the ease of fabrication, characterization, and integration. The fundamental requirements for a quantum computer involve the realization of basic processing units (qubits), and a scheme for controlled switching and coupling among the qubits, which enables one to perform controlled operations on qubits. We propose a model for quantum computation based on optically coupled quantum dot arrays, which is computationally similar to the atomic model proposed by Cirac and Zoller. In this model, individual qubits are comprised of two coupled quantum dots, and an array of these basic units is placed in an optical cavity. Switching among the states of the individual units is done by controlled laser pulses via near field interaction using the NSOM technology. Controlled rotations involving two or more qubits are performed via common cavity mode photon. We have calculated critical times, including the spontaneous emission and switching times, and show that they are comparable to the best times projected for other proposed models of quantum computation. We have also shown the feasibility of accessing individual quantum dots using the NSOM technology by calculating the photon density at the tip, and estimating the power necessary to perform the basic controlled operations. We are currently in the process of estimating the decoherence times for this system; however, we have formulated initial arguments which seem to indicate that the decoherence times will be comparable, if not longer, than many other proposed models.
Pradhan, Prabhakar↗
Quantum-accelerated Global Constraint Filtering
Motivated by recent advances in quantum algorithms and gate-model quantum computation, we introduce quantum-accelerated filtering algorithms for global constraints in constraint programming. We adapt recent work in quantum algorithms for graph problems and identify quantum subroutines that accelerate the main domain consistency algorithms for the all different constraint and the global cardinality constraint (gcc). The subroutines are based on quantum algorithms for finding maximum matchings and strongly connected components in graphs, and provide speedups over the best classical algorithms. We detail both complete and bounded-probability frameworks for quantum-accelerated global constraint filtering algorithms within backtracking search.
Quantum algorithms↗
Two-dimensional coherent spectrum of high-spin models via a quantum computing approach
Here in this work we present and benchmark a quantum computing approach to calculate the two-dimensional coherent spectrum (2DCS) of high-spin models. Our approach is based on simulating their real-time dynamics in the presence of several magnetic field pulses, which are spaced in time. We utilize the adaptive variational quantum dynamics simulation algorithm for the study due to its compact circuits, which enables simulations over sufficiently long times to achieve the required resolution in frequency space. Specifically, we consider an antiferromagnetic quantum spin model that incorporates Dzyaloshinskii-Moriya interactions and single-ion anisotropy. The obtained 2DCS spectra exhibit distinct peaks at multiples of the magnon frequency, arising from transitions between different eigenstates of the unperturbed Hamiltonian. By comparing the one-dimensional coherent spectrum with 2DCS, we demonstrate that 2DCS provides a higher resolution of the energy spectrum. We further investigate how the quantum resources scale with the magnitude of the spin using two different binary encodings of the high-spin operators: the standard binary encoding and the Gray code. At low magnetic fields both encodings require comparable quantum resources, but at larger field strengths the Gray code is advantageous. Numerical simulations for spin models with increasing number of sites indicate a polynomial system-size scaling for quantum resources. Lastly, we compare the numerical 2DCS with experimental results on a rare-earth orthoferrite system. The observed strength of the magnonic high-harmonic generation signals in the 2DCS of the quantum high-spin model aligns well with the experimental data, showing significant improvement over the corresponding mean-field results.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer
We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.
97 MATHEMATICS AND COMPUTING↗
Downfolding Complex Materials Problems Onto Model Hamiltonians for Quantum Computers
Simulating the properties of quantum materials is expected to be one of the exciting applications for quantum computers and where we hope to see advantages over classical hardware. The complexity of ab initio Hamiltonians describing the physics of application-relevant materials places them beyond the realm of possibility for solution on near-term hardware with a limited number of qubits. Various Hamiltonian approximations, including Hamiltonian downfolding, offers a possibility towards simulating complex materials on near-term hardware. This is accomplished by approximating the relevant physics of a given material through their representation by simpler model Hamiltonians, such as the Hubbard Hamiltonian or extensions of it. Here we employ a well-defined first-principles methodology for deriving downfolded multi-band extended Hubbard Hamiltonians of materials, capturing strong electronic correlation and electron-phonon coupling, based on the formalism of Wannier functions and the calculation of the screened Coulomb interaction. We demonstrate for a variety of systems that quantum simulation of these downfolded Hamiltonians reproduces key properties, thus establishing downfolding as a promising route to achieve near-term simulation of application-relevant systems on quantum hardware.
Antonios Markos Alvertis↗
Downfolding complex materials problems onto model Hamiltonians for quantum computers
Simulating the properties of quantum materials is expected to be one of the exciting applications for quantum computers and where we hope to see advantages over classical hardware. The complexity of ab initio Hamiltonians describing the physics of application-relevant materials places them beyond the realm of possibility for solution on near-term hardware with a limited number of qubits. Various Hamiltonian approximations, including Hamiltonian downfolding, offers a possibility towards simulating complex materials on near-term hardware. This is accomplished by approximating the relevant physics of a given material through their representation by simpler model Hamiltonians, such as the Hubbard Hamiltonian or extensions of it. Here we employ a well-defined first-principles methodology for deriving downfolded multi-band extended Hubbard Hamiltonians of materials, capturing strong electronic correlation and electron-phonon coupling, based on the formalism of Wannier functions and the calculation of the screened Coulomb interaction. We demonstrate for a variety of systems that quantum simulation of these downfolded Hamiltonians reproduces key properties, thus establishing downfolding as a promising route to achieve near-term simulation of application-relevant systems on quantum hardware.
Antonios M. Alvertis↗
Spin-Controllable Dynamics in Defect-Engineered Carbon Nanotubes as Single Photon Emitters: Data-Driven Modeling and Computations
Quantum technologies, such as quantum computing and sensing, require efficient single-photon emission (SPE) sources that operate at room temperature in telecom wavelengths. While several materials can serve as SPE sources, no single platform meets all the criteria for efficiency, ambient operation, and scalability. Single-walled carbon nanotubes (SWCNTs) with covalently attached molecules offer a promising solution. Their SPE can be easily tuned via modifications of the SWCNT's diameter, chirality, and bonded molecules, enabling emission across near-IR to telecom wavelengths at ambient conditions. However, to fully realize the potential of SWCNTs and unlock their quantum capabilities, a deeper understanding of how structural defects from molecular adducts affect their emission and competing photoexcited processes is essential. To address this gap in our knowledge, this project combined quantum chemistry calculations with data-driven methods of cheminformatics (QSAR) and machine learning (ML). The developed computational approaches have provided several design strategies for covalent functionalization of SWCNTs to improve their optical response. The collaboration with Los Alamos National Lab (LANL) enabled direct comparison of computational and experimental data, facilitating method validation. This partnership was enhanced through access to LANL's Center for Integrated Nanotechnologies (CINT) utilizing User Facility Program and summer internships, which provided three NDSU graduate students with hands-on experience at LANL. The outcomes of this project included (1) Advancing the current stage of computational methods in accurate modeling of non-adiabatic spin-dependent photoexcited dynamics and its applicability to nanosystems consisting of thousands of atoms, realized as open-access codes linked to existing DFT-based software; (2) Establishing the relationship between the structure of adducts and SWCNTs and intrinsic excitonic and spin properties of defect states for guiding novel synthetic strategies and experimental probes of chemically functionalized SWCNTs as near-IR emitting materials; (3) Generating virtual libraries of hypothetical functionalized SWCNTs for virtual screening of their chemical structures and optical properties, leveraging new functionalities of SWCNTs; (4) Offering a unique experience for NDSU graduate students that prepared them for future scientific careers related to materials modeling and big data processing. These results were summarized in 12 published journal papers and 3 recently submitted papers. One of a key finding is that the position of defect sites on the SWCNT surface primarily drives the emission redshift (up to 100 meV), while the polarity of the defect-inducing molecules has a much smaller effect (~10 meV). However, the electron-donating or withdrawing properties of a molecule influence selecting reactivity of defect sites. These insights important for optimizing synthetic protocols for desired emissions in SWCNTs. We also revealed that the interaction between two defects at various positions on the SWCNT enhances the redshift and optical activity of states, favoring strong near-IR emission. This suggests that manipulations in defect concentrations is a promising strategy for controlling efficient emission. Mostly important, the defect position was found controllable by the spin states of photoexcited intermediates: Excited aromatic molecules form ortho defects with SWCNTs at their singlet states in the presence of oxygen, while oxygen-free conditions favor para defects via the triplet-state mechanism. Additionally, a heat-activated [2+2] cycloaddition reaction facilitates divalent defect formation with fewer bonding positions that narrows emission bands. These groundbreaking findings have been experimentally validated and significantly advance our understanding of defect chemistry in SWCNTs. Using a novel encoding technique and 3D-MoRSE descriptors, we developed highly accurate ML/QSAR models to predict both the 3D structure and optical properties of SWCNTs with chemical defects. This model enabled the creation of a virtual library of 125,556 structures, providing new insights into the relationship between SWCNT-defect structure and emission.
77 NANOSCIENCE AND NANOTECHNOLOGY↗
Probing the Kitaev honeycomb model on a neutral-atom quantum computer
Quantum simulations of many-body systems are among the most promising applications of quantum computers. In particular, models based on strongly correlated fermions are central to our understanding of quantum chemistry and materials problems, and can lead to exotic, topological phases of matter. However, owing to the non-local nature of fermions, such models are challenging to simulate with qubit devices. Here we realize a digital quantum simulation architecture for two-dimensional fermionic systems based on reconfigurable atom arrays. We utilize a fermion-to-qubit mapping based on Kitaev’s model on a honeycomb lattice, in which fermionic statistics are encoded using long-range entangled states. We prepare these states efficiently using measurement and feedforward, realize subsequent fermionic evolution through Floquet engineering with tunable entangling gates interspersed with atom rearrangement, and improve results with built-in error detection. Leveraging this fermion description of the Kitaev spin model, we efficiently prepare topological states across its complex phase diagram and verify the non-Abelian spin-liquid phase by evaluating an odd Chern number. We further explore this two-dimensional fermion system by realizing tunable dynamics and directly probing fermion exchange statistics. Finally, we simulate strong interactions and study the dynamics of the Fermi–Hubbard model on a square lattice. These results pave the way for digital quantum simulations of complex fermionic systems for materials science, chemistry and high-energy physics.
atomic and molecular physics↗
Boson sampling with Gaussian input states: Toward efficient scaling and certification
A universal quantum computer of large scale is not available yet, however, intermediate models of quantum computation would still permit demonstrations of a quantum computational advantage over classical computing and could challenge the Extended Church-Turing Thesis. One of these models based on single photons interacting via linear optics is called Boson Sampling. Although Boson Sampling was demonstrated and the threshold to claim quantum computational advantage was achieved, the question of how to scale up Boson Sampling experiments remains. To make progress with this problem, here we present a practically achievable pathway to scale Boson Sampling experiments by combining continuous-variable quantum information and temporal encoding. Here, we propose the combination of switchable dual-homodyne and single-photon detections, the temporal loop technique, and scattershot-based Boson Sampling. We detail the required assumptions for concluding computational hardness for this configuration. Furthermore, this particular combination of techniques moves towards an efficient scaling and certification of Boson Sampling, all in a single experimental setup.
79 ASTRONOMY AND ASTROPHYSICS↗
Quantum computing for energy correlators
In recent years, energy correlators have emerged as powerful observables for probing the fragmentation dynamics of high-energy collisions. We introduce the first numerical strategy for calculating energy correlators using the Hamiltonian lattice approach, providing access to the intriguing nonperturbative dynamics of these observables. Furthermore, motivated by rapid advances in quantum computing hardware and algorithms, we propose a quantum algorithm for calculating energy correlators in quantum field theories. This algorithm includes ground state preparation, the application of source, sink, energy flux and real-time evolution operators, and the Hadamard test. We validate our approach by applying it to the SU(2) pure gauge theory in 2 + 1 dimensions on 3 × 3 and 5 × 5 honeycomb lattices with 𝑗 max = $\frac{1}{2}$ at various couplings, utilizing both classical methods and the quantum algorithm, the latter tested using the IBM emulator for specific configurations. The results are consistent with the expected behavior of the strong coupling regime and motivate a more comprehensive study to probe the confinement dynamics across the weak and strong coupling regimes.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Steps toward quantum simulations of hadronization and energy loss in dense matter
A framework for simulating the real-time dynamics of composite particles in a simple model of dense matter that is amenable to quantum computers is developed. As a demonstration, we perform classical simulations of heavy-hadrons propagating through a dense medium in the Schwinger model. Measurements of the time-dependent energy and charge density are used to identify mechanisms responsible for energy loss and hadron production (hadronization). A study of entanglement dynamics highlights the importance of quantum coherence between the particles that make up the dense medium. Throughout this work, care is taken to isolate, and remove, phenomena that arise solely from a finite lattice spacing. It is found that signatures of entanglement are more sensitive to lattice artifacts than other observables. Toward quantum simulations, we present an efficient method and the corresponding quantum circuits for preparing ground states in the presence of heavy mesons. Finally, these circuits are used to estimate the resources required to simulate in-medium energy loss and hadronization in the Schwinger model using quantum computers.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗