Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 415 records · Page 23

Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms

The emergent practical applicability of the Quantum Approximate Optimization Algorithm (QAOA) for approximate combinatorial optimization is a subject of considerable interest. One of the primary limitations of QAOA is the task of finding a set of good parameters, which is usually done using a variational optimization loop. Parameter transfer, or parameter concentration, is a phenomenon where QAOA angles trained on problem instances that are self-similar tend to perform well for other problem instances from that similar class. This suggests a potentially highly efficient and scalable non-variational learning method for QAOA angle finding. In this work, we systematically study QAOA parameter transferability from small problem sizes (16 and 27 decision variables) onto large problem instances (up to 156 qubits) for heavy-hex graph Ising models with geometrically local higher order terms using the Julia based QAOA simulation tool \texttt{JuliQAOA} to perform classical angle finding for up to $49$ QAOA layers ($p$). Parameter transfer of the fixed angles is validated using a combination of full statevector, Projected Entangled Pair States (PEPS), Matrix Product State (MPS), and LOWESA numerical simulations. We find that the QAOA parameter transfer from single instances applied to other (unseen) problem instances does not in general provide monotonically improving performance as a function of $p$ - there are many cases where the performance temporarily decreases as a function of $p$ - but despite this the transferred angles have a general trend of improved expectation value as the QAOA depth increases, in many cases converging close to the true ground-state energy of the $100+$ qubit instances. We also sample the hardware-compatible Ising models using the ensemble of transfer-learned QAOA parameters on several superconducting qubit IBM Quantum processors with 127, 133, and 156 qubits. We find continuous solution quality improvement of the hardware-compatible QAOA circuits run on the IBM NISQ processors up to $p=5$ on \texttt{ibm\_fez}, up to $p=9$ on \texttt{ibm\_torino}, and up to $p=10$ on \texttt{ibm\_pittsburgh}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Control for the Quantum Simulation of Nuclear Dynamics

We propose a method for enacting the unitary time propagation of two interacting neutrons at leading order of chiral effective-field theory by efficiently encoding the nuclear dynamics into a single multilevel quantum device. The emulated output of the quantum simulation shows that, by applying a single gate that draws on the underlying characteristics of the device, it is possible to observe multiple cycles of the nuclear dynamics before the onset of decoherence. Owing to the signal's longevity, we can then extract spectroscopic properties of the simulated nuclear system. This allows us to validate the encoding of the nuclear Hamiltonian and the robustness of the simulation in the presence of quantum-hardware noise by comparing the extracted spectroscopic information to exact calculations. This work paves the way for transformative calculations of the dynamical properties of nuclei on near-term quantum devices.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimal universal asymmetric covariant quantum cloning circuits for qubit entanglement manipulation

We consider the entanglement manipulation capabilities of the universal covariant quantum cloner or quantum processor circuit for quantum bits. We investigate its use for cloning a member of a bipartite or a genuine tripartite entangled state of quantum bits. We find that for bipartite pure entangled states a nontrivial behavior of concurrence appears, while for GHZ entangled states a possibility of the partial extraction of bipartite entanglement can be achieved.

74 ATOMIC AND MOLECULAR PHYSICS↗

Optimized control of multistate quantum systems by composite pulse sequences

We introduce a technique for derivation of high-fidelity composite pulse sequences for two types of multistate quantum systems: systems with the SU(2) and Morris-Shore dynamic symmetries. For the former type, we use the Majorana decomposition to reduce the dynamics to an effective two-state system, which allows us to find the propagator analytically and use the pool of available composite pulses for two-state systems. For the latter type of multistate systems, we use the Morris-Shore decomposition, which reduces the multistate dynamics to a set of two-state systems. We present examples which demonstrate that the multistate composite sequences open a variety of possibilities for coherent control of quantum systems with multiple states.

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↗

Inferring Quantum Network Topology Using Local Measurements

Statistical correlations that can be generated across the nodes in a quantum network depend crucially on its topology. However, this topological information might not be known a priori, or it may need to be verified. In this paper, we propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We leverage entropic quantities-namely, the von Neumann entropy and the measured mutual information-as well as measurement covariance to uniquely characterize the topology. We show that the entropic quantities are sufficient to distinguish two networks that prepare GHZ states. Moreover, if qubit measurements are available, both entropic quantities and covariance can be used to infer the network topology without state-preparation assumptions. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization. Numerical experiments on both classical simulators and quantum hardware show that covariance is generally more reliable for accurately and efficiently inferring the topology, whereas entropy-based methods are often better at identifying the absence of entanglement in the low-shot regime.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Variational Quantum Circuits to Prepare Low Energy Symmetry States

We explore how to build quantum circuits that compute the lowest energy state corresponding to a given Hamiltonian within a symmetry subspace by explicitly encoding it into the circuit. We create an explicit unitary and a variationally trained unitary that maps any vector output by ansatz A(α → ) from a defined subspace to a vector in the symmetry space. The parameters are trained varitionally to minimize the energy, thus keeping the output within the labelled symmetry value. The method was tested for a spin XXZ Hamiltonian using rotation and reflection symmetry and H 2 Hamiltonian within S z = 0 subspace using S 2 symmetry. We have found the variationally trained unitary gives good results with very low depth circuits and can thus be used to prepare symmetry states within near term quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Systems and methods for determining optimal parameters for dynamic quantum clustering analyses

In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrodinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗