Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/0411006

Topological properties of Berry's phase

Kazuo Fujikawa
View original source ↗Read source document ↗Export metadata ↓

Abstract

By using a second quantized formulation of level crossing, which does not assume adiabatic approximation, a convenient formula for geometric terms including off-diagonal terms is derived. The analysis of geometric phases is reduced to a simple diagonalization of the Hamiltonian in the present formulation. If one diagonalizes the geometric terms in the infinitesimal neighborhood of level crossing, the geometric phases become trivial for any finite time interval $T$. The topological interpretation of Berry's phase such as the topological proof of phase-change rule thus fails in the practical Born-Oppenheimer approximation, where a large but finite ratio of two time scales is involved.

Explore related subjects

quant-phhep-th

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kazuo Fujikawa. 2004-12-24. Topological properties of Berry's phase. https://doi.org/10.1142/s0217732305016579

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

KEEP EXPLORING

Related papers

arXiv2026

Centralised multi link measurement compression with side information

We prove new one shot achievability results for measurement compression of quantum instruments with side information at the receiver. Unlike previous one shot results for this problem, our one shot bounds are nearly optimal and do not need catalytic randomness. In fact, we state a more general problem called centralised multi link measurement compression with quantum side information and provide one shot achievability results for it. As a simple corollary, we obtain one shot measurement compression results for quantum instruments with side information that we mentioned earlier. All our one shot results lead to the standard results for this problem in the asymptotic iid setting. We prove our achievability bounds by first proving a novel sequential classical quantum multipartite covering lemma, which should be of independent interest.

quant-ph↗
arXiv2026

Perfect quantum reflection from a cliff: a potential unbounded from below

We explain how a potential that is well-defined everywhere on the positive half-line, but is nowhere positive and diverges to $-\infty$ as $x\rightarrow 0^+$, can nevertheless confine a particle to the half-line and lead to well-defined dynamics. Such perfect reflection from a "cliff" potential is achieved by a purely dynamical mechanism, without the need to impose any boundary conditions at the edge. We discuss in detail the role of self-adjointness in ensuring dynamical closure at the quantum level, and advocate the principle that, when no boundary conditions or other physical data are given, the formal quantized Hamiltonian is most naturally defined on its maximal domain. We then construct an explicit cliff potential with the claimed properties, showing that the Hamiltonian is self-adjoint on this maximal domain and therefore defines a dynamically closed quantum system. Finally, we study its energy eigenstates, spectrum, and the phase shift associated with the reflection.

quant-ph↗
arXiv2026

AC/DC: Automated Compilation for Dynamic Circuits

Dynamic quantum circuits incorporate mid-circuit measurements (MCMs) and feed-forward operations are crucial for manipulating quantum information. They have been broadly used in quantum error correction and quantum teleportation. Recently, they are utilized to prepare certain states and long-range entangling gates as well as reduce resource overhead in quantum algorithms. In this paper, we present AC/DC, a novel Automated Compilation framework for generating Dynamic quantum Circuits that prepare any unitary operators or states, leveraging numerical optimization-based circuit synthesis methods. The first contribution is introducing optimization objective functions incorporating MCMs and feed-forward operations. The second contribution is embedding these into a popular open-source quantum circuit synthesis framework. We demonstrate generating dynamic circuits for long range entangling gates, circuit optimization, lattice simulations, and state preparation, with validation through simulation and quantum hardware. Furthermore, we perform a noise analysis to assess the impact of MCM and gate errors, identifying scenarios where dynamic circuits provide significant benefits. The dynamic circuits generated by our framework show substantial improvements in reducing circuit depth and, in some cases, the number of gates. To our knowledge, this is the first practical procedure to generate dynamic quantum circuits, paving the way for enhanced circuit generation and optimization methods for near-term quantum computers.

quant-ph↗