Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum information science”

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 397 records · Page 22

Practical Hamiltonian learning with unitary dynamics and Gibbs states

We study the problem of learning the parameters for the Hamiltonian of a quantum many-body system, given limited access to the system. In this work, we build upon recent approaches to Hamiltonian learning via derivative estimation. We propose a protocol that improves the scaling dependence of prior works, particularly with respect to parameters relating to the structure of the Hamiltonian (e.g., its locality k). Furthermore, by deriving exact bounds on the performance of our protocol, we are able to provide a precise numerical prescription for theoretically optimal settings of hyperparameters in our learning protocol, such as the maximum evolution time (when learning with unitary dynamics) or minimum temperature (when learning with Gibbs states). Thanks to these improvements, our protocol has practical scaling for large problems: we demonstrate this with a numerical simulation of our protocol on an 80-qubit system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Exponential concentration in quantum kernel methods

Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model’s parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.

97 MATHEMATICS AND COMPUTING↗

High-Q cavity interface for color centers in thin film diamond

Quantum information technology offers the potential to realize unprecedented computational resources via secure channels distributing entanglement between quantum computers. Diamond, as a host to optically-accessible spin qubits, is a leading platform to realize quantum memory nodes needed to extend such quantum links. Photonic crystal (PhC) cavities enhance light-matter interaction and are essential for an efficient interface between spins and photons that are used to store and communicate quantum information respectively. Here, we demonstrate one- and two-dimensional PhC cavities fabricated in thin-film diamonds, featuring quality factors (Q) of 1.8 × 10 5 and 1.6 × 10 5 , respectively, the highest Qs for visible PhC cavities realized in any material. Importantly, our fabrication process is simple and high-yield, based on conventional planar fabrication techniques, in contrast to the previous with complex undercut processes. We also demonstrate fiber-coupled 1D PhC cavities with high photon extraction efficiency, and optical coupling between a single SiV center and such a cavity at 4 K achieving a Purcell factor of 18. The demonstrated photonic platform may fundamentally improve the performance and scalability of quantum nodes and expedite the development of related technologies.

97 MATHEMATICS AND COMPUTING↗

Overlapping qubits from non-isometric maps and de Sitter tensor networks

The emergence of a local effective theory from a more fundamental theory of quantum gravity with seemingly fewer degrees of freedom is a major puzzle of theoretical physics. A recent approach to this problem is to consider general features of the Hilbert space maps relating these theories. In this work, we construct approximately local observables, or overlapping qubits, from such non-isometric maps. We show that local processes in effective theories can be spoofed with a quantum system with fewer degrees of freedom, with deviations from actual locality identifiable as features of quantum gravity. For a concrete example, we construct two tensor network models of de Sitter space-time, demonstrating how exponential expansion and local physics can be spoofed for a long period before breaking down. Our results highlight the connection between overlapping qubits, Hilbert space dimension verification, degree-of-freedom counting in black holes, holography, and approximate locality in quantum gravity.

Quantum information↗

Machine learning of high dimensional data on a noisy quantum processor

Abstract Quantum kernel methods show promise for accelerating data analysis by efficiently learning relationships between input data points that have been encoded into an exponentially large Hilbert space. While this technique has been used successfully in small-scale experiments on synthetic datasets, the practical challenges of scaling to large circuits on noisy hardware have not been thoroughly addressed. Here, we present our findings from experimentally implementing a quantum kernel classifier on real high-dimensional data taken from the domain of cosmology using Google’s universal quantum processor, Sycamore. We construct a circuit ansatz that preserves kernel magnitudes that typically otherwise vanish due to an exponentially growing Hilbert space, and implement error mitigation specific to the task of computing quantum kernels on near-term hardware. Our experiment utilizes 17 qubits to classify uncompressed 67 dimensional data resulting in classification accuracy on a test set that is comparable to noiseless simulation.

97 MATHEMATICS AND COMPUTING↗

Large-scale simulations of Floquet physics on near-term quantum computers

Abstract Periodically driven quantum systems exhibit a diverse set of phenomena but are more challenging to simulate than their equilibrium counterparts. Here, we introduce the Quantum High-Frequency Floquet Simulation (QHiFFS) algorithm as a method to simulate fast-driven quantum systems on quantum hardware. Central to QHiFFS is the concept of a kick operator which transforms the system into a basis where the dynamics is governed by a time-independent effective Hamiltonian. This allows prior methods for time-independent simulation to be lifted to simulate Floquet systems. We use the periodically driven biaxial next-nearest neighbor Ising (BNNNI) model, a natural test bed for quantum frustrated magnetism and criticality, as a case study to illustrate our algorithm. We implemented a 20-qubit simulation of the driven two-dimensional BNNNI model on Quantinuum’s trapped ion quantum computer. Our error analysis shows that QHiFFS exhibits not only a cubic advantage in driving frequency ω but also a linear advantage in simulation time t compared to Trotterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tuning colour centres at a twisted hexagonal boron nitride interface

The colour centre platform holds promise for quantum technologies, and hexagonal boron nitride has attracted attention due to the high brightness and stability, optically addressable spin states and wide wavelength coverage discovered in its emitters. However, its application is hindered by the typically random defect distribution and complex mesoscopic environment. In this study, employing cathodoluminescence, we demonstrate on-demand activation and control of colour centre emission at the twisted interface of two hexagonal boron nitride flakes. Further, we show that colour centre emission brightness can be enhanced by two orders of magnitude by tuning the twist angle. Additionally, by applying an external voltage, nearly 100% brightness modulation is achieved. Our ab initio GW and GW plus Bethe–Salpeter equation calculations suggest that the emission is correlated to nitrogen vacancies and that a twist-induced moiré potential facilitates electron–hole recombination. This mechanism is further exploited to draw nanoscale colour centre patterns using electron beams.

36 MATERIALS SCIENCE↗

Iron-based binary ferromagnets for transverse thermoelectric conversion

Thermoelectric generation using the anomalous Nernst effect (ANE) has great potential for application in energy harvesting technology because the transverse geometry of the Nernst effect should enable efficient, large-area and flexible coverage of a heat source. For such applications to be viable, substantial improvements will be necessary not only for their performance but also for the associated material costs, safety and stability. In terms of the electronic structure, the anomalous Nernst effect (ANE) originates from the Berry curvature of the conduction electrons near the Fermi energy. To design a large Berry curvature, several approaches have been considered using nodal points and lines in momentum space. Here we perform a high-throughput computational search and find that 25 percent doping of aluminium and gallium in alpha iron, a naturally abundant and low-cost element, dramatically enhances the ANE by a factor of more than ten, reaching about 4 and 6 microvolts per kelvin at room temperature, respectively, close to the highest value reported so far. The comparison between experiment and theory indicates that the Fermi energy tuning to the nodal web—a flat band structure made of interconnected nodal lines—is the key for the strong enhancement in the transverse thermoelectric coefficient, reaching a value of about 5 amperes per kelvin per metre with a logarithmic temperature dependence. We have also succeeded in fabricating thin films that exhibit a large ANE at zero field, which could be suitable for designing low-cost, flexible microelectronic thermoelectric generators.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Certified randomness using a trapped-ion quantum processor

Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum ‘challenge’ circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyse the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 10 18 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers.

computer science↗

Adiabatic quantum linear regression

Abstract A major challenge in machine learning is the computational expense of training these models. Model training can be viewed as a form of optimization used to fit a machine learning model to a set of data, which can take up significant amount of time on classical computers. Adiabatic quantum computers have been shown to excel at solving optimization problems, and therefore, we believe, present a promising alternative to improve machine learning training times. In this paper, we present an adiabatic quantum computing approach for training a linear regression model. In order to do this, we formulate the regression problem as a quadratic unconstrained binary optimization (QUBO) problem. We analyze our quantum approach theoretically, test it on the D-Wave adiabatic quantum computer and compare its performance to a classical approach that uses the Scikit-learn library in Python. Our analysis shows that the quantum approach attains up to $${2.8 \times }$$ 2.8 × speedup over the classical approach on larger datasets, and performs at par with the classical approach on the regression error metric. The quantum approach used the D-Wave 2000Q adiabatic quantum computer, whereas the classical approach used a desktop workstation with an 8-core Intel i9 processor. As such, the results obtained in this work must be interpreted within the context of the specific hardware and software implementations of these machines.

97 MATHEMATICS AND COMPUTING↗

Parallel quantum annealing

Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits of the quantum chip, from which a solution is obtained after quantum annealing. However, since the connectivity of the physical qubits on the chip is limited, a minor embedding of the problem structure onto the chip is required. In this process, and especially for smaller problems, many qubits will stay unused. We propose a novel method, called parallel quantum annealing, to make better use of available qubits, wherein either the same or several independent problems are solved in the same annealing cycle of a quantum annealer, assuming enough physical qubits are available to embed more than one problem. Although the individual solution quality may be slightly decreased when solving several problems in parallel (as opposed to solving each problem separately), we demonstrate that our method may give dramatic speed-ups in terms of the Time-To-Solution (TTS) metric for solving instances of the Maximum Clique problem when compared to solving each problem sequentially on the quantum annealer. Additionally, we show that solving a single Maximum Clique problem using parallel quantum annealing reduces the TTS significantly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-angle quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.

97 MATHEMATICS AND COMPUTING↗

Quantum pixel representations and compression for N-dimensional images

Abstract We introduce a novel and uniform framework for quantum pixel representations that overarches many of the most popular representations proposed in the recent literature, such as (I)FRQI, (I)NEQR, MCRQI, and (I)NCQI. The proposed QPIXL framework results in more efficient circuit implementations and significantly reduces the gate complexity for all considered quantum pixel representations. Our method scales linearly in the number of pixels and does not use ancilla qubits. Furthermore, the circuits only consist of $$R_y$$ R y gates and $$\text {CNOT}$$ CNOT gates making them practical in the NISQ era. Additionally, we propose a circuit and image compression algorithm that is shown to be highly effective, being able to reduce the necessary gates to prepare an FRQI state for example scientific images by up to 90% without sacrificing image quality. Our algorithms are made publicly available as part of , a Quantum Image Pixel Library.

97 MATHEMATICS AND COMPUTING↗

Variational quantum algorithms

Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers, owing to the extremely high computational cost. Quantum computers promise a solution, although fault-tolerant quantum computers will probably not be available in the near future. Current quantum devices have serious constraints, including limited numbers of qubits and noise processes that limit circuit depth. Variational quantum algorithms (VQAs), which use a classical optimizer to train a parameterized quantum circuit, have emerged as a leading strategy to address these constraints. VQAs have now been proposed for essentially all applications that researchers have envisaged for quantum computers, and they appear to be the best hope for obtaining quantum advantage. Nevertheless, challenges remain, including the trainability, accuracy and efficiency of VQAs. Here we overview the field of VQAs, discuss strategies to overcome their challenges and finally, we highlight the exciting prospects for using them to obtain quantum advantage.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quasicubic model for metal halide perovskite nanocrystals

In this work, we present an analysis of quantum confinement of carriers and excitons, and exciton fine structure, in metal halide perovskite (MHP) nanocrystals (NCs). Starting with coupled-band k · P theory, we derive a nonparabolic effective mass model for the exciton energies in MHP NCs valid for the full size range from the strong to the weak confinement limits. We illustrate the application of the model to CsPbBr 3 NCs and compare the theory against published absorption data, finding excellent agreement. We then apply the theory of electron-hole exchange, including both short- and long-range exchange interactions, to develop a model for the exciton fine structure. We develop an analytical quasicubic model for the effect of tetragonal and orthorhombic lattice distortions on the exchange-related exciton fine structure in CsPbBr 3 , as well as some hybrid organic MHPs of recent interest, including formamidinium lead bromide (FAPbBr 3 ) and methylammonium lead iodide (MAPbI3). Testing the predictions of the quasicubic model using hybrid density functional theory (DFT) calculations, we find qualitative agreement in tetragonal MHPs but significant disagreement in the orthorhombic modifications. Moreover, the quasicubic model fails to correctly describe the exciton oscillator strength and with it the long-range exchange corrections in these systems. Introducing the effect of NC shape anisotropy and possible Rashba terms into the model, we illustrate the calculation of the exciton fine structure in CsPbBr 3 NCs based on the results of the DFT calculations and examine the effect of Rashba terms and shape anisotropy on the calculated fine structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Bridge connectivity effects on photoinduced ground-state electron spin polarization

Transient electron paramagnetic resonance (TREPR) spectroscopy has been used to probe photoinduced electron spin polarization in the recovered ground states of four radical-elaborated (CAT)Pt(bpy) donor-acceptor complexes (CAT = catechol; bpy = 4,4'-di-tert-butyl-2,2'-bipyridine). These complexes are comprised of one or two S = 1/2 nitronyl nitroxide radicals attached through different phenylethynyl bridges to the 3- or 3,6 positions of the CAT donor. In this paper, we demonstrate the effects of substitution patterns on the magnitude of the TREPR signal, thereby guiding future design principles for generating and understanding the origin of photoinduced electron spin polarization in these and related chromophores.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Triplet-pair spin signatures from macroscopically aligned heteroacenes in an oriented single crystal

The photo-driven process of singlet fission generates coupled triplet pairs (TT) with fundamentally intriguing and potentially useful properties. The quintet 5 TT 0 sublevel is particularly interesting for quantum information because it is highly entangled, is addressable with microwave pulses, and could be detected using optical techniques. Previous theoretical work on a model Hamiltonian and nonadiabatic transition theory, called the JDE model, has determined that this sublevel can be selectively populated if certain conditions are met. Among the most challenging, the molecules within the dimer undergoing singlet fission must have their principal magnetic axes parallel to one another and to an applied Zeeman field. Here, we present time-resolved electron paramagnetic resonance (TR-EPR) spectroscopy of a single crystal sample of a tetracenethiophene compound featuring arrays of dimers aligned in this manner, which were mounted so that the orientation of the field relative to the molecular axes could be controlled. The observed spin sublevel populations in the paired TT and unpaired (T+T) triplets are consistent with predictions from the JDE model, including preferential 5 TT 0 formation at z ‖ B 0 , with one caveat—two 5 TT spin sublevels have little to no population. This may be due to crossings between the 5 TT and 3 TT manifolds in the field range investigated by TR-EPR, consistent with the intertriplet exchange energy determined by monitoring photoluminescence at varying magnetic fields.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Quantum optimal control of ten-level nuclear spin qudits in Sr 87

We study the ability to implement unitary maps on states of the I = 9 / 2 nuclear spin in Sr 87 , a d = 10 dimensional (qudecimal) Hilbert space, using quantum optimal control. Through a combination of nuclear spin resonance and a tensor ac Stark shift, by solely modulating the phase of a radio-frequency magnetic field, the system is quantum controllable. Alkaline-earth-metal atoms, such as Sr 87 , have a very favorable figure of merit for such control due to narrow intercombination lines and the large hyperfine splitting in the excited states. We numerically study the quantum speed limit, optimal parameters, and the fidelity of arbitrary state preparation and full SU(10) maps, including the presence of decoherence due to optical pumping induced by the light-shifting laser. We also study the use of robust control to mitigate some dephasing due to inhomogeneities in the light shift. We find that with an rf Rabi frequency of Ω rf and 0.5% inhomogeneity in the the light shift we can prepare an arbitrary Haar-random state in a time T = 4.5 π / Ω rf with average fidelity ( F ψ ) = 0.9992 , and an arbitrary Haar-random SU(10) map in a time T = 24 π / Ω rf with average fidelity ( F U ) = 0.9923 .

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗