151 citations · 211 across the 10 of their papers we have counts for
12 papers · 1 filter
From Wavefunction Regularity to Eigenvector Conditioning: Accuracy--Cost Trade-offs of Quantum Algorithms for Non-Hermitian Transcorrelated Hamiltonians
Cheng-Lin Hong, Emiel Koridon, Paul K. Faehrmann +3
The electron--electron Coulomb singularity forces cusp structure in electronic wavefunctions. This cusp structure limits wavefunction regularity and slows the convergence of expans…
Reinforcement learning of quantum circuit architectures for molecular potential energy curves
Maureen Krumtünger, Alissa Wilms, Paul K. Faehrmann +4
Quantum chemistry and optimization are two of the most prominent applications of quantum computers. Variational quantum algorithms have been proposed for solving problems in these…
Programmable digital quantum simulation of 2D Fermi-Hubbard dynamics using 72 superconducting qubits
Faisal Alam, Jan Lukas Bosse, Ieva Čepaitė +41
Simulating the time-dynamics of quantum many-body systems was the original use of quantum computers proposed by Feynman, motivated by the critical role of quantum interactions betw…
Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation
Faisal Alam, Jan Lukas Bosse, Ieva Čepaitė +37
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classic…
Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
Simon Cichy, Paul K. Faehrmann, Lennart Bittel +2
Classical simulations of noisy quantum circuits are instrumental to our understanding of the behavior of real-world quantum systems and the identification of regimes where one expe…
In the shadow of the Hadamard test: Using the garbage state for good and further modifications
Paul K. Faehrmann, Jens Eisert, Richard Kueng
The Hadamard test is naturally suited for the intermediate regime between the current era of noisy quantum devices and complete fault tolerance. Its applications use measurements o…
Short-time simulation of quantum dynamics by Pauli measurements
Paul K. Faehrmann, Jens Eisert, Maria Kieferova +1
Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum…
An access model for quantum encoded data
Miguel Murça, Paul K. Faehrmann, Yasser Omar
We introduce and investigate a data access model (approximate sample and query) that is satisfiable by the preparation and measurement of block encoded states, as well as in contex…
Verifiable measurement-based quantum random sampling with trapped ions
Martin Ringbauer, Marcel Hinsche, Thomas Feldker +13
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling…
Perturbative gadgets for gate-based quantum computing: Non-recursive constructions without subspace restrictions
Simon Cichy, Paul K. Faehrmann, Sumeet Khatri +1
Perturbative gadgets are a tool to encode part of a Hamiltonian, usually the low-energy subspace, into a different Hamiltonian with favorable properties, for instance, reduced loca…
Training Quantum Embedding Kernels on Near-Term Quantum Computers
Thomas Hubregtsen, David Wierichs, Elies Gil-Fuster +3
Kernel methods are a cornerstone of classical machine learning. The idea of using quantum computers to compute kernels has recently attracted attention. Quantum embedding kernels (…
Randomizing multi-product formulas for Hamiltonian simulation
Paul K. Faehrmann, Mark Steudtner, Richard Kueng +2
Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum…