arXiv subjects

Chaobin Liu

Publications and source records attributed to Chaobin Liu.

15 recordsLinked to original sources

arXiv2026

Twisted Fiber Bundle Codes over Group Algebras

We introduce a twisted fiber bundle construction of quantum CSS codes over group algebras $R=\mathbb F_2[G]$, where each base generator carries a generator-dependent $R$-linear fiber twist satisfying a flatness condition. This construction extends the untwisted lifted product code, recovered when all twists are identities. We show that invertible twists (satisfying a flatness condition) give a complex chain-isomorphic to the untwisted one, so the resulting binary CSS codes have the same blocklength $n$ and encoded dimension $k$. In contrast, singular chain-compatible twists can lower boundary ranks and increase the number of logical qubits. Examples over $R=\mathbb F_2[D_3]$ show that singular chain-compatible twists can increase the encoded dimension $k$ at fixed blocklength $n$, and in these finite examples the minimum distance $d$ remains unchanged. This provides evidence that singular twisting enlarges the design space beyond the ordinary lifted product construction.

quant-ph↗

arXiv2022

Exact performance of the five-qubit code with coherent errors

To well understand the behavior of quantum error correction codes (QECC) in noise processes, we need to obtain explicit coding maps for QECC. Due to extraordinary amount of computational labor that they entails, explicit coding maps are a little known. Indeed this is even true for one of the most commonly considered quantum codes-the five-qubit code, also known as the smallest perfect code that permits corrections of generic single-qubit errors. With direct but complicated computation, we obtain explicit process matrix of the coding maps with a unital error channel for the five-qubit code. The process matrix allows us to conduct exact analysis on the performance of the quantum code. We prove that the code can correct a generic error in the sense that under repeated concatenation of the coding map with itself, the code does not make any assumption about the error model other than it being weak and thus can remove the error(it can transform/take the error channel to the identity channel if the error is sufficiently small.). We focus on the examination of some coherent error models (non diagonal channels) studied in recent literatures. We numerically derive a lower bound on threshold of the convergence for the code. Furthermore, we analytically show how the code affects the average gate infidelity and diamond distance of the error channels. Explicit formulas of the two measurements for both pre-error channel and post-error channel are derived, and we then analyze the logical error rates of the aforesaid quantum code. Our findings tighten the upper bounds on diamond distance of the noise channel after error corrections obtained in literature.

quant-ph↗

arXiv2017

Probability distributions for Markov chains based quantum walks

We analyze the probability distributions of the quantum walks induced from Markov chains by Szegedy (2004). The first part of this paper is devoted to the quantum walks induced from finite state Markov chains. It is shown that the probability distribution on the states of the underlying Markov chain is always convergent in the Cesaro sense. In particular, we deduce that the limiting distribution is uniform if the transition matrix is symmetric. In the cases of non-symmetric Markov chain, we exemplify that the limiting distribution of the quantum walk is not necessarily identical with the stationary distribution of the underlying irreducible Markov chain. The Szegedy scheme can be extended to infinite state Markov chains (random walks). In the second part, we formulate the quantum walk induced from a lazy random walk on the line. We then obtain the weak limit of the quantum walk. It is noted that the current quantum walk appears to spread faster than its counterpart-quantum walk on the line driven by the Grover coin discussed in literature. The paper closes with an outlook on possible future directions.

quant-ph↗

arXiv2016

Steady states of continuous-time open quantum walks

Continuous-time open quantum walks (CTOQW) are introduced as the formulation of quantum dynamical semigroups of trace-preserving and completely positive linear maps (or quantum Markov semigroups) on graphs. We show that a CTOQW always converges to a steady state regardless of the initial state when a graph is connected. When the graph is both connected and regular, it is shown that the steady state is the maximally mixed state. As shown by the examples in this article, the steady states of CTOQW can be very unusual and complicated even though the underlying graphs are simple. The examples demonstrate that the structure of a graph can affect quantum coherence in CTOQW through a long time run. Precisely, the quantum coherence persists throughout the evolution of the CTOQW when the underlying topology is certain irregular graphs (such as a path or a star as shown in the examples). In contrast, the quantum coherence will eventually vanish from the open quantum system when the underlying topology is a regular graph (such as a cycle).

quant-ph↗

arXiv2015

Quantum walks in the density operator picture

A new approach to quantum walks is presented. Considering a quantum system undergoing some unitary discrete-time evolution in a directed graph G, we think of the vertices of G as sites that are occupied by the quantum system, whose internal state is described by density operators. To formulate the unitary evolution, we define reflections in the tensor product of an internal Hilbert space and a spatial Hilbert space. We then construct unitary channels that govern the evolution of the system in the graph. The discrete dynamics of the system (called quantum walks) is obtained by iterating the unitary channel on the density operator of the quantum system. It turns out that in this framework, the action of the unitary channel on a density operator is described by the usual matrix multiplication.

quant-ph↗

arXiv2015

On the behavior of quantum walks confined to a cycle coupled with a half line

When confined to a topological environment consisting of a cycle coupled with a half-line, quantum walks exhibit long-term statistical tendencies which differ dramatically from the tendencies of classical random walks in the same environment. In particular, as suggested by numerical simulations, the probability distribution of the walker's position resolves, in part, into a non-vanishing distribution on the cycle and, in part, into a ballistic distribution on the half-line. By contrast, for a classical random walk, the probability distribution of the walker's position tends always to vanish on the cycle and to migrate completely to the half-line as a purely diffusive process.

quant-ph↗

arXiv2015

From open quantum walks to unitary quantum walks

We present an idea to convert to a unitary quantum walk any open quantum walk which is defined on lattices as well as on finite graphs. This approach generalizes to the domain of open quantum walks (or quantum Markov chains) the framework introduced by Szegedy for quantizing Markov chains. For the unitary quantum walks formulated in this article, we define the probability and the mean probability of finding the walk at a node, then derive the asymptotic mean probability.

quant-ph↗

arXiv2014

Unitary conjugation channels with continuous random phases

We consider unitary conjugation channels with continuous random phases. The spectral properties of the channel average are examined, thereby the asymptotic behaviors of the repeated quantum interactions of the motion are derived. We then study the channels with uniformly distributed continuous phases on an interval. In this context, it is shown that discrete phases are sufficient to achieve the channel average.

quant-ph↗

arXiv2013

On limiting distributions of quantum Markov chains

In a quantum Markov chain, the temporal succession of states is modeled by the repeated action of a "bistochastic quantum operation" on the density matrix of a quantum system. Based on this conceptual framework, we derive some new results concerning the evolution of a quantum system, including its long-term behavior. Among our findings is the fact that the Ces$\grave{a}$ro limit of any quantum Markov chain always exists and equals the orthogonal projection of the initial state upon the eigenspace of the unit eigenvalue of the bistochastic quantum operation. Moreover, if the unit eigenvalue is the only eigenvalue on the unit circle, then the quantum Markov chain converges in the conventional sense to the said orthogonal projection. As a corollary, we offer a new derivation of the classic result describing limiting distributions of unitary quantum walks on finite graphs \cite{AAKV01}.

quant-ph↗

arXiv2012

Weak limits for quantum walks on the half-line

For a discrete two-state quantum walk (QW) on the half-line with a general condition at the boundary, we formulate and prove a weak limit theorem describing the terminal behavior of its transition probabilities. In this context, localization is possible even for a walk predicated on the assumption of homogeneity. For the Hadamard walk on the half-line, the weak limit is shown to be independent of the initial coin state and to exhibit no localization.

quant-ph↗

arXiv2011

Asymptotic distributions of quantum walks on the line with two entangled coins

We advance the previous studies of quantum walks on the line with two coins. Such four-state quantum walks driven by a three-direction shift operator may have nonzero stationary distributions (localization), thus distinguishing themselves from the quantum walks on the line in the basic scenario (i.e., driven by a single coin). In this work, asymptotic position distributions of the quantum walks are examined. We derive a weak limit for the quantum walks and explicit formulas of stationary probability distribution, whose dependencies on the coin parameter and the initial state of quantum walks are presented. In particular, it is shown that the weak limit for the present quantum walks can be of the form in the basic scenario of quantum walks on the line, for certain initial states of the walk and certain values of the coin parameter. In the case where localization occurs, we show that the stationary probability exponentially decays with the absolute value of a walker's position, independent of the parity of time.

quant-ph↗

arXiv2011

Asymptotic evolution of quantum walks on the $N$-cycle subject to decoherence on both the coin and position degrees of freedom

Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the asymptotic behavior of the system. When $N$ is odd, the density matrix of the system tends, in the long run, to the maximally mixed state, independent of the initial state. When $N$ is even, although the behavior of the system is not necessarily asymptotically stationary, in this case too an explicit formulation is obtained of the asymptotic dynamics of the system. Moreover, this approach enables us to specify the limiting behavior of the mutual information, viewed as a measure of quantum entanglement between subsystems (coin and walker). In particular, our results provide efficient theoretical confirmation of the findings of previous authors, who arrived at their results through extensive numerical simulations. Our results can be attributed to an important theorem which, for a generalized random unitary operation, explicitly identifies the structure of all of its eigenspaces corresponding to eigenvalues of unit modulus.

quant-ph↗

arXiv2010

On the von Neumann entropy of certain quantum walks subject to decoherence

Consider a discrete-time quantum walk on the $N$-cycle governed by the following condition: at every time step of the walk, the option persists, with probability $p$, of exercising a projective measurement on the coin degree of freedom. For a bipartite quantum system of this kind, we prove that the von Neumann entropy of the total density operator converges to its maximum value. Thus, when influenced by decoherence, the mutual information between the two subsystems, corresponding respectively to the space of the coin and the space of the walker, eventually must diminish to zero. To put it plainly, any level of decoherence greater than zero forces the system eventually to become completely "disentangled".}

quant-ph↗

arXiv2009

One-dimensional quantum random walks with two entangled coins

We offer theoretical explanations for some recent observations in numerical simulations of quantum random walks (QRW). Specifically, in the case of a QRW on the line with one particle (walker) and two entangled coins, we explain the phenomenon, called "localization", whereby the probability distribution of the walker's position is seen to exhibit a persistent major "spike" (or "peak") at the initial position and two other minor spikes which drift to infinity in either direction. Another interesting finding in connection with QRW's of this sort pertains to the limiting behavior of the position probability distribution. It is seen that the probability of finding the walker at any given location becomes eventually stationary and non-vanishing. We explain these observations in terms of the degeneration of some eigenvalue of the time evolution operator $U(k)$. An explicit general formula is derived for the limiting probability, from which we deduce the limiting value of the height of the observed spike at the origin. We show that the limiting probability decreases {\em quadratically} for large values of the position $x$. We locate the two minor spikes and demonstrate that their positions are determined by the phases of non-degenerated eigenvalues of $U(k)$. Finally, for fixed time $t$ sufficiently large, we examine the dependence on $t$ of the probability of finding a particle at a given location $x$.

quant-ph↗

arXiv2009

Quantum random walks on the $N$-cycle subject to decoherence on the coin degree of freedom

For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that the mixing behavior tends, in the long-run, to a uniform distribution, regardless of the initial state of the system and irrespective of the parity of the number of nodes $N$. These results confirm the findings of previous authors who arrived at similar conclusions through extensive numerical simulations. In particular, we infer that the mixing time $\bar{M(\epsilon)}$ for the time-everaged probability distribution is of order no greater than $O(N^2/\epsilon)$.

quant-ph↗