SearcharxivSearch

arXiv · 1801.04781

Bohmian pathways into chemistry: A brief overview

Abstract

Perhaps because of the popularity that trajectory-based methodologies have always had in Chemistry and the important role they have played, Bohmian mechanics has been increasingly accepted within this community, particularly in those areas of the theoretical chemistry based on quantum mechanics, e.g., quantum chemistry, chemical physics, or physical chemistry. From a historical perspective, this evolution is remarkably interesting, particularly when the scarce applications of Madelung's former hydrodynamical formulation, dating back to the late 1960s and the 1970s, are compared with the many different applications available at present. As also happens with classical methodologies, Bohmian trajectories are essentially used to described and analyze the evolution of chemical systems, to design and implement new computational propagation techniques, or a combination of both. In the first case, Bohmian trajectories have the advantage that they avoid invoking typical quantum-classical correspondence to interpret the corresponding phenomenon or process, while in the second case quantum-mechanical effects appear by themselves, without the necessity to include artificially quantization conditions. Rather than providing an exhaustive revision and analysis of all these applications (excellent monographs on the issue are available in the literature for the interested reader, which can be consulted in the bibliography here supplied), this Chapter has been prepared in a way that it may serve the reader to acquire a general view (or impression) on how Bohmian mechanics has permeated the different traditional levels or pathways to approach molecular systems in Chemistry: electronic structure, molecular dynamics and statistical mechanics. This is done with the aid of some illustrative examples -- theoretical developments in some cases and numerical simulations in other cases.

Explore related subjects

Keep this discovery

BibTeXRIS

A. S. Sanz. 2018-01-15. Bohmian pathways into chemistry: A brief overview. https://arxiv.org/abs/1801.04781

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