Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.11235

Quantum chemistry, classical heuristics, and quantum advantage

Garnet Kin-Lic Chan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We describe the problems of quantum chemistry, the intuition behind classical heuristic methods used to solve them, a conjectured form of the classical complexity of quantum chemistry problems, and the subsequent opportunities for quantum advantage. This article is written for both quantum chemists and quantum information theorists. In particular, we attempt to summarize the domain of quantum chemistry problems as well as the chemical intuition that is applied to solve them within concrete statements (such as a classical heuristic cost conjecture and a classification of different avenues for quantum advantage) in the hope that this may stimulate future analysis.

Explore related subjects

quant-phcond-mat.str-elphysics.chem-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Garnet Kin-Lic Chan. 2024-07-15. Quantum chemistry, classical heuristics, and quantum advantage. https://arxiv.org/abs/2407.11235

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Global zero-excitation state preparation through subsystem cooling

Preparing interacting quantum systems in low-energy or ground states is a fundamental task in quantum simulation and quantum information processing. In realistic settings, dissipation and active cooling can typically be engineered only on a limited subset of the system. We study the dissipative dynamics of excitation-number conserving quantum systems governed by a GKLS master equation with local jump operators acting on a subset of qubits. We establish sufficient conditions under which such localized dissipation drives the full system to a unique globally attractive zero-excitation state. In particular, we prove that if the Hamiltonian generates excitation transfer described by a graph for which the dissipative subsystem forms a zero forcing set, then the zero-excitation state is the unique globally attractive stationary state. When this state coincides with a ground state of the Hamiltonian, the same mechanism realizes ground-state cooling. Our results provide a graph-theoretic criterion for global state preparation from localized dissipation, which we illustrate using a nearest-neighbor Heisenberg spin chain. For this model, a reduction to the single-excitation sector further yields a scaling estimate with the length of the chain which indicates efficient cooling.

quant-ph↗
arXiv2026

Time symmetry in quantum theories and beyond

There exists a stark tension among different formulations of quantum theory as some are inherently time-symmetric while others are time-asymmetric. This tension is crisply captured when considering physical theories as theories of processes. We present the process theory of quantum physics, QPhys, which treats classical systems as internal to quantum theory. We provide three ways to incorporate time symmetry in QPhys. The first restricts the process theory of QPhys to one that satisfies an additional retrocausality constraint. The second is a novel approach, which extends the notions of causality and retrocausality to apply to systems along with processes. Utilizing this approach, we create a toy model for particle physics , where the causal and retrocausal systems correspond to particles and anti-particles respectively. The third approach extends QPhys to a supertheory that satisfies neither a causality nor a retrocausality constraint. To avoid unphysical predictions we modify either its composition rule or its processes.

quant-ph↗
arXiv2026

Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography

This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extraction scenarios. Leveraging a hierarchy of semidefinite programs derived from the Navascués-Pironio-Acin (NPA) hierarchy, our tool enables efficient computation of entropy bounds based solely on observed statistics, assuming the validity of quantum mechanics. The method's computational efficiency is ensured by its reliance on projective operators within the non-commutative polynomial optimization problem. The method facilitates provable bounds for extractable randomness in noisy scenarios and aligns with modern entropy accumulation theorems. Consequently, the framework offers an adaptable tool for practical quantum cryptographic protocols, expanding secure communication possibilities in untrusted environments.

quant-ph↗