Searcharxiv⌕ Search

arXiv subjects

Leonid P. Pryadko

Publications and source records attributed to Leonid P. Pryadko.

At least 37 records · Page 2Linked to original sources
arXiv2017

Dephasing with strings attached

Motivated by the existence of mobile low-energy excitations like domain walls in one dimension or gauge-charged fractionalized particles in higher dimensions, we compare quantum dynamics in the presence of weak Markovian dephasing for a particle hopping on a chain and for an Ising domain wall whose motion leaves behind a string of flipped spins. Exact solutions show that the two models have near identical transport responses in the bulk. On the other hand, in finite-length chains, the broadening of discrete spectral lines is much more noticeable in the case of a domain wall. These results may be of relevance to a broad class of systems including quasi-1D antiferromagnets, polymer chains, and even retinal systems.

cond-mat.mes-hall↗
arXiv2017

Quantum dynamics of a domain wall in the presence of dephasing

We compare quantum dynamics in the presence of Markovian dephasing for a particle hopping on a chain and for an Ising domain wall whose motion leaves behind a string of flipped spins. Exact solutions show that on an infinite chain, the transport responses of the models are nearly identical. However, on finite-length chains, the broadening of discrete spectral lines is much more noticeable in the case of a domain wall.

cond-mat.mes-hall↗
arXiv2016

Bacon-Shor code with continuous measurement of non-commuting operators

We analyze the operation of a four-qubit Bacon-Shor code with simultaneous continuous measurement of non-commuting gauge operators. The error syndrome in this case is monitored via time-averaged cross-correlators of the output signals. We find the logical error rate for several models of decoherence, and also find the termination rate for this quantum error detecting code. The code operation is comparable to that based on projective measurements when the collapse timescale due to continuous measurements is an order of magnitude less than the time period between the projective measurements. An advantage of the continuous-measurement implementation is the absence of time-dependence in the code operation, with passive continuous monitoring of the error syndrome.

quant-ph↗
arXiv2016

Distance verification for classical and quantum LDPC codes

The techniques of distance verification known for general linear codes are re-applied to quantum stabilizer codes. Then distance verification is addressed for classical and quantum LDPC codes. New complexity bounds for distance verification with provable performance are derived using the average weight spectra of the ensembles of LDPC codes. These bounds are expressed in terms of the erasure-correcting capacity of the corresponding ensemble. We also present a new irreducible-cluster technique that can be applied to any LDPC code and takes advantage of parity-checks' sparsity for both classical and quantum LDPC codes. This technique reduces complexity exponents of all existing deterministic techniques designed for generic stabilizer codes with small relative distances, which also include all known families of quantum LDPC codes.

cs.IT↗
arXiv2016

Exponential decay of connectivity and uniqueness in percolation on finite and infinite graphs

We give an upper bound for the uniqueness transition on an arbitrary locally finite graph ${\cal G}$ in terms of the limit of the spectral radii $ρ\left[ H({\cal G}_t)\right]$ of the non-backtracking (Hashimoto) matrices for an increasing sequence of subgraphs ${\cal G}_t\subset{\cal G}_{t+1}$ which converge to ${\cal G}$. With the added assumption of strong local connectivity for the oriented line graph (OLG) of ${\cal G}$, connectivity on any finite subgraph ${\cal G}'\subset{\cal G}$ decays exponentially for $p<(ρ\left[ H({\cal G}^{\prime})\right])^{-1}$.

math-ph↗
arXiv2016

Algebraic bounds for heterogeneous site percolation on directed and undirected graphs

We analyze site percolation on directed and undirected graphs with site-dependent open-site probabilities. We construct upper bounds on cluster susceptibilities, vertex connectivity functions, and the expected number of simple open cycles through a chosen arc; separate bounds are given on finite and infinite (di)graphs. These produce lower bounds for percolation and uniqueness transitions in infinite (di)graphs, and for the formation of a giant component in finite (di)graphs. The bounds are formulated in terms of appropriately weighted adjacency and non-backtracking (Hashimoto) matrices. It turns out to be the uniqueness criterion that is most closely associated with an asymptotically vanishing probability of forming a giant strongly-connected component on a large finite (di)graph.

math-ph↗
arXiv2016

Distance verification for LDPC codes

The problem of finding code distance has been long studied for the generic ensembles of linear codes and led to several algorithms that substantially reduce exponential complexity of this task. However, no asymptotic complexity bounds are known for distance verification in other ensembles of linear codes. Our goal is to re-design the existing generic algorithms of distance verification and derive their complexity for LDPC codes. We obtain new complexity bounds with provable performance expressed in terms of the erasure-correcting thresholds of long LDPC codes. These bounds exponentially reduce complexity estimates known for linear codes.

cs.IT↗
arXiv2015

Universal set of Dynamically Protected Gates for Bipartite Qubit Networks II: Soft Pulse Implementation of the [[5,1,3]] Quantum Error Correcting Code

We model repetitive quantum error correction (QEC) with the single-error-correcting five-qubit code on a network of individually-controlled qubits with always-on Ising couplings, using our previously designed universal set of quantum gates based on sequences of shaped decoupling pulses. In addition to serving as accurate quantum gates, the sequences also provide dynamical decoupling (DD) of low-frequency phase noise. The simulation involves integrating unitary dynamics of six qubits over the duration of tens of thousands of control pulses, using classical stochastic phase noise as a source of decoherence. The combined DD/QEC protocol dramatically improves the coherence, with the QEC alone responsible for more than an order of magnitude infidelity reduction.

quant-ph↗
arXiv2014

Thresholds for correcting errors, erasures, and faulty syndrome measurements in degenerate quantum codes

We suggest a technique for constructing lower (existence) bounds for the fault-tolerant threshold to scalable quantum computation applicable to degenerate quantum codes with sublinear distance scaling. We give explicit analytic expressions combining probabilities of erasures, depolarizing errors, and phenomenological syndrome measurement errors for quantum LDPC codes with logarithmic or larger distances. These threshold estimates are parametrically better than the existing analytical bound based on percolation.

quant-ph↗
arXiv2014

Numerical Techniques for Finding the Distances of Quantum Codes

We survey the existing techniques for calculating code distances of classical codes and apply these techniques to generic quantum codes. For classical and quantum LDPC codes, we also present a new linked-cluster technique. It reduces complexity exponent of all existing deterministic techniques designed for codes with small relative distances (which include all known families of quantum LDPC codes), and also surpasses the probabilistic technique for sufficiently high code rates.

quant-ph↗
arXiv2014

Tight lower bound for percolation threshold on a quasi-regular graph

We construct an exact expression for the site percolation threshold p_c on a quasi-regular tree, and a related exact lower bound for a quasi-regular graph. Both are given by the inverse spectral radius of the appropriate Hashimoto matrix used to count non-backtracking walks. The obtained bound always exceeds the inverse spectral radius of the original graph, and it is also generally tighter than the existing bound in terms of the maximum degree.

math-ph↗
arXiv2014

Demonstrating Entanglement by Testing Bell's Theorem in Majorana Wires

We propose an experiment that would establish the entanglement of Majorana zero modes in semiconductor nanowires by testing the Bell and Clauser-Horne-Shimony-Holt inequalities. Our proposal is viable with realistic system parameters, simple "keyboard" gating, and projective measurement. Simulation results indicate entanglement can be demonstrated with moderately accurate gate operations. In addition to providing further evidence for the existence of the Majorana bound states, our proposal could be used as an experimental stepping stone to more complicated braiding experiments.

cond-mat.mes-hall↗
arXiv2014

Spin glass reflection of the decoding transition for quantum error correcting codes

We study the decoding transition for quantum error correcting codes with the help of a mapping to random-bond Wegner spin models. Families of quantum low density parity-check (LDPC) codes with a finite decoding threshold lead to both known models (e.g., random bond Ising and random plaquette $\Z2$ gauge models) as well as unexplored earlier generally non-local disordered spin models with non-trivial phase diagrams. The decoding transition corresponds to a transition from the ordered phase by proliferation of extended defects which generalize the notion of domain walls to non-local spin models. In recently discovered quantum LDPC code families with finite rates the number of distinct classes of such extended defects is exponentially large, corresponding to extensive ground state entropy of these codes. Here, the transition can be driven by the entropy of the extended defects, a mechanism distinct from that in the local spin models where the number of defect types (domain walls) is always finite.

quant-ph↗
arXiv2013

Dynamically corrected gates for qubits with always-on Ising couplings: Error model and fault-tolerance with the toric code

We describe how a universal set of dynamically-corrected quantum gates can be implemented using sequences of shaped decoupling pulses on any qubit network forming a sparse bipartite graph with always-on Ising interactions. These interactions are constantly decoupled except when they are needed for two-qubit gates. We analytically study the error operators associated with the constructed gates up to third order in the Magnus expansion, analyze these errors numerically in the unitary time evolution of small qubit clusters, and give a bound on high-order errors for qubits on a large square lattice. We prove that with a large enough toric code the present gate set can be used to implement a fault-tolerant quantum memory.

quant-ph↗
arXiv2013

Continuous third harmonic generation in a terahertz driven modulated nanowire

We consider the possibility of observing continuous third-harmonic generation using a strongly driven, single-band one-dimensional metal. In the absence of scattering, the quantum efficiency of frequency tripling for such a system can be as high as 93%. Combining the Floquet quasi-energy spectrum with the Keldysh Green's function technique, we derive the semiclassical master equation for a one-dimensional band of strongly and rapidly driven electrons in the presence of weak scattering by phonons. The power absorbed from the driving field is continuously dissipated by phonon modes, leading to a quasi-equilibrium in the electron distribution. We use the Kronig-Penney model with varying effective mass to establish growth parameters of an InAs/InP nanowire near optimal for third harmonic generation at terahertz frequency range.

cond-mat.mes-hall↗
arXiv2013

Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code

We present a linked-cluster technique for calculating the distance of a quantum LDPC code. It offers an advantage over existing deterministic techniques for codes with small relative distances (which includes all known families of quantum LDPC codes), and over the probabilistic technique for codes with sufficiently high rates.

quant-ph↗
arXiv2013

Quantum "hyperbicycle" low-density parity check codes with finite rate

We introduce a "hyperbicycle" ansatz for quantum codes which gives the hypergraph-product (generalized toric) codes by Tillich and Zémor and generalized bicycle codes by MacKay et al. as limiting cases. The construction allows for both the lower and the upper bounds on the minimum distance; they scale as a square root of the block length. Many of thus defined codes have finite rate and a limited-weight stabilizer generators, an analog of classical low-density parity check (LDPC) codes. Compared to the hypergraph-product codes, hyperbicycle codes generally have wider range of parameters; in particular, they can have higher rate while preserving the (estimated) error threshold.

quant-ph↗