Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum circuits”

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 595 records · Page 33

Classical and quantum computing of shear viscosity for ( 2 + 1 ) D SU(2) gauge theory

We perform a nonperturbative calculation of the shear viscosity for ( 2 + 1 )-dimensional SU(2) gauge theory by using the lattice Hamiltonian formulation. The retarded Green’s function of the stress-energy tensor is calculated from real time evolution via exact diagonalization of the lattice Hamiltonian with a local Hilbert space truncation, and the shear viscosity is obtained via the Kubo formula. When taking the continuum limit, we account for the renormalization group flow of the coupling but no additional operator renormalization. We find the ratio of the shear viscosity and the entropy density η s is consistent with a well-known holographic result 1 4 π at several temperatures on a 4 × 4 honeycomb lattice with the local electric representation truncated at j max = 1 2 . We also find the ratio of the spectral function and frequency ρ x y ( ω ) ω exhibits a peak structure when the frequency is small. Both the exact diagonalization method and simple matrix product state classical simulation method beyond j max = 1 2 on bigger lattices require exponentially growing resources. So we develop a quantum computing method to calculate the retarded Green’s function and analyze various systematics of the calculation including j max truncation and finite size effects, Trotter errors and the thermal state preparation efficiency. Our thermal state preparation method still requires resources that grow exponentially with the lattice size, but with a very small prefactor at high temperature. We test our quantum circuit on both the Quantinuum emulator and the IBM simulator for a small lattice and obtain results consistent with the classical computing ones. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A world without pythons would be so simple

We show that bulk operators lying between the outermost extremal surface and the asymptotic boundary admit a simple boundary reconstruction in the classical limit. This is the converse of the Python's lunch conjecture, which proposes that operators with support between the minimal and outermost (quantum) extremal surfaces—e.g. the interior Hawking partners—are highly complex. Our procedure for reconstructing this 'simple wedge' is based on the HKLL construction, but uses causal bulk propagation of perturbed boundary conditions on Lorentzian timefolds to expand the causal wedge as far as the outermost extremal surface. As a corollary, we establish the Simple Entropy proposal for the holographic dual of the area of a marginally trapped surface as well as a similar holographic dual for the outermost extremal surface. Here, we find that the simple wedge is dual to a particular coarse-grained CFT state, obtained via averaging over all possible Python's lunches. An efficient quantum circuit converts this coarse-grained state into a 'simple state' that is indistinguishable in finite time from a state with a local modular Hamiltonian. Under certain circumstances, the simple state modular Hamiltonian generates an exactly local flow; we interpret this result as a holographic dual of black hole uniqueness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adiabatic cluster-state quantum computing

Models of quantum computation (QC) are important because they change the physical requirements for achieving universal QC. For example, one-way QC requires the preparation of an entangled ''cluster'' state, followed by adaptive measurement on this state, a set of requirements which is different from the standard quantum-circuit model. Here we introduce a model based on one-way QC but without measurements (except for the final readout), instead using adiabatic deformation of a Hamiltonian whose initial ground state is the cluster state. Our results could help increase the feasibility of adiabatic schemes by using tools from one-way QC.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗

Location of quantum information in additive graph codes

The location of quantum information in various subsets of the qudit carriers of an additive graph code is discussed using a collection of operators on the coding space which form what we call the information group. It represents the input information through an encoding operation constructed as an explicit quantum circuit. Partial traces of these operators down to a particular subset of carriers provide an isomorphism of a subgroup of the information group, and this gives a precise characterization of what kinds of information they contain. All carriers are assumed to have the same dimension D, an arbitrary integer greater than 1.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generation of a multi-qubit W entangled state through spatially separated semiconductor quantum-dot-molecules in cavity-quantum electrodynamics arrays

Generating entangled states attract tremendous interest as the most vivid manifestation of nonlocality of quantum mechanics and also for emerging applications in quantum information processing (QIP). Here, we propose theoretically a scheme for the deterministic generation of a three-qubit W sate with three semiconductor quantum-dot-molecules (QDMs) trapped in spatially separated cavities connected by optical fibers. The proposed scheme takes full advantage of the voltage-controlled tunnelling effects in QDMs, which induces the quantum coherence and further controls the generation of the W entangled state. The influences of the system parameters and various decoherence processes including spontaneous decay and photon leakage on the fidelity of the W state are discussed in details. Numerical results indicate that our scheme is not only robust against these decoherence factors but also insensitive to the deviation of the system parameters from the ideal conditions. Furthermore, the present scheme can be directly extended to realize an N-qubit W state. Also, this scheme can be generically transferred to other physical systems, including circuit quantum electrodynamics and photonic crystal cavities. The results obtained here may be useful in real experiments for realizing QIP in a solid-state platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerical Simulations of Noisy Variational Quantum Eigensolver Ansatz Circuits

This is a case study of the variational quantum eigensolver (VQE) method using numerical simulations to test the influence of noise on the accuracy of the underlying circuit ansatz. We investigate a computational chemistry application of VQE to calculate the electronic ground state and its energy for Sodium Hydride (NaH), a prototypical two-electron problem. Using a one-parameter ansatz derived from unitary coupled cluster (UCC) theory, we simulate the effects of noise on the energy expectation value and variance with respect to the ansatz parameter. These numerical simulations provide insights into the accuracy of the prepared quantum state and the efficiency of the classical optimizer that iteratively refines the ansatz. We conduct a comparative study between analytical results derived for the UCC ansatz in the absence of noise and the noisy numerical simulation results obtained using an isotropic depolarizing noise model for each gate. We also compare the relative increase in noise on logically equivalent UCC ansatz circuits generated by randomized compiling. Notably, we observe that the intrinsic variance in the energy due to the simplicity of the ansatz itself compares with the noise induced by the bare circuit.

Gowrishankar, Meenambika↗

QuAIL Tools for Benchmarking, Analysis and Quantum Algorithm Development

HybridQ and PySA are open-source tools developed by NASA to support benchmarking, analysis and quantum algorithm development in areas such as simulation, optimization and machine learning. These tools leverage classical hardware acceleration via high-performance computing CPU and GPU architectures and support high-performance computing. HybridQ is a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to simulate large scale quantum circuits. PySA is an extensible platform to optimize a classical cost function. We provide an outline of each of these open-source tools and highlight projects using each of these tools in contexts of simulation, optimization and machine learning.

Quantum Computing↗

Efficient verification of anticoncentrated quantum states

I present a method for estimating the fidelity F(μ, τ) between a preparable quantum state μ and a classically specified pure target state τ=|τ> <τ|, using simple quantum circuits and on-the-fly classical calculation (or lookup) of selected amplitudes of |τ>. The method is sample efficient for anticoncentrated states (including many states that are hard to simulate classically), with approximate cost 4ϵ –2 (1 – F)dpcoll where ϵ is the desired precision of the estimate, d is the dimension of the Hilbert space, and pcoll is the collision probability of the target distribution. Furthermore, this scaling is exponentially better than that of any method based on classical sampling. I also present a more sophisticated version of the method that uses any efficiently preparable and well-characterized quantum state as an importance sampler to further reduce the number of copies of μ needed. Though some challenges remain, this work takes a significant step toward scalable verification of complex states produced by quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum-Assisted Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

The quantum computing community has been searching for suitable applications to demonstrate the potential of near-term quantum devices. Quantum machine learning is a potential candidate, particularly using models that cannot be efficiently simulated with classical computers [1, 2]. This work focuses on a transition phase of quantum computers where the quantum machine learning model is still simulable classically but projected not to be simulable as the size of the model grows. Ultimately quantum computers may have advantages for high-dimensional real-world problems. Due to the limited number of qubits in current noisy intermediate-scale quantum (NISQ) devices, the direct application of quantum computers in high dimensional data is not feasible. To remedy this problem, an encoder-decoder architecture can be utilized. The encoder model would transform the high-dimensional data into a compact representation, to a level that small quantum computers can be used today (or in the near future), and the decoder would take the quantum processed outputs back to the high-dimensional space. Addressing the two challenges of quantum machine learning, this work investigates a hybrid supervised generative model with a quantum Ising Born machine embedded as the latent distribution. The model contains four main parts (Figure 1.a.): (1) a U-NET architecture responsible for learning segmentation flow, (2) a Prior network responsible for learning an encoded latent distribution of the input data, (3) a Born machine which represents the latent distribution, and (4) a Posterior network in charge of learning the joint encoded latent distribution of inputs and target data. The initial model, proposed by [3], is optimized by (1) maximizing the overlap of the prior and posterior latent distributions, and (2) minimizing the segmentation loss. The proposed model is designed to be investigated in a simulation environment applied to the real-world application of wildfire segmentation. Specifically, the model is designed to solve the patchy wildfire segmentations of Moderate Resolution Imaging Spectroradiometer (MODIS) by taking the MODIS observations and using Visible Infrared Imaging Radiometer Suite’s (VIIRS) consistent wildfire product as the target. The model solves patchy wildfire segmentations and provides insight into the epistemic errors sourced from model variation. The model utilizes the Born machine as a QUBO solver to represent the latent space as a Bernoulli distribution. The proposed configuration allows the variational segmentation model to leverage the true quantum probabilistic nature and derive a more expressive latent configuration, increasing the model performance in describing wildfire segmentations. The quantum probabilistic information of the Born machine is directly incorporated in the Kullback-Leibler divergence loss in the prior and posterior distributions, forcing the Bernoulli latent distribution to maximize the overlap of input and joint input-target distributions. The proposed model is then trained and compared with a baseline only consisting of direct Bernoulli latent distribution with no Born machine representing the latent space. The models are evaluated based on the segmentation metrics, such as precision, recall, intersect of union, with uncertainty boundaries accounting for the stochastic nature of the model. Our findings show that even in low latent-dimensional space (due to the limit in computational power of the classical quantum simulator), we are able to effectively capture the latent representation and hence the model performs better than the baseline. The findings are a projection for scaling the model into higher dimensional latent space with the Born machine surpassing the baseline performance. Figure 1. Sub-figure (a) demonstrates the architecture for the training phase. The model consists of a Prior and Posterior network that encode inputs and joint input-target data into compact representations, respectively. The Born machine represents the latent distribution, and the U-NET branch learns the segmentation patterns of the data. The stochasticity is introduced to the U-NET through its last layer to create meaningful but stochastic segmentations. Sub-figure (b) represents the inference phase where the model takes the stochastic behavior from the prior network and injects that into the U-NET. Each attempt of inference will generate different but similar segmentations from the same distribution of the wildfire event. REFERENCES [1] Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020). The Born supremacy: quantum advantage and training of an Ising Born machine. npj Quantum Information, 6(1), 1-11. [2] Liu, J. G., & Wang, L. (2018). Differentiable learning of quantum circuit born machines. Physical Review A, 98(6), 062324. [3] Kohl, S., Romera-Paredes, B., Meyer, C., De Fauw, J., Ledsam, J. R., Maier-Hein, K., ... & Ronneberger, O. (2018). A probabilistic u-net for segmentation of ambiguous images. Advances in neural information processing systems, 31.

quantum machine learning↗

Fluctuations of subsystem entropies at late times

We study the fluctuations of subsystem entropies in closed quantum many-body systems after thermalization. Using a combination of analytics and numerics for both random quantum circuits and Hamiltonian dynamics, we find that the statistics of such entropy fluctuations is drastically different than in the classical setting. For instance, shortly after a system thermalizes, the probability of entropy fluctuations for a subregion is suppressed in the dimension of the Hilbert space of the complementary subregion. This suppression becomes increasingly stringent as a function of time, ultimately depending on the exponential of the Hilbert space dimension, until extremely late times when the amount of suppression saturates. We also use our results to estimate the total number of rare fluctuations at large timescales. We find that the “Boltzmann brain” paradox is largely ameliorated in quantum many-body systems, in contrast with the classical setting.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cavity quantum electro-optics. II. Input-output relations between traveling optical and microwave fields

In a previous paper [Phys. Rev. A 81, 063837 (2010)], I proposed a quantum model of the cavity electro-optic modulator, which can coherently couple an optical cavity mode to a microwave resonator mode and enable quantum operations on the two modes, including laser cooling of the microwave resonator, electro-optic entanglement, and backaction-evading optical measurement of a microwave quadrature. In this sequel, I focus on the quantum input-output relations between traveling optical and microwave fields coupled to the cavity electro-optic modulator. With red-sideband optical pumping, the relations are shown to resemble those of a beam splitter for the traveling fields, so that in the ideal case of zero parasitic loss and critical coupling, microwave photons can be coherently up converted to ''flying'' optical photons with unit efficiency, and vice versa. With blue-sideband pumping, the modulator acts as a nondegenerate parametric amplifier, which can generate two-mode squeezing and hybrid entangled photon pairs at optical and microwave frequencies. These fundamental operations provide a potential bridge between circuit quantum electrodynamics and quantum optics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimized coplanar waveguide resonators for a superconductor–atom interface

We describe the design and characterization of superconducting coplanar waveguide cavities tailored to facilitate strong coupling between superconducting quantum circuits and single trapped Rydberg atoms. For initial superconductor–atom experiments at 4.2 K, we show that resonator quality factors above 10{sup 4} can be readily achieved. Furthermore, we demonstrate that the incorporation of thick-film copper electrodes at a voltage antinode of the resonator provides a route to enhance the zero-point electric fields of the resonator in a trapping region that is 40 μm above the chip surface, thereby minimizing chip heating from scattered trap light. The combination of high resonator quality factor and strong electric dipole coupling between the resonator and the atom should make it possible to achieve the strong coupling limit of cavity quantum electrodynamics with this system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace

When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number n of physical qubits. A single logical qubit is encoded with n=3 and 4, while two and three logical qubits are encoded with n=5 and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimum unit for the fractional statistics of anyons and its application

Although Han et al.[Phys. Rev. Lett. 98, 150404 (2007)] proposed a quantum circuit with six qubits to demonstrate the basic braiding statistics of anyons, we have found that a four-qubit system is enough for realizing such a process. We call it the minimum unit for the fractional statistics of anyons. With some special order, the minimum unit can be used to construct two kinds of fractional charge excitation n/(n+1)[or (n+1)/n] and (n{sup 2}-kn+6n+2)/(n{sup 2}-kn+5n+4)[or (n{sup 2}-kn+2n+k+1)/3(n{sup 2}-kn+5n+4)], where n,k are positive integers and k{<=}n. This minimum unit can be realized by a photonic quantum simulator or by electrons in an optical lattice or quantum dot array. Its use will have some advantages in metrology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A classification of invertible phases of bosonic quantum lattice systems in one dimension

We study invertible states of 1D bosonic quantum lattice systems. Here we show that every invertible 1D state is in a trivial phase: after tensoring with some unentangled ancillas, it can be disentangled by a fuzzy analog of a finite-depth quantum circuit. If an invertible state has symmetries, it may be impossible to disentangle it in a way that preserves the symmetries, even after adding unentagled ancillas. We show that in the case of a finite unitary symmetry G , the only obstruction is an index valued in degree-2 cohomology of G . We show that two invertible G -invariant states are in the same phase if and only if their indices coincide.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Universal construction of controlled-unitary gates using dynamical decoupling and the quantum Zeno effect

We present two new algorithms that universally construct a quantum circuit approximating a controlled-U(t) up to a global phase factor of U(t), denoted by Λ{sub θ}U(t), where U(t) = e{sup −iHt} is the unitary evolution operator of an unknown Hamiltonian H of the system, and is given as a black box with tunable parameter t. We show that it is possible to approximately construct Λ{sub θ}U(t) with arbitrarily high accuracy. This algorithm is based on the dynamical decoupling effect [1]. If another black box consisting of a time-inverted version of U(t), namely U(−t), is also available we can implement Λ{sub θ}U(t) exactly with arbitrarily high success probability. This algorithm is based on the quantum Zeno effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cheaper and more noise-resilient quantum state preparation using eigenvector continuation

Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary-time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver. By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground-state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Furthermore, our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗