Efficient product formulas for commutators and applications to quantum simulation
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Engineering Papers
Results for “Quantum efficiency”
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.
Acceleration of Near-IR Emission through Efficient Surface Passivation in Cd 3 P 2 Quantum Dots
Fast near-IR (NIR) emitters are highly valuable in telecommunications and biological imaging. The most established NIR emitters are epitaxially grown In x Ga 1-x As quantum dots (QDs), but epitaxial growth has several disadvantages. Colloidal synthesis is a viable alternative that produces a few NIR-emitting materials, but they suffer from long photoluminescence (PL) times. These long PL times are intrinsic in some NIR materials (PbS, PbSe) but are attributed to emission from bright trapped carrier states in others. We show that Cd 3 P 2 QDs possess substantial trap emission with radiative times >10 1 ns. Surface passivation through shell growth or coordination of Lewis acids is shown to accelerate the NIR emission from Cd 3 P 2 QDs by decreasing the amount of trap emission. This finding brings us one step closer to the application of colloidally synthesized QDs as quantum emitters.
36 MATERIALS SCIENCE↗
Efficiently Computable Limits on EPR Pair Generation in Quantum Broadcast Channels
We investigate the generation of EPR pairs between three observers in a general causally structured setting, where communication occurs via a noisy quantum broadcast channel. The most general quantum codes for this setup take the form of tripartite quantum channels. Since the receivers are constrained by causal ordering, additional temporal relationships naturally emerge between the parties. These causal constraints enforce intrinsic no-signalling conditions on any tripartite operation, ensuring that it constitutes a physically realizable quantum code for a quantum broadcast channel. We analyze these constraints and, more broadly, characterize the most general quantum codes for communication over such channels. We examine the capabilities of codes that are fully no-signalling among the three parties, positive partial transpose (PPT)-preserving, or both, and derive simple semidefinite programs to compute the achievable entanglement fidelity. We then establish a hierarchy of semidefinite programming converse bounds -- both weak and strong -- for the capacity of quantum broadcast channels for EPR pair generation, in both one-shot and asymptotic regimes. Notably, in the special case of a point-to-point channel, our strong converse bound recovers and strengthens existing results. Finally, we demonstrate how the PPT-preserving codes we develop can be leveraged to construct PPT-preserving entanglement combing schemes, and vice versa.
FOS: Physical sciences↗
A High-Efficiency Delayed Update Algorithm for Evaluating Slater Determinants in Quantum Monte Carlo
For quantum Monte Carlo simulations of molecular systems or supercells with thousands of electrons, matrix operations related to Slater determinants lead the computational cost. McDaniel et al. [J. Chem. Phys. 2017, 147, 174107] proposed a delayed update algorithm to increase computational efficiency by using matrix–matrix multiplication when updating the inverse matrices of Slater determinants. However, preparing intermediate matrices for applying the Sherman–Morrison–Woodbury formula remained a bottleneck. Here, in this work, we introduce an improved algorithm for CPUs and GPUs that (1) reduces this bottleneck by iteratively updating the intermediate matrices and (2) is efficient at any acceptance ratio, with no cost for rejected moves on CPUs and minimal cost on GPUs. We show the full scheme of integrating the delayed update algorithm into a single-electron move. The high efficiency of our algorithm is demonstrated on CPUs and GPUs for a 512 atom/6144 valence electron calculation, with 12× and 2× overall speed-up compared to traditional rank-1 update schemes in diffusion quantum Monte Carlo, respectively.
Luo, Ye [Argonne National Laboratory (ANL), Argonn↗
Efficient learning of t -doped stabilizer states with single-copy measurements
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms for states generated from Clifford circuits with at most log ⁡ ( n ) non-Clifford gates. However, these algorithms necessitate multi-copy measurements, posing implementation challenges in the near term due to the requisite quantum memory. On the contrary, using solely single-qubit measurements in the computational basis is insufficient in learning even the output distribution of a Clifford circuit with one additional T gate under reasonable post-quantum cryptographic assumptions. In this work, we introduce an efficient quantum algorithm that employs only nonadaptive single-copy measurement to learn states produced by Clifford circuits with a maximum of O ( log ⁡ n ) non-Clifford gates, filling a gap between the previous positive and negative results.
Physics↗
Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms
Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.
Ramôa, Mafalda (ORCID:0000000302187801)↗
Towards quantum simulations in particle physics and beyond on noisy intermediate-scale quantum devices
We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high-energy physics and beyond on noisy intermediate-scale quantum (NISQ) devices. The first method is the dimensional expressivity analysis of quantum circuits, which allows for constructing minimal but maximally expressive quantum circuits. The second method is an efficient mitigation of readout errors on quantum devices. Both methods can lead to significant improvements in quantum simulations, e.g. when variational quantum eigensolvers are used. This article is part of the theme issue ‘Quantum technologies in particle physics’.
Science & Technology - Other Topics↗
Symmetry dilemmas in quantum computing for chemistry: A comprehensive analysis
Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically generate long and deep quantum circuits; gate-efficient universal operator pools generally break symmetries; and gate-efficient, fully symmetry-adapted operator pools may not be universal. In this work, we analyze such symmetry dilemmas both theoretically and numerically. On the theory side, we prove that the popular, gate-efficient operator pool consisting of singlet spin-adapted singles and perfect-pairing doubles is not universal when spatial symmetry is enforced. To demonstrate the strengths and weaknesses of the three types of pools, we perform numerical simulations using an adaptive algorithm paired with operator pools that are (i) fully symmetry-adapted and universal, (ii) fully symmetry-adapted and non-universal, and (iii) breaking a single symmetry and universal. Our numerical simulations encompass three physically relevant scenarios in which the target state is (i) the global ground state, (ii) the ground state crossed by a state differing in multiple symmetry properties, and (iii) the ground state crossed by a state differing in a single symmetry property. Our results show when symmetry-breaking but universal pools can be used safely, when enforcing at least one distinguishing symmetry suffices, and when a particular symmetry must be rigorously preserved to avoid variational collapse. Together, the formal and numerical analyses provide a practical guide for designing and benchmarking symmetry-adapted operator pools that balance universality, resource requirements, and robust state targeting in quantum simulations for chemistry.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Energy conservation in real-time nuclear–electronic orbital Ehrenfest dynamics
Real-time nuclear–electronic orbital Ehrenfest (RT-NEO-Ehrenfest) dynamics methods provide a first-principles approach for describing nonadiabatic molecular processes with nuclear quantum effects. For an efficient description of proton transfer within RT-NEO-Ehrenfest dynamics, the basis function center associated with the quantum proton can be allowed to move classically. Here, this traveling proton basis (TPB) approach effectively captures proton quantum dynamics, although its energy conservation behavior is not yet fully satisfactory. Two recently proposed TPB approaches, in principle, conserve the extended energy, which includes both the system energy and the kinetic energy associated with the proton basis function center. Herein, a thermostatted TPB approach is proposed to improve the conservation of the system energy, excluding the kinetic energy associated with the proton basis function center. In this approach, the quantum proton dynamics are modulated by dynamically rescaling the proton momentum operator to maintain the system energy conservation. With the excited-state intramolecular proton transfer of o-hydroxybenzaldehyde as an example, this approach is shown to significantly improve the system energy conservation while preserving the accuracy of the quantum proton dynamics as achieved in the original TPB approach.
Ehrenfest dynamics↗
Characterization and Optimization of Building Blocks for Specialized Computing Platforms
As noise limits the performance of quantum processors, the ability to characterize this noise and develop methods to overcome it is essential for the future of quantum computing. In this report, we develop a complete set of tools for improving quantum processor performance at the application level, including low-level physical models of quantum gates, a numerically efficient method of producing process matrices that span a wide range of model parameters, and full-channel quantum simulations. We then provide a few examples of how to use these tools to study the effects of noise on quantum circuits.
42 ENGINEERING↗
Efficiently Measuring 𝑑-Wave Pairing and Beyond in Quantum Gas Microscopes
Understanding the mechanism of high-temperature superconductivity is among the most important problems in physics, one for which quantum simulation can provide new insights. However, it remains challenging to characterize superconductivity in existing cold-atom quantum simulation platforms. Here, in this work, we introduce a protocol for measuring a broad class of observables in fermionic quantum gas microscopes, including long-range superconducting pairing correlations (after a repulsive-to-attractive mapping). The protocol only requires global controls followed by site-resolved particle number measurements—capabilities that have been already demonstrated in multiple experiments—and is designed by analyzing the Hilbert space of fermions on two sites. The protocol is sample-efficient and we further optimize our pulses for robustness to experimental imperfections such as lattice inhomogeneity. Our Letter introduces a general tool for manipulating quantum states on optical lattices, enhancing their ability to tackle problems such as high-temperature superconductivity.
Hubbard model↗
Reconstructing thermal quantum quench dynamics from pure states
Simulating the nonequilibrium dynamics of thermal states is a fundamental problem across scales from high-energy to condensed-matter physics. Quantum computers may provide a way to solve this problem efficiently. Preparing a thermal state on a quantum computer is challenging, but there exist methods to circumvent this by computing a weighted sum of time-dependent matrix elements in a convenient basis. Further, while the number of basis states can be large, in this paper we show that it can be reduced by simulating only the largest density matrix elements by weight, capturing the density matrix to a specified precision. Leveraging Hamiltonian symmetries enables further reductions. This approach paves the way to more accurate thermal-state dynamics simulations on near-term quantum hardware.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Defining quantum-ready primitives for hybrid HPC-QC supercomputing: a case study in Hamiltonian simulation
As computational demands in scientific applications continue to rise, hybrid high-performance computing (HPC) systems integrating classical and quantum computers (HPC-QC) are emerging as a promising approach to tackling complex computational challenges. One critical area of application is Hamiltonian simulation, a fundamental task in quantum physics and other large-scale scientific domains. This paper investigates strategies for quantum-classical integration to enhance Hamiltonian simulation within hybrid supercomputing environments. By analyzing computational primitives in HPC allocations dedicated to these tasks, we identify key components in Hamiltonian simulation workflows that stand to benefit from quantum acceleration. To this end, we systematically break down the Hamiltonian simulation process into discrete computational phases, highlighting specific primitives that could be effectively offloaded to quantum processors for improved efficiency. Our empirical findings provide insights into system integration, potential offloading techniques, and the challenges of achieving seamless quantum-classical interoperability. We assess the feasibility of quantum-ready primitives within HPC workflows and discuss key barriers such as synchronization, data transfer latency, and algorithmic adaptability. These results contribute to the ongoing development of optimized hybrid solutions, advancing the role of quantum-enhanced computing in scientific research.
97 MATHEMATICS AND COMPUTING↗
Prediction and compression of lattice QCD data using machine learning algorithms on quantum annealer
We present regression and compression algorithms for lattice QCD data utilizing the efficient binary optimization ability of quantum annealers. In the regression algorithm, we encode the correlation between the input and output variables into a sparse coding machine learning algorithm. The trained correlation pattern is used to predict lattice QCD observables of unseen lattice configurations from other observables measured on the lattice. In the compression algorithm, we define a mapping from lattice QCD data of floating-point numbers to the binary coefficients that closely reconstruct the input data from a set of basis vectors. Since the reconstruction is not exact, the mapping defines a lossy compression, but, a reasonably small number of binary coefficients are able to reconstruct the input vector of lattice QCD data with the reconstruction error much smaller than the statistical fluctuation. In both applications, we use D-Wave quantum annealers to solve the NP-hard binary optimization problems of the machine learning algorithms.
79 ASTRONOMY AND ASTROPHYSICS↗
Characterizing quantum circuits with qubit functional configurations
Abstract We develop a systematic framework for characterizing all quantum circuits with qubit functional configurations. The qubit functional configuration is a mathematical structure that can classify the properties and behaviors of quantum circuits collectively. Major benefits of classifying quantum circuits in this way include: 1. All quantum circuits can be classified into corresponding types; 2. Each type characterizes important properties (such as circuit complexity) of the quantum circuits belonging to it; 3. Each type contains a huge collection of possible quantum circuits allowing systematic investigation of their common properties. We demonstrate the theory’s application to analyzing the hardware-efficient ansatzes of variational quantum algorithms. For potential applications, the functional configuration theory may allow systematic understanding and development of quantum algorithms based on their functional configuration types.
97 MATHEMATICS AND COMPUTING↗
Noise resilience of variational quantum compiling
Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Geometric invariants of quantum metrology
Here, we establish a conservation law for the Quantum Fisher Information Matrix (QFIM) expressed as follows; when the QFIM is constructed from a set of observables closed under commutation, i.e., a Lie algebra, the spectrum of the QFIM is invariant under unitary dynamics generated by these same operators. Each Lie algebra therefore endows any quantum state with a fixed “budget” of metrological sensitivity—an intrinsic resource that we show, like optical squeezing in interferometry, cannot be amplified by symmetry-preserving operations. The Uhlmann curvature tensor naturally inherits the same symmetry group, and so quantum incompatibility is similarly fixed. As a result, a metrological analog to Liouville's theorem appears; statistical distances, volumes, and curvatures are invariant under the evolution generated by the Lie algebra. We discuss this as it relates to the quantum analogs of classical optimality criteria. This enables one to efficiently classify useful classes of quantum states at the level of Lie algebras through geometric invariants.
Wilson, Christopher [University of Colorado, Bould↗
Overcoming the fundamental limit of quantum transduction via intraband entanglement
A quantum transducer converts an input signal to an output probe at a distant frequency band while maintaining the quantum information with high fidelity, which is crucial for quantum networking and distributed quantum sensing and computing. In terms of microwave–optical quantum transduction, the state-of-the-art quantum transducers suffer low transduction efficiency from weak nonlinear coupling, wherein increasing pump power to enhance efficiency inevitably leads to thermal noise from heating. Moreover, we reveal that the efficiency-bandwidth product of a cavity electro-optical or electro-optomechanical transducer is fundamentally limited by pump power and nonlinear coupling coefficient, irrespective of cavity engineering efforts. To overcome this fundamental limit, we propose to noiselessly boost the transduction efficiency by consuming intraband entanglement (e.g., microwave–microwave or optical–optical entanglement in the case of microwave–optical transduction). Via a squeezer–coupler–antisqueezer sandwich structure, the protocol enhances the transduction efficiency to unity in the ideal lossless case, given an arbitrarily weak pump and nonlinear coupling. In practical cavity systems, our entanglement-assisted protocol surpasses the non-assisted fundamental limit of the efficiency-bandwidth product and reduces the threshold cooperativity for positive quantum capacity by a factor proportional to two-mode squeezing gain. Given a fixed cooperativity, our approach increases the broadband quantum capacity by orders of magnitude. The entanglement-assisted advantage is robust to ancilla loss and cavity detuning.
Shi, Haowei [Southern California U.] (ORCID:000000↗