A quasiprobability-sampling algorithm estimates expectation values of imaginary-time evolved states without ancilla qubits, with an 8-qubit simulation and a 2-qubit hardware demonstration.
Quantum chemistry in the age of quantum computing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quasiprobabilistic imaginary-time evolution on quantum computers
A quasiprobability-sampling algorithm estimates expectation values of imaginary-time evolved states without ancilla qubits, with an 8-qubit simulation and a 2-qubit hardware demonstration.