From the 1 of 16 linked papers with an AI index.
16 papers
An efficient algorithm for approximate shadow Hamiltonian simulation
Abhijit Chakraborty, Bharath Sambasivam, Karunya Shirali +4
The paper introduces an algorithm that approximates real-time quantum dynamics by pruning the operator algebra of a shadow Hamiltonian, reducing the required qubit resources for si…
Quantum simulation of molecular excited-state manifolds and energies using the TEPID-ADAPT-VQE algorithm
Jason Saroni, Bharath Sambasivam, Ayush Asthana +1
The simulation of molecular excited states is a key challenge in quantum chemistry and a promising application for quantum computing. In this work, we investigate the efficacy of t…
Ground state preparation of random all-to-all Hamiltonians using ADAPT-VQE
Sabhyata Gupta, Bharath Sambasivam, Sophia E. Economou +3
The ground state of random Hamiltonians with all-to-all interactions such as the quantum Sherrington-Kirkpatrick (SK) model and the Sachdev-Ye-Kitaev (SYK) model follow volume-law…
How fast can a quantum gate be? Exact speed limits from geometry
Hunter Nelson, Edwin Barnes
The speed of quantum evolution is limited under finite energy resources. While most quantum speed limits (QSLs) are formulated in terms of quantum states, they can be extended to t…
Quantifying electron-nuclear spin entanglement dynamics in central-spin systems using one-tangles
Isabela Gnasso, Khadija Sarguroh, Dorian Gangloff +2
Optically-active solid-state systems such as self-assembled quantum dots, rare-earth ions, and color centers in diamond and SiC are promising candidates for quantum network, comput…
Dynamical error reshaping for dual-rail erasure qubits
Filippos Dakis, Shruti Puri, Sophia E. Economou +1
Erasure qubits -- qubits designed to have an error profile that is dominated by detectable leakage errors -- are a promising way to cut down the resources needed for quantum error…