SearcharxivSearch

arXiv · 2106.14181

Quantum unitary evolution interspersed with repeated non-unitary interactions at random times: The method of stochastic Liouville equation, and two examples of interactions in the context of a tight-binding chain

Abstract

In the context of unitary evolution of a generic quantum system interrupted at random times with non-unitary evolution due to interactions with either the external environment or a measuring apparatus, we adduce a general theoretical framework to obtain the average density operator of the system at any time during the dynamical evolution. The average is with respect to the classical randomness associated with the random time intervals between successive interactions, which we consider to be independent and identically-distributed random variables. We provide two explicit applications of the formalism in the context of the so-called tight-binding model relevant in various contexts in solid-state physics. In one dimension, the corresponding tight-binding chain models the motion of a charged particle between the sites of a lattice, wherein the particle is for most times localized on the sites, but which owing to spontaneous quantum fluctuations tunnels between nearest-neighbour sites. We consider two representative forms of interactions: stochastic reset of quantum dynamics, in which the density operator is at random times reset to its initial form, and projective measurements performed on the system at random times. In the former case, we demonstrate with our exact results how the particle is localized on the sites at long times, leading to a time-independent mean-squared displacement of the particle about its initial location. In the case of projective measurements at random times, we show that repeated projection to the initial state of the particle results in an effective suppression of the temporal decay in the probability of the particle to be found on the initial state. The amount of suppression is comparable to the one in conventional Zeno effect scenarios, but which however does not require performing measurements at exactly regular intervals that are hallmarks of such scenarios.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Debraj Das, Sushanta Dattagupta, Shamik Gupta. 2021-06-27. Quantum unitary evolution interspersed with repeated non-unitary interactions at random times: The method of stochastic Liouville equation, and two examples of interactions in the context of a tight-binding chain. https://doi.org/10.1088/1742-5468%2Fac6256

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