Search arXivSearch

arXiv · 1902.01565

Monitoring the dynamics of an open quantum system via a single qubit

Abstract

We investigate the possibility to monitor the dynamics of an open quantum system with the help of a small probe system, coupled via dephasing coupling to the open system of interest. As an example, we consider a dissipative harmonic oscillator and a single qubit as probe system. Qubit plus oscillator are described by a finite temperature quantum master equation, where the dynamics of the whole system can be obtained analytically. We find that the short time behavior of the reduced qubit state (its coherence) provides exhaustive information on the dissipative dynamics of the oscillator. Observing this coherence for two initial states with different out-of-equilibrium temperatures, one can determine all coupling constants and the equilibrium temperature fixed by the external heat bath. In addition, the dephasing coupling to the qubit probe, may be considered as a perturbation of the dissipative oscillator. The corresponding quantum fidelity can be calculated analytically, also. Hence, we find the precise relation between the behavior of the reduced qubit state (its coherence) and that fidelity.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pablo Carlos López Vázquez, Thomas Gorin. 2019-02-05. Monitoring the dynamics of an open quantum system via a single qubit. https://arxiv.org/abs/1902.01565

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

KEEP EXPLORING

Related papers

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

Low-gate-count block encodings for second-quantized fermionic Hamiltonians

Efficient block encoding of many-body Hamiltonians is a central requirement for quantum algorithms in scientific computing, particularly in the early fault-tolerant era. In this work, we introduce new explicit constructions for block encoding second-quantized Hamiltonians that substantially reduce Clifford+T gate complexity and ancilla overhead. By utilizing a data lookup strategy based on the SWAP architecture for the sparsity oracle $O_C$, and a direct sampling method for the amplitude oracle $O_A$ with SELECT-SWAP architecture, we achieve a T count that scales as $\mathcal{\tilde{O}}(\sqrt{L})$ with respect to the number of interaction terms $L$ in general second-quantized Hamiltonians. We also achieve an improved constant factor in the Clifford gate count of our oracle. Furthermore, we design a block encoding that directly targets the $η$-particle subspace, thereby reducing the subnormalization factor from $\mathcal{O}(L)$ to $\mathcal{O}(\sqrt{L})$, and improving fault-tolerant efficiency when simulating systems with fixed particle numbers. Building on the block encoding framework developed for general many-body Hamiltonians, we extend our approach to electronic Hamiltonians whose coefficient tensors exhibit translation invariance or possess decaying structures. Our results provide a practical path toward early fault-tolerant quantum simulation of many-body systems, substantially lowering resource overheads compared to previous methods.

quant-ph

Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA

Divide-and-conquer strategies mitigate hardware constraints for the Quantum Approximate Optimization Algorithm (QAOA) on Noisy Intermediate-Scale Quantum (NISQ) devices by partitioning large interaction graphs into smaller, hardware-compatible sub-problems. However, this approach introduces a severe classical training bottleneck: a decomposition across $m$ boundary nodes generates $2^m$ distinct sub-problems that typically require independent optimization. In this work, we demonstrate that across diverse synthetic and real-world interaction graphs, the variational landscapes of these reduced QAOA instances actually exhibit a robust universality. Adapting the replica-overlap framework of spin-glass physics, we define a landscape-overlap order parameter $q$ to quantify geometric correlations between energy landscapes, revealing a sharp landscape-similarity transition as graph connectivity is tuned. Exploiting this, we introduce Doubly Optimized QAOA (DO-QAOA), an adaptive pipeline that collapses the sub-problems from $2^m$ distinct sub-problems into $K=\mathcal{O}(1)$ effective landscape classes. By performing optimization on a single representative sub-problem and dynamically transferring parameters to remaining sub-problems, DO-QAOA lowers runtime and quantum measurement overhead by orders of magnitude while maintaining a competitive Approximation Ratio Gap (ARG).

quant-ph