Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adiabatic quantum optimization”

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 37 records · Page 2

Exact representations of many-body interactions with restricted-Boltzmann-machine neural networks

Restricted Boltzmann machines (RBMs) are simple statistical models defined on a bipartite graph which have been successfully used in studying more complicated many-body systems, both classical and quantum. In this work, we exploit the representation power of RBMs to provide an exact decomposition of many-body contact interactions into one-body operators coupled to discrete auxiliary fields. This construction generalizes the well known Hirsch's transform used for the Hubbard model to more complicated theories such as pionless effective field theory in nuclear physics, which we analyze in detail. Finally, we also discuss possible applications of our mapping for quantum annealing applications and conclude with some implications for RBM parameter optimization through machine learning.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗

Noisy intermediate-scale quantum algorithms

A universal fault-tolerant quantum computer that can efficiently solve problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement toward realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e., qubits that are not error corrected, and therefore perform imperfect operations within a limited coherence time. In the search for achieving quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry, and combinatorial optimization. The overarching goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, a thorough summary of NISQ computational paradigms and algorithms is provided. The key structure of these algorithms and their limitations and advantages are discussed. Finally, a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices is additionally provided.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Magnetic devil's staircaselike behavior in quasiperiodic qubit lattices

The devil's staircase (DS) phenomenon is a fractal response of magnetization to external fields, traditionally observed in periodic ferromagnetic systems, where the commensurability between spin arrangements, lattice parameters, and external magnetic fields governs abrupt changes in magnetization. Its occurrence in aperiodic, fractal-type systems has remained largely unexplored, despite their natural compatibility with such phenomena. Using a quantum annealing device, we uncover a wealth of abrupt magnetic transitions between spin manifolds driven by increasing external magnetic fields within a simple yet effective Ising-model framework. In contrast to periodic systems, where DS arises from long-range competing interactions, our findings reveal that short-range, purely antiferromagnetic couplings in aperiodic geometries produce equally rich ground-state magnetization patterns. Here, we demonstrate that while magnetic textures are determined by the lattice size, their formation remains remarkably robust and independent of scale, with commensurability emerging locally. Our results challenge the prevailing view that DS behavior is limited to periodic systems and establish quasiperiodic geometries as a natural host for this phenomenon.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Time fractals and discrete scale invariance with trapped ions

We show that a one-dimensional chain of trapped ions can be engineered to produce a quantum mechanical system with discrete scale invariance and fractal-like time dependence. By discrete scale invariance we mean a system that replicates itself under a rescaling of distance for some scale factor, and a time fractal is a signal that is invariant under the rescaling of time. These features are reminiscent of the Efimov effect, which has been predicted and observed in bound states of three-body systems. We demonstrate that discrete scale invariance in the trapped ion system can be controlled with two independently tunable parameters. We also discuss the extension to n-body states where the discrete scaling symmetry has an exotic heterogeneous structure. Furthermore, the results we present can be realized using currently available technologies developed for trapped ion quantum systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Universal quantum operation of spin-3/2 Blume-Capel chains

We propose a logical qubit based on the Blume-Capel model: A higher-spin generalization of the Ising chain which allows for an on-site anisotropy-preserving rotational invariance around the Ising axis. We show that such a spin-3/2 Blume-Capel model can also support localized Majorana zero modes at the ends of the chain. Inspired by known braiding protocols of these Majorana zero modes, upon appropriate manipulation of the system parameters, we demonstrate a set of universal gate operations which act on qubits encoded in the doubly degenerate ground states of the chain.

1-dimensional spin chains↗

Cooling arbitrary near-critical systems using hyperbolic quenches

We describe a quench protocol that allows the rapid preparation of ground states of arbitrary interacting conformal field theories in 1+1 dimensions. We start from the ground state of a related gapped relativistic quantum field theory and consider sudden quenches along the spacelike trajectories t 2 – x 2 = $T$ $^{2}_{0}$ (parameterized by T 0 ) to a conformal field theory. Using only arguments of symmetry and conformal invariance, we show that the post-quench stress-energy tensor of the conformal field theory is uniquely constrained up to an overall scaling factor. Crucially, the geometry of the quench necessitates that the system approach the vacuum energy density over all space except the singular lines x = ±t. Here, the above arguments are verified using an exact treatment of the quench for the Gaussian scalar field theory (equivalently the Luttinger liquid), and numerically for the quantum O(N) model in the large-N limit. Additionally, for the Gaussian theory, we find in fact that even when starting from certain excited states, the quench conserves entropy, and is thus also suitable for rapidly preparing excited states. Our methods serve as a fast, alternative route to reservoir-based cooling to prepare quantum states of interest.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Annealing and Thermalization: Insights from Integrability

Here we solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a programmable computational problem that is encoded by parameters of the Ising part of the spin Hamiltonian. Our solution enables exact nonperturbative characterization of final nonadiabatic excitations, including a scaling of their number with the annealing rate and the system size. Finally, we prove that quantum correlations can accelerate computations and, at the end of the annealing protocol, lead to the perfect Gibbs distribution of all microstates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Symmetry Breaking Bias and the Dynamics of a Quantum Phase Transition

The Kibble-Zurek mechanism predicts the formation of topological defects and other excitations that quantify how much a quantum system driven across a quantum critical point fails to be adiabatic. We point out that, thanks to the divergent linear susceptibility at the critical point, even a tiny symmetry breaking bias can restore the adiabaticity. Furthermore, the minimal required bias scales like τ Q - β δ / ( 1 + z ν ) , where β , δ , z , ν are the critical exponents and τ Q is a quench time. We test this prediction by DMRG simulations of the quantum Ising chain. It is directly applicable to the recent emulation of quantum phase transition dynamics in the Ising chain with ultracold Rydberg atoms.

97 MATHEMATICS AND COMPUTING↗