skip to main content


The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, July 12 until 2:00 AM ET on Saturday, July 13 due to maintenance. We apologize for the inconvenience.

Search for: All records

Creators/Authors contains: "Mazziotti, David A."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Free, publicly-accessible full text available March 6, 2025
  2. 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 twoexcited-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.

    more » « less
  3. Free, publicly-accessible full text available December 4, 2024
  4. Free, publicly-accessible full text available August 1, 2024
  5. Abstract

    Quantum computers are promising tools for simulating many-body quantum systems due to their potential scaling advantage over classical computers. While significant effort has been expended on many-fermion systems, here we simulate a model entangled many-boson system with the contracted quantum eigensolver (CQE). We generalize the CQE to many-boson systems by encoding the bosonic wavefunction on qubits. The CQE provides a compact ansatz for the bosonic wave function whose gradient is proportional to the residual of a contracted Schrödinger equation. We apply the CQE to a bosonic system, whereNquantum harmonic oscillators are coupled through a pairwise quadratic repulsion. The model is relevant to the study of coupled vibrations in molecular systems on quantum devices. Results demonstrate the potential efficiency of the CQE in simulating bosonic processes such as molecular vibrations with good accuracy and convergence even in the presence of noise.

    more » « less
  6. Free, publicly-accessible full text available October 1, 2024
  7. Abstract

    The Pauli exclusion principle governs the fundamental structure and function of fermionic systems from molecules to materials. Nonetheless, when such a fermionic system is in a pure state, it is subject to additional restrictions known as the generalized Pauli constraints (GPCs). Here we verify experimentally the violation of the GPCs for an open quantum system using data from a superconducting-qubit quantum computer. We prepare states of systems with three-to-seven qubits directly on the quantum device and measure the one-fermion reduced density matrix (1-RDM) from which we can test the GPCs. We find that the GPCs of the 1-RDM are sufficiently sensitive to detect the openness of the 3-to-7 qubit systems in the presence of a single-qubit environment. Results confirm experimentally that the openness of a many-fermion quantum system can be decoded from only a knowledge of the 1-RDM with potential applications from quantum computing and sensing to noise-assisted energy transfer.

    more » « less