Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum Numbers”

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 721 records · Page 40

Quantum Simulations of Fermionic Hamiltonians with Efficient Encoding and Ansatz Schemes

Here, we propose a computational protocol for quantum simulations of fermionic Hamiltonians on a quantum computer, enabling calculations on spin defect systems which were previously not feasible using conventional encodings and a unitary coupled-cluster ansatz of variational quantum eigensolvers. We combine a qubit-efficient encoding scheme mapping Slater determinants onto qubits with a modified qubitcoupled cluster ansatz and noise-mitigation techniques. Our strategy leads to a substantial improvement in the scaling of circuit gate counts and in the number of required qubits, and to a decrease in the number of required variational parameters, thus increasing the resilience to noise. We present results for spin defects of interest for quantum technologies, going beyond minimum models for the negatively charged nitrogen vacancy center in diamonds and the double vacancy in 4H silicon carbide (4H-SiC) and tackling a defect as complex as negatively charged silicon vacancy in 4H-SiC for the first time.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

QFw: A Quantum Framework for Large-scale HPC Ecosystems

This work extends Quantum Framework (QFw) by integrating it with Northwest Quantum Simulator (NWQ-Sim) and by introducing a lightweight python library that allows multiple frontends (e.g., Qiskit) to interact with QFw. This extension enables QFw to flexibly decouple frontends from backends (e.g., NWQ-Sim). We demonstrate this capability by executing a Greenberger-Horne-Zeilinger (GHZ) circuit using Qiskit and Pennylane with NWQ-Sim and Tensor-Network Quantum Virtual-Machine (TN-QVM). QFw enables easy scaling to multiple nodes. We showcase this with scaling tests using GHZ with up to 32 qubits for different number of nodes on the Frontier supercomputer. And, to demonstrate the use of QFw for real world problems, we solve a metamaterial optimization problem, using a Quantum Approximate Optimization Algorithm (QAOA). We observe that QFw over NWQ-Sim marginally improves Qiskit-aer’s accuracy in reaching the lowest energy state. These additions to QFw prepare it to run hybrid applications in a hybrid resource environment since it treats actual quantum hardware and simulators alike.

Chundury, Srikar↗

Benchmarking quantum trial wavefunctions for phaseless auxiliary-field quantum Monte Carlo

The phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) method is a stochastic imaginary-time projection technique for computing ground-state properties of strongly correlated quantum systems, with accuracy that depends critically on the choice of trial wavefunction. Here, we investigate ph-AFQMC with trial states prepared using parameterized quantum circuits. In this work, we present a comprehensive benchmarking study of quantum trial wavefunctions spanning unitary coupled-cluster, Hamiltonian-informed, Jastrow-inspired, and adaptively constructed ansatze. The benchmarking evaluates accuracy, expressibility, and scalability of these ansatze within the QC-AFQMC framework. We test these ansatze on linear hydrogen chains under bond stretching and find that several ansatz families produce chemically accurate ph-AFQMC energies across the dissociation curve. We have performed simulations using the CUDA-Q quantum development platform on the GPU partition of the Perlmutter supercomputer. When comparing ansatze at similar numbers of variational parameters, we find that different ansatz families yield comparable ph-AFQMC results despite exhibiting substantially different variational energies, optimization costs, and circuit depths. Our results indicate that the variational energy of an ansatz is not always a reliable indicator of its quality for ph-AFQMC and reveal instances of over-parameterization. In the strongly correlated regime, trial wavefunctions obtained from adaptive ansatze, exemplified here by ADAPT-VQE with the UCCSD operator pool, can outperform their fixed-ansatz counterparts (UCCSD) in terms of projected energies while using substantially more compact circuits, providing a flexible route to optimize quantum resources within the ph-AFQMC framework.

Rofougaran, Rod [LBNL, Berkeley; Columbia U.; PNL,↗

Virtualized Logical Qubits: A 2.5D Architecture for Error-Corrected Quantum Computing

Current, near-term quantum devices have shown great progress in the last several years culminating recently with a demonstration of quantum supremacy. In the medium-term, however, quantum machines will need to transition to greater reliability through error correction, likely through promising techniques like surface codes which are well suited for near-term devices with limited qubit connectivity. We discover quantum memory, particularly resonant cavities with transmon qubits arranged in a 2.5D architecture, can efficiently implement surface codes with substantial hardware savings and performance/fidelity gains. Specifically, we virtualize logical qubits by storing them in layers of qubit memories connected to each transmon. Surprisingly, distributing each logical qubit across many memories has a minimal impact on fault tolerance and results in substantially more efficient operations. Our design permits fast transversal application of CNOT operations between logical qubits sharing the same physical address (same set of cavities) which are 6x faster than standard lattice surgery CNOTs. We develop a novel embedding which saves approximately 10x in transmons with another 2x savings from an additional optimization for compactness. Although qubit virtualization pays a 10x penalty in serialization, advantages in the transversal CNOT and in area efficiency result in fault-tolerance and performance comparable to conventional 2D transmon-only architectures. Our simulations show our system can achieve fault tolerance comparable to conventional two-dimensional grids while saving substantial hardware. Furthermore, our architecture can produce magic states at 1.22x the baseline rate given a fixed number of transmon qubits. Here, this is a critical benchmark for future fault-tolerant quantum computers as magic states are essential and machines will spend the majority of their resources continuously producing them. This architecture substantially reduces the hardware requirements for fault-tolerant quantum computing and puts within reach a proof-of-concept experimental demonstration of around 10 logical qubits, requiring only 11 transmons and 9 attached cavities in total.

quantum computing↗

Noise dynamics of quantum annealers: estimating the effective noise using idle qubits

Quantum annealing is a type of analog computation that aims to use quantum mechanical fluctuations in search of optimal solutions of QUBO (quadratic unconstrained binary optimization) or, equivalently, Ising problems. Since NP-hard problems can in general be mapped to Ising and QUBO formulations, the quantum annealing paradigm has the potential to help solve various NP-hard problems. Current quantum annealers, such as those manufactured by D-Wave Systems, Inc. have various practical limitations including the size (number of qubits) of the problem that can be solved, the qubit connectivity, and error due to the environment or system calibration, which can reduce the quality of the solutions. Typically, for an arbitrary problem instance, the corresponding QUBO (or Ising) structure will not natively embed onto the available qubit architecture on the quantum chip. Thus, in these cases, a minor embedding of the problem structure onto the device is necessary. However, minor embeddings on these devices do not always make use of the full sparse chip hardware graph, and a large portion of the available qubits stay unused during quantum annealing. In this work, we embed a disjoint random QUBO on the unused parts of the chip alongside the QUBO to be solved, which acts as an indicator of the solution quality of the device over time. Using experiments on three different D-Wave quantum annealers, we demonstrate that (i) long term trends in solution quality exist on the D-Wave device, and (ii) the unused qubits can be used to measure the current level of noise of the quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enhancing quantum utility: Simulating large-scale quantum spin chains on superconducting quantum computers

We present the quantum simulation of the frustrated quantum spin- 1 2 antiferromagnetic Heisenberg spin chain with competing nearest-neighbor ( J 1 ) and next-nearest-neighbor ( J 2 ) exchange interactions in the real superconducting quantum computer with qubits ranging up to 100. In particular, we implement the Hamiltonian with the next-nearest neighbor exchange interaction in conjunction with the nearest-neighbor interaction on IBM's superconducting quantum computer and carry out the time evolution of the spin chain by employing the first-order Trotterization. Furthermore, our implementation of the second-order Trotterization for the isotropic Heisenberg spin chain, involving only nearest-neighbor exchange interaction, enables precise measurement of the expectation values of staggered magnetization observable across a range of up to 100 qubits. Notably, in both cases, our approach results in a constant circuit depth in each Trotter step, independent of the number of qubits. Our demonstration of the accurate measurement of expectation values for the large-scale quantum system using superconducting quantum computers designates the quantum utility of these devices for investigating various properties of many-body quantum systems. This will be a stepping stone to achieving the quantum advantage over classical ones in simulating quantum systems before the fault tolerance quantum era. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

Training quantum neural networks using the quantum information bottleneck method

Abstract We provide in this paper a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network. This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum. We provide a rigorous algorithm for computing the value of the quantum information bottleneck quantity within error ε that requires O ( log 2 ⁡ ( 1 / ϵ ) + 1 / δ 2 ) queries to a purification of the input density operator if its spectrum is supported on { 0 } ⋃ [ δ , 1 − δ ] for δ > 0 and the kernels of the relevant density matrices are disjoint. We further provide algorithms for estimating the derivatives of the QIB function, showing that quantum neural networks can be trained efficiently using the QIB quantity given that the number of gradient steps required is polynomial.

Çatlı, Ahmet Burak (ORCID:0000000152294141)↗

Electromagnetic response and emergent topological orders in transition metal dichalcogenide MoTe 2 bilayers

Twisted bilayer transition metal dichalcogenides, such as MoTe 2 , provide a versatile platform for exploring correlated topological phases. This work investigates the interplay between perpendicular magnetic and electric fields in tuning the electronic structure and emergent topological orders of twisted bilayer MoTe 2 (t-MoTe 2 ) across two distinct regimes: a low-twist-angle phase (θ ≈ 2.1°) hosting multiple Chern bands of identical Chern numbers per valley, and a higher-angle phase (θ ≈ 3.89°) featuring Haldane-like bands with opposite Chern numbers. Using a continuum model incorporating moiré potentials up to second harmonics, we compute the Hofstadter fractal spectra under applied fields, revealing Landau fan structures and magnetic-flux-dependent band topology. These fractal spectra are useful in studying emergent topological orders in terms of the composite fermion picture, where the statistical Chern-Simons flux is approximated as a uniform gauge field. We demonstrate that the system hosts both Jain-sequence fractional Chern insulators (FCIs) and non-Jain fractal FCIs with higher Chern numbers. As a result, the electric field suppresses composite fermion gaps and induces topological quantum phase transitions. Furthermore, our analysis extends to valley-contrasting flux attachment, proposing pathways to describe fractional quantum spin Hall states.

Anyons↗

Emulators for Scarce and Noisy Data: Application to Auxiliary-Field Diffusion Monte Carlo for Neutron Matter

Understanding the equation of state (EOS) of pure neutron matter is necessary for interpreting multimessenger observations of neutron stars. Reliable data analyses of these observations require well-quantified uncertainties for the EOS input, ideally propagating uncertainties from nuclear interactions directly to the EOS. This, however, requires calculations of the EOS for a prohibitively larger number of nuclear Hamiltonians, solving the nuclear many-body problem for each one. Quantum Monte Carlo methods, such as auxiliary-field diffusion Monte Carlo (AFDMC), provide precise and accurate results for the neutron matter EOS, but they are very computationally expensive, making them unsuitable for the fast evaluations necessary for uncertainty propagation. Here, we employ parametric matrix models to develop fast emulators for AFDMC calculations of neutron matter and use them to directly propagate uncertainties of coupling constants in the Hamiltonian to the EOS. As these uncertainties include estimates of the effective field theory truncation uncertainty, this approach provides robust uncertainty estimates for use in astrophysical data analyses. In conclusion, this Letter will enable novel applications such as using astrophysical observations to put constraints on coupling constants for nuclear interactions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Shear viscosity from perturbative quantum chromodynamics to the hadron resonance gas at finite baryon, strangeness, and electric charge densities

Through model-to-data comparisons from heavy-ion collisions, it has been shown that the quark gluon plasma has an extremely small shear viscosity at vanishing densities. At large baryon densities, significantly less is known about the nature of the shear viscosity from quantum chromodynamics (QCD). Within heavy-ion collisions, there are three conserved charges: baryon number (B), strangeness (S), and electric charge (Q). Here we calculate the shear viscosity in two limits using perturbative QCD (pQCD) and an excluded-volume hadron resonance gas at finite BSQ densities. We then develop a framework that interpolates between these two limits such that shear viscosity is possible to calculate across a wide range of finite BSQ densities. We find that the pQCD and hadron resonance gas calculations have different BSQ density dependencies such that a rather nontrivial shear viscosity appears at finite densities.

Phenomenology↗

Two-channel multi-impurity Kondo model: RKKY-induced criticality

We show that the Ruderman-Kittel-Kasua-Yoisida interaction between overscreened spins in two-channel Kondo impurity systems is a relevant perturbation when the number of impurities N is greater than 3 driving the system to a new quantum critical point with anomalous dimensions $\frac{1}{(𝑁+1)}$ for the spin operator and the Sommerfeld coefficient of the specific heat scales as 𝛾 ∼ 𝑇 −$\frac{3}{𝑁+1}$ . The critical point universal properties are relevant to many strong correlation problems, such as impurity placed in a Majorana metal and the multichannel Kondo lattice model of heavy fermion materials. In conclusion, we discuss relevance of our results for cluster DMFT studies of quantum criticality.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Novel Approach to Quantum Circuit Partitioning

Quantum synthesis presents an effective method of circuit optimization, but scales exponentially with the number of qubits in the circuit. This problem can be addressed by partitioning the circuit into blocks with a limited number of qubits. Existing partitioning algorithms make large trade-offs to achieve either high speed or quality. We propose a method of circuit partitioning which is competitive with existing algorithms for both metrics. The proposed method is compared with two existing methods across common circuit architectures, matching an exhaustive solution in performance and a fast solution on time.

Clark, Joseph↗

Sparse Phase Ansatzes for Resource-Efficient Qudit State Preparation via the SNAP-Displacement Protocol

Efficient preparation of nonclassical bosonic states is a central requirement for quantum computing, simulation, and precision metrology. We study resource-efficient quantum state preparation in bosonic qudit systems using the SNAP-displacement (SD) protocol. Existing SD-based approaches typically require a large number of gates and SNAP phases, resulting in complex control pulses with longer ansatz durations and amplified impact of photon-loss and control errors. In this work, we focus on the near- to medium-term regime, in which noisy quantum devices impose trade-offs on the fidelity that can be achieved, which must be taken into account. Specifically, we propose to optimize only a subset of the SNAP phases and introduce three progressively more general sparse ansatzes. To provide fine-grained control and identify the most suitable ansatz for a given target fidelity, we further employ a scalarized multi-objective optimization that trades off fidelity against either the number of phases or the duration of the ansatz. Numerical results for several target states and qudit dimensions up to $d=64$, evaluated through the hypervolume of the Pareto frontiers, show that these sparse ansatzes achieve favorable trade-offs over the fully parameterized SD protocol in both ideal and noisy settings. The advantage is strongest and most consistent when minimizing the number of phases, while improvements in ansatz duration are smaller and more dependent on the target-state family and noise level, suggesting a practical route to more efficient near- and medium-term bosonic state preparation.

Ferrari Dacrema, Maurizio [Milan Polytechnic] (ORC↗

Adaptive bandwidth management for entanglement distribution in quantum networks

Flexible grid wavelength division multiplexing is a powerful tool in lightwave communications to maximize spectral efficiency. In the emerging field of quantum networking, the need for effective resource provisioning is particularly acute, given the generally lower power levels, higher sensitivity to loss, and inapplicability of optical detection and retransmission. In this letter, we leverage flex grid technology to demonstrate reconfigurable distribution of quantum entanglement in a four-user tabletop network. By adaptively partitioning bandwidth with a single wavelength-selective switch, we successfully equalize two-party coincidence rates that initially differ by over two orders of magnitude. Our scalable approach introduces loss that is fixed with the number of users, offering a practical path for the establishment and management of quality-of-service guarantees in large quantum networks.

42 ENGINEERING↗

Dynamical phase transitions in the collisionless pre-thermal states of isolated quantum systems: theory and experiments

Abstract We overview the concept of dynamical phase transitions (DPTs) in isolated quantum systems quenched out of equilibrium. We focus on non-equilibrium transitions characterized by an order parameter, which features qualitatively distinct temporal behavior on the two sides of a certain dynamical critical point. DPTs are currently mostly understood as long-lived prethermal phenomena in a regime where inelastic collisions are incapable to thermalize the system. The latter enables the dynamics to substain phases that explicitly break detailed balance and therefore cannot be encompassed by traditional thermodynamics. Our presentation covers both cold atoms as well as condensed matter systems. We revisit a broad plethora of platforms exhibiting pre-thermal DPTs, which become theoretically tractable in a certain limit, such as for a large number of particles, large number of order parameter components, or large spatial dimension. The systems we explore include, among others, quantum magnets with collective interactions, ϕ 4 quantum field theories, and Fermi–Hubbard models. A section dedicated to experimental explorations of DPTs in condensed matter and AMO systems connects this large variety of theoretical models.

Physics↗

Block encoding of the three-dimensional heterogeneous Poisson equation with application to fracture flow

Quantum linear system (QLS) algorithms offer the potential to solve large-scale linear systems exponentially faster than classical methods. However, applying QLS algorithms to real-world problems remains challenging due to issues such as state preparation, data loading, and efficient information extraction. In this work, we study the feasibility of applying QLS algorithms to solve discretized three-dimensional (3D) heterogeneous Poisson equations, with specific examples relating to groundwater flow through geologic fracture networks. We explicitly construct a block encoding for the 3D heterogeneous Poisson matrix by leveraging the sparse local structure of the discretized operator. While classical solvers benefit from preconditioning, we show that block encoding the system matrix and preconditioner separately does not improve the effective condition number that dominates the QLS run-time. This differs from classical approaches where the preconditioner and the system matrix can often be implemented independently. Nevertheless, due to the structure of the problem in three dimensions, the quantum algorithm achieves a run-time of 𝑂⁡(𝑁 2/3 polylog 𝑁 ⋅log (1/𝜖)), outperforming the best classical methods (with run times of 𝑂⁡(𝑁⁢log 𝑁 ⋅log (1/𝜖))) and offering exponential memory savings. These results highlight both the promise and limitations of QLS algorithms for practical scientific computing, and point to effective condition-number reduction as a key barrier in achieving quantum advantages.

58 GEOSCIENCES↗

Higher-order Zeno sequences

The quantum Zeno effect typically refers to freezing the dynamics of a quantum system through frequent observations. In general, quantum Zeno dynamics is obtained with an error of order 𝒪⁢(1/𝑁), where 𝑁 is the number of projective measurements performed within a fixed evolution time. In this work, we develop higher-order Zeno sequences that achieve faster convergence to Zeno dynamics, yielding an improved error scaling of 𝒪⁢(1/𝑁 2⁢𝑘 ), where 𝑘 describes the order of the Zeno sequence. This is achieved by relating higher-order Zeno sequences to higher-order Trotter formulas that achieve similar convergence behavior. We leverage this relation to develop higher-order Zeno sequences for different manifestations of the quantum Zeno effect, including frequent projective measurements and unitary kicks. We go on to discuss achieving quantum Zeno dynamics through periodic control fields of high frequency. We explicitly develop control fields that yield a second-order type improvement in the Zeno error scaling and present shorter Zeno sequences. Finally, we discuss the connection to randomized and Uhrig dynamical decoupling to develop more efficient implementations in the weak-coupling regime.

Quantum Zeno dynamics↗

Localization from Hilbert space shattering: From theory to physical realizations

We show how a finite number of conservation laws can globally “shatter” Hilbert space into exponentially many dynamically disconnected subsectors, leading to an unexpected dynamics with features reminiscent of both many-body localization and quantum scars. A crisp example of this phenomenon is provided by a “fractonic” model of quantum dynamics constrained to conserve both charge and dipole moment. We show how the Hilbert space of the fractonic model dynamically fractures into disconnected emergent subsectors within a particular charge and dipole symmetry sector. This shattering can occur in arbitrary spatial dimensions. A large number of the emergent subsectors, exponentially many in system volume, have dimension one and exhibit strictly localized quantum dynamics—even in the absence of spatial disorder and in the presence of temporal noise. Other emergent subsectors display nontrivial dynamics and may be constructed by embedding finite-sized nontrivial blocks into the localized subspace. While “fractonic” models provide a particularly clean realization, the shattering phenomenon is more general, as we discuss. We also discuss how the key phenomena may be readily observed in near term ultracold atom experiments. In experimental realizations, the conservation laws are approximate rather than exact, so the localization only survives up to a prethermal timescale that we estimate. We comment on the implications of these results for recent predictions of Bloch/Stark many-body localization.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗