arXiv subjects

Vladimir Korepin

Publications and source records attributed to Vladimir Korepin.

At least 55 records · Page 3Linked to original sources

arXiv2022

Quantum search on noisy intermediate-scale quantum devices

Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's algorithm was designed without considering the physical resources, such as depth, in the real implementations. Therefore, Grover's algorithm can be improved for NISQ devices. In this paper, we demonstrate how to implement quantum search algorithms better on NISQ devices. We present detailed benchmarks of the five-qubit quantum search algorithm on different quantum processors, including IBMQ, IonQ, and Honeywell quantum devices. We report the highest success probability of the five-qubit search algorithm compared to previous works. Our results show that designing the error-aware quantum search algorithms is possible, which can maximally harness the power of NISQ computers.

quant-ph↗

arXiv2022

Local Convertibility in quantum spin systems

Local Convertibility refers to the possibility of transforming a given state into a target one, just by means of LOCC with respect to a given bipartition of the system and it is possible if and only if all the Renyi-entropies of the initial state are smaller than those of the target state. We apply this concept to adiabatic evolutions and ask whether they can be rendered through LOCC in the sense above. We argue that a lack of differential local convertibility (dLC) signals a higher computational power of the system's quantum phase, which is also usually connected with the existence of long-range entanglement, topological order, or edge-states. Remarkably, dLC can detect these global properties already by considering small subsystems. Moreover, we connect dLC to spontaneous symmetry breaking by arguing that states with finite order parameters must be the most classical ones and thus be locally convertible.

cond-mat.str-el↗

arXiv2022

Entanglement entropy production in deep inelastic scattering

Deep inelastic scattering (DIS) samples a part of the wave function of a hadron in the vicinity of the light cone. Lipatov constructed a spin chain which describes the amplitude of DIS in leading logarithmic approximation. Kharzeev and Levin proposed the entanglement entropy as an observable in DIS [Phys. Rev. D 95, 114008 (2017)], and suggested a relation between the entanglement entropy and parton distributions. Here we represent the DIS process as a local quench in the Lipatov's spin chain, and study the time evolution of the produced entanglement entropy. We show that the resulting entanglement entropy depends on time logarithmically, $\mathcal S(t)=1/3 \ln{(t/τ)}$ with $τ= 1/m$ for $1/m \le t\le (mx)^{-1}$, where $m$ is the proton mass and $x$ is the Bjorken $x$. The central charge $c$ of Lipatov's spin chain is determined here to be $c=1$; using the proposed relation between the entanglement entropy and parton distributions, this corresponds to the gluon structure function growing at small $x$ as $xG(x) \sim 1/x^{1/3}$.

quant-ph↗

arXiv2021

Implementation of efficient quantum search algorithms on NISQ computers

Despite the advent of Grover's algorithm for the unstructured search, its successful implementation on near-term quantum devices is still limited. We apply three strategies to reduce the errors associated with implementing quantum search algorithms. Our improved search algorithms have been implemented on the IBM quantum processors. Using them, we demonstrate three- and four-qubit search algorithm with higher average success probabilities compared to previous works. We present the successful execution of the five-qubit search on the IBM quantum processor for the first time. The results have been benchmarked using degraded ratio, which is the ratio between the experimental and the theoretical success probabilities. The fast decay of the degraded ratio supports our divide-and-conquer strategy. Our proposed strategies are also useful for implementation of quantum search algorithms in the post-NISQ era.

quant-ph↗

arXiv2020

Shor-Movassagh chain leads to unusual integrable model

The ground state of Shor-Movassagh chain can be analytically described by the Motzkin paths. There is no analytical description of the excited states, the model is not solvable. We prove the integrability of the model without interacting part in this paper [free Shor-Movassagh]. The Lax pair for the free Shor-Movassagh open chain is explicitly constructed. We further obtain the boundary $K$-matrices compatible with the integrability of the model on the open interval. Our construction provides a direct demonstration for the quantum integrability of the model, described by Yang-Baxter algebra. Due to the lack of crossing unitarity, the integrable open chain can not be constructed by the reflection equation (boundary Yang-Baxter equation).

math-ph↗

arXiv2020

Quantum search on Hanoi network

Hanoi network has a one-dimensional periodic lattice as its main structure with additional long-range edges, which allow having efficient quantum walk algorithm that can find a target state on the network faster than the exhaustive classical search. In this article, we use regular quantum walks and lackadaisical quantum walks respectively to search for a target state. From the curve fitting of the numerical results for Hanoi network of degree three and four we find that their running time for the regular quantum walks followed by amplitude amplification scales as $\mathcal{O}\left(N^{0.79} \sqrt{\log N}\right)$ and $\mathcal{O}\left(N^{0.65} \sqrt{\log N}\right)$ respectively. And for the search by lackadaisical quantum walks the running time scales as $\mathcal{O}\left(N^{0.57}\log N\right)$ and $\mathcal{O}\left(N^{0.50}\log N\right)$ respectively.

quant-ph↗

arXiv2019

Bethe Ansatz for XXX chain with negative spin

XXX spin chain with spin $s=-1$ appears as an effective theory of Quantum Chromodynamics. It is equivalent to lattice nonlinear Schroediger's equation: interacting chain of harmonic oscillators [bosonic]. In thermodynamic limit each energy level is a scattering state of several elementary excitations [lipatons]. Lipaton is a fermion: it can be represented as a topological excitation [soliton] of original [bosonic] degrees of freedom, described by the group $Z_2$ . We also provide the CFT description (including local quenches) and Yang-Yang thermodynamics of the model.

hep-th↗

arXiv2019

Lackadaisical quantum walk for spatial search

Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum search algorithm based on the lackadaisical quantum walk on one- and two-dimensions. It is observed that specific values of the self-loop weight at each vertex of the graph is responsible for such speedup of the algorithm. Searching for a target state on one-dimensional lattice with periodic boundary conditions is possible using lackadaisical quantum walk, which can find a target state with $\mathcal{O}(1)$ success probability after $\mathcal{O} \left( N \right)$ time steps. In two-dimensions, our numerical simulation upto $M=6$ suggests that lackadaisical quantum walk can search one of the $M$ target states in $\mathcal{O}\left(\sqrt{\frac{N}{M}\log \frac{N}{M}}\right)$ time steps.

quant-ph↗

arXiv2018

Renyi entropy of highly entangled spin chains

Entanglement is one of the most intriguing features of quantum theory and a main resource in quantum information science. Ground states of quantum many-body systems with local interactions typically obey an "area law" meaning the entanglement entropy proportional to the boundary length. It is exceptional when the system is gapless, and the area law had been believed to be violated by at most a logarithm for over two decades. Recent discovery of Motzkin and Fredkin spin chain models is striking, since these models provide significant violation of the entanglement beyond the belief, growing as a square root of the volume in spite of local interactions. Although importance of intensive study of the models is undoubted to reveal novel features of quantum entanglement, it is still far from their complete understanding. In this article, we first analytically compute the Renyi entropy of the Motzkin and Fredkin models by careful treatment of asymptotic analysis. The Renyi entropy is an important quantity, since the whole spectrum of an entangled subsystem is reconstructed once the Renyi entropy is known as a function of its parameter. We find non-analytic behavior of the Renyi entropy with respect to the parameter, which is a novel phase transition never seen in any other spin chain studied so far. Interestingly, similar behavior is seen in the Renyi entropy of Rokhsar-Kivelson states in two-dimensions.

hep-th↗

arXiv2018

Non-Interacting Motzkin Chain - Periodic Boundary Conditions

The Motzkin spin chain is a spin-1 model introduced in \cite{shor} as an example of a system exhibiting a high degree of quantum fluctuations whose ground state can be mapped to Motzkin paths that are generated with local equivalence moves. This model is difficult to solve in general but keeping just the height preserving local equivalence moves we show that the model becomes integrable which when projected to certain subspaces of the full Hilbert space is isomorphic to the spin-$\frac{1}{2}$ XXX chain. In fact in the full Hilbert space the system is akin to two non-interacting spin-$\frac{1}{2}$ XXX chains making the spectrum the same as the latter with the change coming in the degeneracy of the states. We then show that including the height-changing local-equivalence move is the same as introducing interactions in the above system.

quant-ph↗

arXiv2018

Phase separation in the six-vertex model with a variety of boundary conditions

We present numerical results for the six-vertex model with a variety of boundary conditions. Adapting an algorithm proposed by Allison and Reshetikhin for domain wall boundary conditions, we examine some modifications of these boundary conditions. To be precise, we discuss partial domain wall boundary conditions, reflecting ends and half turn boundary conditions (domain wall boundary conditions with half turn symmetry).

cond-mat.stat-mech↗

arXiv2018

Quantum Phase Transitions and Localization in Semigroup Fredkin Spin Chain

We construct an extended quantum spin chain model by introducing new degrees of freedom to the Fredkin spin chain. The new degrees of freedom called arrow indices are partly associated to the symmetric inverse semigroup $\cS^3_1$. Ground states of the model fall into three different phases, and quantum phase transition takes place at each phase boundary. One of the phases exhibits logarithmic violation of the area law of entanglement entropy and quantum criticality, whereas the other two obey the area law. As an interesting feature arising by the extension, there are excited states due to disconnections with respect to the arrow indices. We show that these states are localized without disorder.

quant-ph↗

arXiv2017

Quantum Gates Between Distant Qubits via Spin-Independent Scattering

We show how the spin independent scattering of two initially distant qubits, say, in distinct traps or in remote sites of a lattice, can be used to implement an entangling quantum gate between them. The scattering takes place under 1D confinement for which we consider two different scenarios: a 1D wave-guide and a tight-binding lattice. We consider models with contact-like interaction between two fermionic or two bosonic particles. A qubit is encoded in two distinct spins (or other internal) states of each particle. Our scheme enables the implementation of a gate between two qubits which are initially too far to interact directly, and provides an alternative to photonic mediators for the scaling of quantum computers. Fundamentally, an interesting feature is that "identical particles" (e.g., two atoms of the same species) and the 1D confinement, are both necessary for the action of the gate. Finally, we discuss the feasibility of our scheme, the degree of control required to initialize the wave-packets momenta, and show how the quality of the gate is affected by momentum distributions and initial distance. In a lattice, the control of quasi-momenta is naturally provided by few local edge impurities in the lattice potential.

quant-ph↗

arXiv2017

Quantum partial search for uneven distribution of multiple target items

Quantum partial search algorithm is approximate search. It aims to find a target block (which has the target items). It runs a little faster than full Grover search. In this paper, we consider quantum partial search algorithm for multiple target items unevenly distributed in database (target blocks have different number of target items). The algorithm we describe can locate one of the target blocks. Efficiency of the algorithm is measured by number of queries to the oracle. We optimize the algorithm in order to improve efficiency. By perturbation method, we find that the algorithm runs the fastest when target items are evenly distributed in database.

quant-ph↗

arXiv2017

The density profile of the six vertex model with domain wall boundary conditions

We study numerically the density profile in the six-vertex model with domain wall boundary conditions. Using a Monte Carlo algorithm originally proposed by Allison and Reshetikhin we numerically evaluate the inhomogeneous density profiles in the disordered and antiferromagnetic regimes where frozen corners appear. At the free fermion point we present an exact finite-size formula for the density on the horizontal edges that relies on the imaginary time transfer matrix approach. In all cases where exact analytic forms for the density and the arctic curves are known the numerical method shows perfect agreement with them. This also suggests the possibility of its use for accurate quantitative purposes.

cond-mat.stat-mech↗

arXiv2016

Deformed Fredkin Spin Chain with Extensive Entanglement

We introduce a new spin chain which is a deformation of the Fredkin spin chain and has a phase transition between bounded and extensive entanglement entropy scaling. In this chain, spins have a local interaction of three nearest neighbors. The Hamiltonian is frustration-free and its ground state can be described analytically as a weighted superposition of Dyck paths. In the purely spin $1/2$ case, the entanglement entropy obeys an area law: it is bounded from above by a constant, when the size of the block $n$ increases (and $t>1$). When a local color degree of freedom is introduced the entanglement entropy increases linearly with the size of the block (and $t>1$). The entanglement entropy of half of the chain is tightly bounded by ${ n}\log s$ where $n$ is the size of the block, and $s$ is the number of colors. Our chain fosters a new example for a significant boost to entropy and for the existence of the associated critical rainbow phase where the entanglement entropy scales with volume that has recently been discovered in Zhang et al. (arXiv:1606.07795)

cond-mat.stat-mech↗

arXiv2016

Fredkin Spin Chain

We introduce a new model of interacting spin 1/2. It describes interaction of three nearest neighbors. The Hamiltonian can be expressed in terms of Fredkin gates. The Fredkin gate (also known as the CSWAP gate) is a computational circuit suitable for reversible computing. Our construction generalizes the work of Ramis Movassagh and Peter Shor. Our model can be solved by means of Catalan combinatorics in the form of random walks on the upper half of a square lattice [Dyck walks]. Each Dyck path can be mapped to a wave function of the spins. The ground state is an equally weighted superposition of Dyck walks [instead of Motzkin walks]. We can also express it as a matrix product state. We further construct the model of interacting spins 3/2 and greater half-integer spins. The models with higher spins require coloring of Dyck walks. We construct SU(k) symmetric model [here k is the number of colors]. The leading term of the entanglement entropy is then proportional to the square root of the length of the lattice [like in Shor-Movassagh model]. The gap closes as a high power of the length of the lattice.

quant-ph↗

arXiv2014

The nested Algebraic Bethe Ansatz for the supersymmetric t-J and Tensor Networks

We consider a model of strongly correlated electrons in 1D called the t-J model, which was solved by graded algebraic Bethe ansatz. We use it to design graded tensor networks which can be contracted approximately to obtain a Matrix Product State. As a proof of principle, we calculate observables of ground states and excited states of finite lattices up to $18$ lattice sites.

cond-mat.str-el↗