SearcharxivSearch

arXiv · 2201.09177

Extensibility of Hohenberg-Kohn Theorem to general quantum systems

Abstract

Hohenberg-Kohn (HK) theorem is a cornerstone of modern electronic structure calculations. For interacting electrons, given that the internal part of the Hamiltonian ($\hat H_{int}$), containing the kinetic energy and Couloumb interaction of electrons, has a fixed form, the theorem states that when the electrons are subject to an external electrostatic field, the ground-state density can inversely determine the field, and thus the full Hamiltonian completely. For a general quantum system, a HK-type Hamiltonian in the form of $\hat H_{hk}\{g_i\}=\hat H_{int}+\sum_i g_i \hat O_i$ can always be defined, by grouping those terms with fixed or preknown coefficients into $\hat H_{int}$, and factorizing the remaining as superposition of a set of Hermitian operators $\{\hat O_i\}$. We ask whether the HK theorem can be extended, so that the ground-state expectation values of $\{\hat O_i\}$ as the generalized density can in principle be used as the fundamental variables determining all the properties of the system. We show that the question can be addressed by introducing the concept of generalized density correlation matrix (GDCM) defined with respect to the $\{\hat O_i\}$ operators. The invertibility of the GDCM represents a mathematically rigorous and practically useful criterion for the extension of HK theorem to be valid. We apply this criterion to several representative systems, including the quantum Ising dimer, the frustration-free systems, N-level quantum systems with fixed inter-level transition amplitude and tunable level energies, and a fermionic Hubbard chain with inhomogeneous on-site interactions. We suggest that for a finite-size system, finding an invertible GDCM under one single $\{g_i\}$ configuration is typically sufficient to establish the generic extensibility of the HK theorem in the entire parameter space.

Explore related subjects

Keep this discovery

BibTeXRIS

Limin Xu, Jiahao Mao, Xingyu Gao, Zheng Liu. 2022-01-23. Extensibility of Hohenberg-Kohn Theorem to general quantum systems. https://doi.org/10.1002/qute.202200041

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

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph