A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Search NASA
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.
Linewidth narrowing in self-injection locked lasers: Effects of quantum confinement
This paper explores the impact of gain medium on linewidth narrowing in integrated self-injection locked III–V/SiN lasers, theoretically and experimentally. We focus on the effects of carrier densities of states in zero- and two-dimensional structures due to quantum-dot and quantum-well confinement. The theoretical approach includes (a) multimode laser interaction to treat mode competition and wave mixing, (b) quantum-optical contributions from spontaneous emission, and (c) composite laser/free-space eigenmodes to describe outcoupling and coupling among components within an extended cavity. For single-cavity lasers, such as distributed feedback lasers, the model reproduces the experimentally observed better linewidth performance of quantum-dot active regions over quantum-well ones. When applied to integrated III–V/SiN lasers, our analysis indicates Hz-level linewidth performance for both quantum-dot and quantum-well gain media due to overcoming the difference in carrier-induced refractive index by incorporating a high-Q SiN passive resonator. Trade-offs are also explored between linewidth, output power, and threshold current.
Cavity quantum electrodynamics↗
TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze
Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored variational quantum eigensolver), which iteratively builds up variational a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled- gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware. Published by the American Physical Society 2024
Anastasiou, Panagiotis G. (ORCID:0000000256601791)↗
Bounding entanglement entropy with Clifford double cosets
Following on our previous work studying the orbits of quantum states under Clifford circuits via reachability graphs, we introduce contracted graphs whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as 𝑊 states and Dicke states, discussing how the diameter of a state's contracted graph constrains the entropic diversity of its two-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any 𝑛-qubit Clifford circuit, for any quantum state. Here, we speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Spatial quantum-interference landscapes of multi-site-controlled quantum dots coupled to extended photonic cavity modes
Abstract A compact platform to integrate emitters in a cavity-like support is to embed quantum dots (QDs) in a photonic crystal (PhC) structure, making them promising candidates for integrated quantum photonic circuits. The emission properties of QDs can be modified by tailored photonic structures, relying on the Purcell effect or strong light-matter interactions. However, the effects of photonic states on spatial features of exciton emissions in these systems are rarely explored. Such effect is difficult to access due to random positions of self-assembled QDs in PhC structures, and the fact that quantum well excitons’ wavefunctions resemble photonic states in a conventional distributed Bragg reflector cavity system. In this work, we instead observe a spatial signature of exciton emission using site-controlled QDs embedded in PhC cavities. In particular, we observe the detuning-dependent spatial repulsion of the QD exciton emissions by polarized imaging of the micro-photoluminescence, dependent on the controlled QD’s position in a spatially extended photonic pattern. The observed effect arises due to the quantum interference between QD decay channel in a spatially-extended cavity mode. Our findings suggest that integration of site-controlled QDs in tailored photonic structures can enable spatially distributed single-photon sources and photon switches.
Physics↗
Integrating magnetic Co-nanopillars in a NbN-based VAN thin film as a multifunctional hybrid metamaterial
NbN thin films are considered as a promising alternative candidate to conventional Al superconducting electrodes for Josephson junction devices, superconducting qubits and quantum logic circuits. Herein, by co-growing ferromagnetic Co with superconducting NbN, self-assembled NbN–Co vertically aligned nanocomposite (VAN) thin films have been successfully deposited on a MgO substrates, with NbN in its cubic superconducting phase. The obtained VAN metamaterials exhibit epitaxial growth of NbN with uniformly dispersed Co nanoplates. Further physical property characterization reveals that the NbN–Co VAN presents ferromagnet properties with strong out-of-plane magnetic anisotropy and optical anisotropy. This hybrid metamaterial system could find future applications in superconducting spintronic devices and quantum computing devices.
Zhang, Yizhi [Purdue Univ., West Lafayette, IN (Un↗
Ground-state-based model reduction with unitary circuits
Here, we present a method to numerically obtain low-energy effective models based on a unitary transformation of the ground state. The algorithm finds a unitary circuit that transforms the ground state of the original model to a projected wavefunction with only the low-energy degrees of freedom. The effective model can then be derived using the unitary transformation encoded in the circuit. We test our method on the one-dimensional and two-dimensional square-lattice Hubbard model at half-filling, and obtain more accurate effective spin models than the standard perturbative approach.
Hubbard model↗
End-to-End Workflow for Machine-Learning-Based Qubit Readout With QICK and hls4ml
In this article, we present an end-to-end workflow for superconducting qubit readout that embeds codesigned neural networks into the quantum instrumentation control kit (QICK). Capitalizing on the custom firmware and software of the QICK platform, which is built on Xilinx radiofrequency system-on-chip field-programmable gate arrays (FPGAs), we aim to leverage machine learning (ML) to address critical challenges in qubit readout accuracy and scalability. The workflow utilizes the hls4ml package and employs quantization-aware training to translate ML models into hardware-efficient FPGA implementations via user-friendly Python application programming interfaces. We experimentally demonstrate the design, optimization, and integration of an ML algorithm for single transmon qubit readout, achieving 96% single-shot fidelity with a latency of 32.25 ns and less than 16% FPGA lookup table resource utilization. Our results offer the community an accessible workflow to advance ML-driven readout and adaptive control in quantum information processing applications.
42 ENGINEERING↗
Backaction-evading receivers with magnetomechanical and electromechanical sensors
Today's mechanical sensors are capable of detecting extremely weak perturbations while operating near the standard quantum limit. However, further improvements can be made in both sensitivity and bandwidth when we reduce the noise originating from the process of measurement itself—the quantum-mechanical backaction of measurement—and go below this ‘standard’ limit, possibly approaching the Heisenberg limit. One of the ways to eliminate this noise is by measuring a quantum nondemolition variable such as the momentum in a free-particle system. Here, we propose and characterize theoretical models for direct velocity measurement that utilize traditional electric and magnetic transducer designs to generate a signal while enabling this backaction evasion. We consider the general readout of this signal via electric or magnetic field sensing by creating toy models analogous to the standard optomechanical position-sensing problem, thereby facilitating the assessment of measurement-added noise. Using simple models that characterize a wide range of transducers, we find that the choice of readout scheme—voltage or current—for each mechanical detector configuration implies access to either the position or velocity of the mechanical subsystem. This in turn suggests a path forward for key fundamental physics experiments such as the direct detection of dark matter particles. Published by the American Physical Society 2024
74 ATOMIC AND MOLECULAR PHYSICS↗
Hardness of Observing Strong-to-Weak Symmetry Breaking
Spontaneous symmetry breaking (SSB) is the cornerstone of our understanding of quantum phases of matter. Recent works have generalized this concept to the domain of mixed states in open quantum systems, where symmetries can be realized in two distinct ways dubbed strong and weak. Novel intrinsically mixed phases of quantum matter can then be defined by the spontaneous breaking of strong symmetry down to weak symmetry. However, proposed order parameters for strong-to-weak SSB (based on mixed-state fidelities or purities) seem to require exponentially many copies of the state, raising the question: Is it possible to efficiently detect strong-to-weak SSB, in general? In this work, we answer this question negatively in the paradigmatic cases of ℤ2 and U(1) symmetries. We construct ensembles of pseudorandom mixed states that do not break the strong symmetry yet are computationally indistinguishable from states that do. This rules out the existence of efficient state-agnostic protocols to detect strong-to-weak SSB.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Ground calibration plan for the Athena/X-IFU microcalorimeter spectrometer
The X-ray Integral Field Unit is the X-ray imaging spectrometer on board one of ESA’s next large missions, Athena. Athena is set to investigate the theme of the Hot and Energetic Universe, with a launch planned in the late-2030s. Based on a high-sensitivity transition edge sensor (TES) detector array operated at very low temperature (50 mK), X-IFU will provide spatially resolved high-resolution spectroscopy of the X-ray sky in the 0.2 to 12 keV energy band, with an energy resolution goal of 4 eV up to 7 keV [3 eV design goal]. This work presents the current calibration plan of the X-IFU. It provides the requirements applicable to the X-IFU calibration, describes the overall calibration strategy, and details the procedure and sources needed for the ground calibration of each parameter or characteristics of the X-IFU.
47 OTHER INSTRUMENTATION↗
Computational synthesis of any N-Qubit pure or mixed state
Future quantum information processing devices will require the use of exotic quantum states, such as specially crafted entangled states, to achieve certain desired computations on demand.
state synthesis pure mixed quantum circuit↗
Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic
The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.
Computational models↗
Q-IRIS: The Evolution of the IRIS Task-Based Runtime to Enable Classical-Quantum Workflows
Extreme heterogeneity in emerging HPC systems are starting to include quantum accelerators, motivating runtimes that can coordinate between classical and quantum workloads. We present a proof-of-concept hybrid execution framework integrating the IRIS asynchronous task-based runtime with the XACC quantum programming framework via the Quantum Intermediate Representation Execution Engine (QIR-EE). IRIS orchestrates multiple programs written in the quantum intermediate representation (QIR) across heterogeneous backends (including multiple quantum simulators), enabling concurrent execution of classical and quantum tasks. Although not a performance study, we report measurable outcomes through the successful asynchronous scheduling and execution of multiple quantum workloads. To illustrate practical runtime implications, we decompose a four-qubit circuit into smaller subcircuits through a process known as quantum circuit cutting, reducing per-task quantum simulation load and demonstrating how task granularity can improve simulator throughput and reduce queueing behavior -- effects directly relevant to early quantum hardware environments. We conclude by outlining key challenges for scaling hybrid runtimes, including coordinated scheduling, classical-quantum interaction management, and support for diverse backend resources in heterogeneous systems.
Miniskar, Narasinga Rao [ORNL] (ORCID:000000018259↗
Red-QAOA: Efficient Variational Optimization through Circuit Reduction
The Quantum Approximate Optimization Algorithm (QAOA) provides a quantum solution for combinatorial optimization problems. However, the optimal parameter searching process of QAOA is greatly affected by noise, leading to non-optimal solutions. This paper introduces a novel approach to optimize QAOA by exploiting the energy landscape concentration of similar instances via graph reduction, thus addressing the effect of noise. We formalize the notion of similar instances in QAOA and develop a Simulated Annealing-based graph reduction algorithm, called Red-QAOA, to identify the most similar subgraph for efficient parameter optimization. Red-QAOA outperforms state-of-the-art Graph Neural Network (GNN) based graph pooling techniques in performance and demonstrates effectiveness on a diverse set of real-world optimization problems encompassing 3200 graphs. Red-QAOA reduced the node counts and edge counts by 28% and 37%, respectively, while maintaining a low mean square error of 2%. These enable the identification of an optimal parameter set that is closer to the ideal true optimal solution in the presence of noise. By substantially streamlining the search for QAOA parameters, our approach sets the stage for the practical application of quantum algorithms in solving complex optimization problems.
Wang, Meng↗
Unified architecture for quantum lookup tables
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.
quantum circuits↗
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)↗
Quantum simulation of excited states from parallel contracted quantum eigensolvers
Abstract Computing excited-state properties of molecules and solids is considered one of the most important near-term applications of quantum computers. While many of the current excited-state quantum algorithms differ in circuit architecture, specific exploitation of quantum advantage, or result quality, one common feature is their rooting in the Schrödinger equation. However, through contracting (or projecting) the eigenvalue equation, more efficient strategies can be designed for near-term quantum devices. Here we demonstrate that when combined with the Rayleigh–Ritz variational principle for mixed quantum states, the ground-state contracted quantum eigensolver (CQE) can be generalized to compute any number of quantum eigenstates simultaneously. We introduce two excited-state (anti-Hermitian) CQEs that perform the excited-state calculation while inheriting many of the remarkable features of the original ground-state version of the algorithm, such as its scalability. To showcase our approach, we study several model and chemical Hamiltonians and investigate the performance of different implementations.
Physics↗