Engineering Papers⌕ Search

Engineering topics

Economou, Sophia E.

Publications and source records attributed to Economou, Sophia E..

At least 19 records

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)↗

Scaling adaptive quantum simulation algorithms via operator pool tiling

Adaptive variational quantum simulation algorithms use information from a quantum computer to dynamically create optimal trial wave functions for a given problem Hamiltonian. A key ingredient in these algorithms is a predefined operator pool from which trial wave functions are constructed. Finding suitable pools is critical for the efficiency of the algorithm as the problem size increases. Here, we present a technique called operator pool tiling that facilitates the construction of problem-tailored pools for arbitrarily large problem instances. By first performing an Adaptive Derivative-Assembled Problem-Tailored Ansatz Variational Quantum Eigensolver (ADAPT-VQE) calculation on a smaller instance of the problem using a large, but computationally inefficient, operator pool, we extract the most relevant operators and use them to design more efficient pools for larger instances. We demonstrate the method here on strongly correlated quantum spin models in one and two dimensions, finding that ADAPT automatically finds a highly effective ansatz for these systems. Given that many problems, such as those arising in condensed matter physics, have a naturally repeating lattice structure, we expect the pool tiling method to be a widely applicable technique apt for such systems. Published by the American Physical Society 2024

Van Dyke, John S. (ORCID:0000000167815480)↗

Leakage Reduces Device Coherence Demands for Pulse-Level Molecular Simulations

Quantum simulation on noisy intermediate-scale quantum devices is severely limited by short qubit coherence times. A variational pulse-shaping algorithm known as ctrl-VQE was recently proposed to address this issue by eliminating the need for parameterized quantum circuits, which lead to long state preparation times. Here, in this study, we find the fastest possible pulses that prepare target molecular wave functions for a given device Hamiltonian describing coupled transmon qubits using simulations. We find that the resulting time-optimal pulses develop a bang-bang form consistent with Pontryagin’s maximum principle. We further investigate how the minimal state preparation time is impacted by the number of energy levels active in the transmon simulations. We find that leakage outside the computational subspace (something that is usually considered problematic) speeds up the state preparation, further reducing device coherence-time demands. Our analysis reveals that this speedup is due to both an enlarged solution space of target wave functions and the appearance of additional channels connecting initial and target states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers

Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers. Minimizing quantum computational resources is crucial to achieving this goal. A promising class of algorithms for this purpose consists of variational quantum eigensolvers (VQEs). Among these, problem-tailored versions such as ADAPT-VQE that build variational ansätze step by step from a predefined operator pool perform particularly well in terms of circuit depths and variational parameter counts. However, this improved performance comes at the expense of an additional measurement overhead compared to standard VQEs. Here, we show that this overhead can be reduced to an amount that grows only linearly with the number n of qubits, instead of quartically as in the original ADAPT-VQE. We do this by proving that operator pools of size 2 n − 2 can represent any state in Hilbert space if chosen appropriately. We prove that this is the minimal size of such "complete" pools, discuss their algebraic properties, and present necessary and sufficient conditions for their completeness that allow us to find such pools efficiently. We further show that, if the simulated problem possesses symmetries, then complete pools can fail to yield convergent results, unless the pool is chosen to obey certain symmetry rules. We demonstrate the performance of such symmetry-adapted complete pools by using them in classical simulations of ADAPT-VQE for several strongly correlated molecules. Our findings are relevant for any VQE that uses an ansatz based on Pauli strings.

Shkolnikov, V. O.↗

Solving nuclear structure problems with the adaptive variational quantum algorithm

Here we use the Lipkin-Meshkov-Glick (LMG) model and the valence-space nuclear shell model to examine the likely performance of variational quantum eigensolvers in nuclear-structure theory. The LMG model exhibits both a phase transition and spontaneous symmetry breaking at the mean-field level in one of the phases, features that characterize collective dynamics in medium-mass and heavy nuclei. We show that with appropriate modifications, the ADAPT-VQE algorithm, a particularly flexible and accurate variational approach, is not troubled by these complications. We treat up to 12 particles and show that the number of quantum operations needed to approach the ground-state energy scales linearly with the number of qubits. We find similar scaling when the algorithm is applied to the nuclear shell model with realistic interactions in the sd and pf shells. Although most of these simulations contain no noise, we use a noise model from real IBM hardware to show that for the LMG model with four particles, weak noise has no effect on the efficiency of the algorithm.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Noise-resistant Landau-Zener sweeps from geometrical curves

Landau-Zener physics is often exploited to generate quantum logic gates and to perform state initialization and readout. The quality of these operations can be degraded by noise fluctuations in the energy gap at the avoided crossing. We leverage a recently discovered correspondence between qubit evolution and space curves in three dimensions to design noise-robust Landau-Zener sweeps through an avoided crossing. In the case where the avoided crossing is purely noise-induced, we prove that operations based on monotonic sweeps cannot be robust to noise. Hence, we design families of phase gates based on non-monotonic drives that are error-robust up to second order. In the general case where there is an avoided crossing even in the absence of noise, we present a general technique for designing robust driving protocols that takes advantage of a relationship between the Landau-Zener problem and space curves of constant torsion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Preparing exact eigenstates of the open XXZ chain on a quantum computer

The open spin-1/2 XXZ spin chain with diagonal boundary magnetic fields is the paradigmatic example of a quantum integrable model with open boundary conditions. Here, we formulate a quantum algorithm for preparing Bethe states of this model, corresponding to real solutions of the Bethe equations. The algorithm is probabilistic, with a success probability that decreases with the number of down spins. For a Bethe state of L spins with M down spins, which contains a total of $(^{L}_{M})$ $2^{M} M!$ terms, the algorithm requires L+M 2 +2M qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise

One of the most promising applications of noisy intermediate-scale quantum computers is the simulation of molecular Hamiltonians using the variational quantum eigensolver (VQE). Here, we show that encoding symmetries of the simulated Hamiltonian in the VQE ansatz reduces both classical and quantum resources compared to other widely available ansatze. Through simulations of the H 2 molecule and of a Heisenberg model on a two-dimensional lattice, we verify that these improvements persist in the presence of noise. This is done using both real IBM devices and classical simulations. We also demonstrate how these techniques can be used to find molecular excited states of various symmetries using a noisy processor. We use error-mitigation techniques to further improve the quality of our results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of Quantum Interconnects (QuICs) for Next-Generation Information Technologies

Just as “classical” information technology rests on a foundation built of interconnected information-processing systems, quantum information technology (QIT) must do the same. A critical component of such systems is the “interconnect,” a device or process that allows transfer of information between disparate physical media, for example, semiconductor electronics, individual atoms, light pulses in optical fiber, or microwave fields. While interconnects have been well engineered for decades in the realm of classical information technology, quantum interconnects (QuICs) present special challenges, as they must allow the transfer of fragile quantum states between different physical parts or degrees of freedom of the system. The diversity of QIT platforms (superconducting, atomic, solid-state color center, optical, etc.) that will form a “quantum internet” poses additional challenges. As quantum systems scale to larger size, the quantum interconnect bottleneck is imminent, and is emerging as a grand challenge for QIT. For these reasons, it is the position of the community represented by participants of the NSF workshop on “Quantum Interconnects” that accelerating QuIC research is crucial for sustained development of a national quantum science and technology program. Given the diversity of QIT platforms, materials used, applications, and infrastructure required, a convergent research program including partnership between academia, industry, and national laboratories is required.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Microwave-based arbitrary cphase gates for transmon qubits

Superconducting transmon qubits are of great interest for quantum computing and quantum simulation. A key component of quantum chemistry simulation algorithms is breaking up the evolution into small steps, which naturally leads to the need for nonmaximally entangling, arbitrary CPHASE gates. Here we design such microwave-based gates using an analytically solvable approach leading to smooth, simple pulses. In this work, we use the local invariants of the evolution operator in SU(4) to develop a method of constructing pulse protocols, which allows for the continuous tuning of the phase. We find CPHASE fidelities of more than 0.999 and gate times as low as 100 ns.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Is the Trotterized UCCSD Ansatz Chemically Well-Defined?

The variational quantum eigensolver (VQE) has emerged as one of the most enticing near-term quantum algorithms that can be used to simulate many-body systems such as molecular electronic structures. Serving as an attractive ansatz in the VQE algorithm, unitary coupled cluster (UCC) theory has seen a renewed interest in recent literature. Yet, unlike the original classical UCC theory, implementation on a quantum computer requires a finite-order Suzuki-Trotter decomposition to separate the exponentials of the large sum of Pauli operators. While previous literature has recognized the non-uniqueness of different orderings of the operators in the Trotterized form of UCC methods, the question of whether or not different orderings matter at the chemical scale has not been addressed. In this letter, we explore the effect of operator ordering on the Trotterized UCCSD ansatz, as well as the much more compact k-UpCCGSD ansatz recently proposed by Lee et al. We observe a significant, system-dependent variation in the energies of Trotterizations with different operator orderings. The energy variations occur on a chemical scale, sometimes on the order of hundreds of kcal/mol. This letter establishes the need to define not only the operators present in the ansatz, but also the order in which they appear. This is necessary for adhering to the quantum chemical notion of a ``model chemistry'', in addition to the general importance of scientific reproducibility. As a final note, we suggest a useful strategy to select out of the combinatorial number of possibilities, a single well-defined and effective ordering of the operators.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗