SearcharxivSearch

arXiv · 2204.07691

Unification of Mixed Hilbert-Space Representations in Condensed Matter Physics and Quantum Field Theory

Abstract

We present a unification of mixed-space quantum representations in Condensed Matter Physics (CMP) and Quantum Field Theory (QFT). The unifying formalism is based on being able to expand any quantum operator, for bosons, fermions, and spin systems, using a universal basis operator Y(u,v) involving mixed Hilbert spaces of P and Q, respectively, where P and Q are momentum and position operators in CMP (which can be considered as a bozonization of free Bloch electrons which incorporates the Pauli exclusion principle and Fermi-Dirac distribution), whereas these are related to the creation and annihilation operators in QFT, where {\psi}^{{\dag}}=-iP and {\psi}=Q. The expansion coefficient is the Fourier transform of the Wigner quantum distribution function (lattice Weyl transform) otherwise known as the characteristic distribution function. Thus, in principle, fermionization via Jordan-Wigner for spin systems, as well as the Holstein--Primakoff transformation from boson to the spin operators can be performed depending on the ease of the calculations. Unitary transformation on the creation and annihilation operators themselves is also employed, as exemplified by the Bogoliubov transformation. Moreover, whenever Y(u,v) is already expressed in matrix form, M_{ij}, e.g. the Pauli spin matrices, the Jordan--Schwinger transformation is a map to bilinear expressions of creation and annihilation operators which expedites computation of representations. We show that the well-known coherent states formulation of quantum physics is a special case of the present unification. A new formulation of QFT based on Q-distribution of functional-field variables is suggested. The case of nonequilibrium quantum transport physics, which not only involves non-Hermitian operators but also time-reversal symmetry breaking, is discussed in the Appendix.

Explore related subjects

Keep this discovery

BibTeXRIS

Felix A. Buot, Gibson T. Maglasang, Allan Roy B. Elnar. 2022-04-16. Unification of Mixed Hilbert-Space Representations in Condensed Matter Physics and Quantum Field Theory. https://arxiv.org/abs/2204.07691

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