Showing 1–50 of 95 results for author: Korepin, V

Palindromic structure of depth-efficient quantum search algorithms

Authors: Kun Zhang, Hai-Long Shi, Xiao-Hui Wang, Vladimir Korepin

Abstract: Grover's algorithm is optimal in query complexity, but not necessarily in circuit depth. We formulate unstructured quantum search as a circuit-depth optimization problem and identify a critical depth ratio separating query optimality from depth optimality. The resulting depth-efficient search operators exhibit a palindromic structure, in which shallow diffusion-like operators symmetrically replace… ▽ More Grover's algorithm is optimal in query complexity, but not necessarily in circuit depth. We formulate unstructured quantum search as a circuit-depth optimization problem and identify a critical depth ratio separating query optimality from depth optimality. The resulting depth-efficient search operators exhibit a palindromic structure, in which shallow diffusion-like operators symmetrically replace selected Grover diffusion layers while preserving efficient amplitude amplification. This structure yields a simple depth-efficiency criterion and an analytic expression for the minimal expected depth. Applying the framework to $X$-type mixers, local diffusion operators, and nested local diffusion operators, we obtain substantial depth reductions over standard Grover search. In particular, nested local constructions reduce the total circuit depth by about $40\%$ when the oracle and Grover diffusion operators have comparable depth. These results reveal the resource-dependent nature of quantum-search optimality and establish palindromic constructions as a systematic route to depth-efficient quantum search algorithms. △ Less

Submitted 30 May, 2026; originally announced June 2026.

Comments: 7 pages, 5 figures

Hidden Ising models from the generalized Yang-Baxter equation

Authors: Akash Sinha, Somnath Maity, Pramod Padmanabhan, Vladimir Korepin

Abstract: We introduce a one dimensional spin $\frac{1}{2}$ Hamiltonian with multi-site interactions, but still local. The algebra of its Hamiltonian densities resembles that of the transverse field Ising model. Using this fact we show that its spectrum is free-fermionic but with a huge degeneracy for each level. The source of the degeneracy is a set of local conserved quantities that act like a classical b… ▽ More We introduce a one dimensional spin $\frac{1}{2}$ Hamiltonian with multi-site interactions, but still local. The algebra of its Hamiltonian densities resembles that of the transverse field Ising model. Using this fact we show that its spectrum is free-fermionic but with a huge degeneracy for each level. The source of the degeneracy is a set of local conserved quantities that act like a classical background field for the quantum system. The thermodynamics of this system is contrasted with the standard Ising model. At the gapless points in the energy spectrum, we show that this system can be derived from the quantum inverse scattering method adapted to a multi-site generalization of the Yang-Baxter equation as introduced by E. Rowell and Z. Wang. The $R$-matrix is constructed using generators of extraspecial 2-groups. This helps us extract all the conserved charges and lay the framework for a general mechanism to generate such multi-site interaction spin systems that are transverse field Ising models under the hood. A remark on how to obtain P. Fendley's free-fermion in disguise models in this formalism is also included. △ Less

Submitted 28 May, 2026; originally announced May 2026.

Comments: 19 pages + References + Appendices, 7 figures

Asymptotic optimality of Grover-Radhakrishnan-Korepin algorithm

Authors: Kun Zhang, Kang-Yuan Chen, Xiao-Hui Wang, Vladimir Korepin

Abstract: Grover's algorithm is a cornerstone of quantum algorithms and is strictly optimal in oracle-query complexity. While the full search problem admits no further improvement, one may trade accuracy for speed in the partial search problem, where the task is to identify only the block containing the target item. The best known quantum algorithm for the partial search problem is the Grover-Radhakrishnan-… ▽ More Grover's algorithm is a cornerstone of quantum algorithms and is strictly optimal in oracle-query complexity. While the full search problem admits no further improvement, one may trade accuracy for speed in the partial search problem, where the task is to identify only the block containing the target item. The best known quantum algorithm for the partial search problem is the Grover-Radhakrishnan-Korepin (GRK) algorithm, whose optimality has long been conjectured but not proved. In this work, we prove the optimality of GRK in the large-block limit. We formulate partial search as a time-optimal control problem and apply the Pontryagin maximum principle to derive the switching-function dynamics, establish the bang-bang structure of regular extremals, and exclude non-optimal switching patterns. As a result, we show that the optimal regular extremal has the global-local-global form, which yields a control-theoretic proof of the asymptotic optimality of the GRK algorithm in oracle-query complexity. △ Less

Submitted 6 August, 2026; v1 submitted 17 April, 2026; originally announced April 2026.

Comments: Close to published version, 24 pages, 1 figure

Journal ref: J. Phys. A: Math. Theor. 59, 315301 (2026)

Asymptotic bounds on quantum partial search algorithm and its applications to parallel search

Authors: Yan-Bo Jiang, Xiao-Hui Wang, Kun Zhang, Vladimir Korepin

Abstract: Grover's algorithm provides a quadratic speedup over classical algorithms for searching an unstructured database and is known to be strictly optimal in oracle query complexity, with tight bounds on its success probability. Although the standard Grover search cannot be further accelerated in the full-search setting, a trade-off between accuracy and query complexity gives rise to the partial search… ▽ More Grover's algorithm provides a quadratic speedup over classical algorithms for searching an unstructured database and is known to be strictly optimal in oracle query complexity, with tight bounds on its success probability. Although the standard Grover search cannot be further accelerated in the full-search setting, a trade-off between accuracy and query complexity gives rise to the partial search problem. The Grover-Radhakrishnan-Korepin (GRK) algorithm is the standard and most extensively studied protocol for this task. In this work, we provide systematic numerical evidence that the GRK operator sequence gives the highest success probability in all examined cases, supporting it as the optimal ansatz among admissible compositions of global and local Grover operators. Guided by this numerically supported GRK ansatz, we derive an asymptotically tight upper bound on the maximal success probability within the GRK family and establish the corresponding lower bound on the minimal expected number of oracle queries. Furthermore, we investigate parallel quantum search within the partial-search framework. While a direct GRK-based parallelization does not outperform established parallel Grover schemes, we demonstrate that a hybrid strategy combining partial and full search protocols yields a strict, though subleading, improvement over the outer parallel Grover scheme. Our results clarify the fundamental limits of quantum partial search and its role in optimizing parallel quantum search algorithms. △ Less

Submitted 7 July, 2026; v1 submitted 2 March, 2026; originally announced March 2026.

Comments: Close to published version, 18 pages, 4 figures, 6 tables

Journal ref: Phys. Rev. A 114, 012412 (2026)

Minimal nonintegrable models with three-site interactions

Authors: Wen-Ming Fan, Kun Hao, Yang-Yang Chen, Xiao-Hui Wang, Kun Zhang, Vladimir Korepin

Abstract: We study integrability breaking in translationally invariant spin-$1/2$ chains with genuine three-site interactions. Using a two-qubit composite representation, we prove that the deformed Fredkin spin chain is nonintegrable for any nonzero deformation parameter, although its Hamiltonian decomposes into coupled integrable building blocks. We then extract the minimal injective models, defined as the… ▽ More We study integrability breaking in translationally invariant spin-$1/2$ chains with genuine three-site interactions. Using a two-qubit composite representation, we prove that the deformed Fredkin spin chain is nonintegrable for any nonzero deformation parameter, although its Hamiltonian decomposes into coupled integrable building blocks. We then extract the minimal injective models, defined as the simplest models needed for a rigorous nonintegrability test, from the Hamiltonian density of the deformed Fredkin spin chain. Among the sixteen such models, six satisfy the Reshetikhin condition and are integrable, while two satisfy Hokkyo's criterion and are nonintegrable away from special coefficient values. Returning to one-site translation-invariant spin-$1/2$ chains leaves four genuine three-site models: two integrable models and two generically nonintegrable models. These results give a compact classification of minimal three-site models obtained from the deformed Fredkin spin chain and identify a local mechanism by which coupling individually integrable structures can destroy integrability beyond nearest-neighbor interactions. △ Less

Submitted 20 August, 2026; v1 submitted 8 February, 2026; originally announced February 2026.

Comments: 18 pages, 3 figures, 6 tables

Thermodynamics of the Heisenberg XXX chain with negative spin

Authors: Rong Zhong, Yang-Yang Chen, Kun Hao, Wen-li Yang, Vladimir Korepin

Abstract: We study the thermodynamics of the isotropic Heisenberg XXX spin chain with negative spin, focusing on the case $s=-1$. The model is equivalent to the quantum lattice nonlinear Schrödinger (NLS) model and appears as an effective theory in deep inelastic scattering in high-energy quantum chromodynamics. Owing to its integrability, it admits a consistent Bethe Ansatz description and a well-defined t… ▽ More We study the thermodynamics of the isotropic Heisenberg XXX spin chain with negative spin, focusing on the case $s=-1$. The model is equivalent to the quantum lattice nonlinear Schrödinger (NLS) model and appears as an effective theory in deep inelastic scattering in high-energy quantum chromodynamics. Owing to its integrability, it admits a consistent Bethe Ansatz description and a well-defined thermodynamic limit. Using the thermodynamic Bethe Ansatz, we analyze the ground state, elementary excitations, and finite-temperature properties. In contrast to the conventional positive spin XXX chain, the negative spin model exhibits a distinct vacuum structure and excitation spectrum, leading to modified TBA equations and unconventional low-temperature behavior. Although the integral equations resemble those of the Lieb-Liniger Bose gas, the thermodynamics and scaling properties are qualitatively different and cannot be continuously connected. We derive the free energy, entropy, and specific heat, and identify a quantum phase transition separating different thermodynamic regimes. At zero temperature, the excitation spectrum becomes linear in the continuum limit and can be described by a conformal field theory. The low-temperature regime realizes a Luttinger-liquid like phase with features unique to the negative spin XXX chain. △ Less

Submitted 13 August, 2026; v1 submitted 3 February, 2026; originally announced February 2026.

Comments: 41 pages, 15 figures

Journal ref: JHEP 08 (2026) 101

Noninvertible Kramers-Wannier duality symmetries for the discrete-time quantum Ising chain

Authors: Akash Sinha, Pramod Padmanabhan, Vladimir Korepin

Abstract: Integrable trotterization} provides a method to evolve a continuous time integrable many-body system in discrete time, such that it retains its conserved quantities. Here we explicitly show that the first order trotterization of the critical {\it transverse field Ising model} is integrable. The discrete time conserved quantities are obtained from an inhomogeneous transfer matrix constructed using… ▽ More Integrable trotterization} provides a method to evolve a continuous time integrable many-body system in discrete time, such that it retains its conserved quantities. Here we explicitly show that the first order trotterization of the critical {\it transverse field Ising model} is integrable. The discrete time conserved quantities are obtained from an inhomogeneous transfer matrix constructed using the {\it quantum inverse scattering method}. The inhomogeneity parameter determines the discrete time step. We then focus on the non-invertible {\it Kramers-Wannier} duality-symmetry for the trotterized evolution. We find that the discretization of both space and time leads to a doubling of these duality operators. They account for discrete translations in both space and time. As an interesting application, we find that these operators also provide maps between trotterizations of different orders. This helps us extend our results beyond the trotterization scheme and investigate the Kramers-Wannier duality-symmetry for finite time Floquet evolution of the critical transverse field Ising chain. {Finally, we investigate how these non-invertible operators shape the phase diagram of the discrete-time evolution. This question is particularly interesting in the Floquet setting, which is known to host a richer phase structure than its undriven counterpart. We systematically construct the necessary operators which relate different phases away from criticality for both trotterized and Floquet evolutions. △ Less

Submitted 24 June, 2026; v1 submitted 5 November, 2025; originally announced November 2025.

Comments: 8 pages + Refs + Appendices ; v2 12 pages + Refs + Appendices, Includes discussion of KW duality for Floquet evolution of the TFIM, close to the published version

Journal ref: Phys. Rev. B 113, 235141 (2026)

Quantum Utility in Simulating the Real-time Dynamics of the Fermi-Hubbard Model using Superconducting Quantum Computers

Authors: Talal Ahmed Chowdhury, Vladimir Korepin, Vincent R. Pascuzzi, Kwangmin Yu

Abstract: The Fermi-Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi-Hubbard model using IBM's superconducting quantum computers… ▽ More The Fermi-Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi-Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi-Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi-Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Finally, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods. △ Less

Submitted 25 May, 2026; v1 submitted 17 September, 2025; originally announced September 2025.

Comments: 19 pages, 10 figures, matches published version, additional typos corrected

Journal ref: Appl. Phys. Rev. 13, 011434 (2026)

Absence of local conserved charges of the Fredkin spin chain and its truncated versions

Authors: Wen-Ming Fan, Kun Hao, Yang-Yang Chen, Kun Zhang, Xiao-Hui Wang, Vladimir Korepin

Abstract: Conservation laws serve as the hallmark of integrability. The absence of conserved charges typically implies that the model is nonintegrable. The recently proposed Fredkin spin chain exhibits rich structures, and its ground state is analytically known. However, whether the Fredkin spin chain is integrable remains an open question. In this work, through rigorous analytical calculations, we demonstr… ▽ More Conservation laws serve as the hallmark of integrability. The absence of conserved charges typically implies that the model is nonintegrable. The recently proposed Fredkin spin chain exhibits rich structures, and its ground state is analytically known. However, whether the Fredkin spin chain is integrable remains an open question. In this work, through rigorous analytical calculations, we demonstrate that the Fredkin spin chain, under both periodic and open boundary conditions, lacks local conserved charges, thereby confirming its nonintegrable nature. Furthermore, we find that when one or a portion of the Hamiltonian terms are removed (referred to as the truncated Fredkin spin chain), local conserved charges are still absent. Our findings suggest that in models involving three-site interactions, integrable models are generally rare. △ Less

Submitted 23 November, 2025; v1 submitted 5 September, 2025; originally announced September 2025.

Comments: Close to published version, 20 pages, 16 tables

Journal ref: Phys. Rev. B 112, 205124 (2025)

Small $x$ behavior in QCD from maximal entanglement and conformal invariance

Authors: Sebastian Grieninger, Kun Hao, Dmitri E. Kharzeev, Vladimir Korepin

Abstract: Recent evidence suggests that, at small Bjorken $x$, QCD evolution drives the proton into a state of maximal entanglement. If the evolution kernel is assumed to be conformally invariant -- as is the case for the Balitsky-Fadin-Kuraev-Lipatov (BFKL) equation -- we can describe it by a conformal field theory. Moreover, the central charge $c$ of the corresponding conformal field theory emerges as the… ▽ More Recent evidence suggests that, at small Bjorken $x$, QCD evolution drives the proton into a state of maximal entanglement. If the evolution kernel is assumed to be conformally invariant -- as is the case for the Balitsky-Fadin-Kuraev-Lipatov (BFKL) equation -- we can describe it by a conformal field theory. Moreover, the central charge $c$ of the corresponding conformal field theory emerges as the key parameter governing the $x$-dependence of both the entanglement entropy and the structure function. Here we apply the exact Bethe Ansatz methods to the quantum spin chain dual to Lipatov's high energy effective action to extract the central charge of the theory, and find that $c=1$. This implies the $\sim x^{-1/3}$ small $x$ behavior for the structure function -- the prediction that can be tested at the forthcoming Electron-Ion Collider. △ Less

Submitted 23 May, 2026; v1 submitted 29 August, 2025; originally announced August 2025.

Comments: v2: added additional clarifications; 5 + 3 pages

Journal ref: Phys. Rev. D 113, 094030 (2026)

The Yang-Baxter integrability of the critical Ising chain

Authors: Akash Sinha, Tinu Justin, Pramod Padmanabhan, Vladimir Korepin

Abstract: We show that the one dimensional, critical transverse field Ising model is Yang-Baxter integrable. This is done by constructing commuting transfer matrices built out of a $R$-matrix satisfying the Yang-Baxter equation with additive spectral parameters. The $R$-matrix is non-local, as it is expressed in terms of Majorana fermions. It is also non-regular. Nevertheless, we show that the quantum inver… ▽ More We show that the one dimensional, critical transverse field Ising model is Yang-Baxter integrable. This is done by constructing commuting transfer matrices built out of a $R$-matrix satisfying the Yang-Baxter equation with additive spectral parameters. The $R$-matrix is non-local, as it is expressed in terms of Majorana fermions. It is also non-regular. Nevertheless, we show that the quantum inverse scattering method can still be suitably adapted. We then recursively obtain the conserved quantities [in the infinite volume] by the boost operator method. Remarkably, among the conserved charges we also find the Kramers-Wannier duality and other non-invertible symmetries for the periodic transverse field Ising model. △ Less

Submitted 10 October, 2025; v1 submitted 4 June, 2025; originally announced June 2025.

Comments: v3 closer to the published version 29 pages + appendices + references

Journal ref: J. Stat. Mech. (2025) 103102

Majorana fermions solve the tetrahedron equations as well as higher simplex equations

Authors: Pramod Padmanabhan, Vladimir Korepin

Abstract: Yang-Baxter equations define quantum integrable models. The tetrahedron and higher simplex equations are multi-dimensional generalizations. Finding the solutions of these equations is a formidable task. In this work we develop a systematic method - constructing higher simplex operators [solutions of corresponding simplex equations] from lower simplex ones. We call it lifting. By starting from solu… ▽ More Yang-Baxter equations define quantum integrable models. The tetrahedron and higher simplex equations are multi-dimensional generalizations. Finding the solutions of these equations is a formidable task. In this work we develop a systematic method - constructing higher simplex operators [solutions of corresponding simplex equations] from lower simplex ones. We call it lifting. By starting from solutions of Yang-Baxter equations we can construct solutions of the tetrahedron equation and simplex equation in any dimension. We then generalize this by starting from a solution of any lower simplex equation and lifting it [construct solution] to another simplex equation in higher dimension. This process introduces several constraints among the different lower simplex operators that are lifted to form the higher simplex operators. We show that braided Yang-Baxter operators [solutions of Yang-Baxter equations independent of spectral parameters] constructed using Majorana fermions satisfy these constraints, thus solving the higher simplex equations. As a consequence these solutions help us understand the action of an higher simplex operator on Majorana fermions. Apart from these we show that solutions constructed using Dirac (complex) fermions and Clifford algebras also satisfy these constraints. Furthermore it is observed that the Clifford solutions give rise to positive Boltzmann weights resulting in the possibility of physical statistical mechanics models in higher dimensions. Finally we also show that anti-Yang-Baxter operators [solutions of Yang-Baxter-like equations with a negative sign on the right hand side] can also be lifted to higher simplex solutions. △ Less

Submitted 13 March, 2025; v1 submitted 26 October, 2024; originally announced October 2024.

Comments: 27 pages + References ; v2 36 pages + References : Published version, includes a discussion of positivity of Boltzmann weights and more Majorana solutions

Journal ref: Nuclear Physics B (2025), 0550-3213, 116865

Algebraic classification of Hietarinta's solutions of Yang-Baxter equations~:~invertible $4\times 4$ operators

Authors: Somnath Maity, Vivek Kumar Singh, Pramod Padmanabhan, Vladimir Korepin

Abstract: In order to examine the simulation of integrable quantum systems using quantum computers, it is crucial to first classify Yang-Baxter operators. Hietarinta was among the first to classify constant Yang-Baxter solutions for a two-dimensional local Hilbert space (qubit representation). Including the one produced by the permutation operator, he was able to construct eleven families of invertible solu… ▽ More In order to examine the simulation of integrable quantum systems using quantum computers, it is crucial to first classify Yang-Baxter operators. Hietarinta was among the first to classify constant Yang-Baxter solutions for a two-dimensional local Hilbert space (qubit representation). Including the one produced by the permutation operator, he was able to construct eleven families of invertible solutions. These techniques are effective for 4 by 4 solutions, but they become difficult to use for representations with more dimensions. To get over this limitation, we use algebraic ansätze to generate the constant Yang-Baxter solutions in a representation independent way. We employ four distinct algebraic structures that, depending on the qubit representation, replicate 10 of the 11 Hietarinta families. Among the techniques are partition algebras, Clifford algebras, Temperley-Lieb algebras, and a collection of commuting operators. Using these techniques, we do not obtain the $(2,2)$ Hietarinta class. △ Less

Submitted 2 January, 2025; v1 submitted 9 September, 2024; originally announced September 2024.

Comments: v1 - 26 pages + References ; v2, published version - 29 pages + References

Journal ref: J. High Energ. Phys. 2024, 67 (2024)

Near-deterministic quantum search algorithm without phase design

Authors: Zhen Wang, Kun Zhang, Vladimir Korepin

Abstract: Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the algorithm, especially when Grover's algorithm is a subroutine in other algorithms. Grover's algorithm can be deterministic if the phase of the oracle or the diffusion op… ▽ More Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the algorithm, especially when Grover's algorithm is a subroutine in other algorithms. Grover's algorithm can be deterministic if the phase of the oracle or the diffusion operator is delicately designed. The precision of the phases could be a problem. A near-deterministic quantum search algorithm without the phase design is proposed. The algorithm has the same oracle and diffusion operators as Grover's algorithm. One additional component is the rescaled diffusion operator. It acts partially on the database. The success probability of Grover's algorithm is improved by the partial diffusion operator in two different ways. The possible cost is one or two more queries to the oracle. The deterministic search algorithm is also designed when searching one out of eight, sixteen, and thirty-two. △ Less

Submitted 13 January, 2025; v1 submitted 15 July, 2024; originally announced July 2024.

Comments: Published version, 9 pages, 3 figures, 2 tables

Journal ref: Adv. Quantum Technol. 2025, 2400557

Unitary tetrahedron quantum gates

Authors: Vivek Kumar Singh, Akash Sinha, Pramod Padmanabhan, Vladimir Korepin

Abstract: Quantum simulations of many-body systems using 2-qubit Yang-Baxter gates offer a benchmark for quantum hardware. This can be extended to the higher dimensional case with $n$-qubit generalisations of Yang-Baxter gates called $n$-simplex operators. Such multi-qubit gates potentially lead to shallower and more efficient quantum circuits as well. Finding them amounts to identifying unitary solutions o… ▽ More Quantum simulations of many-body systems using 2-qubit Yang-Baxter gates offer a benchmark for quantum hardware. This can be extended to the higher dimensional case with $n$-qubit generalisations of Yang-Baxter gates called $n$-simplex operators. Such multi-qubit gates potentially lead to shallower and more efficient quantum circuits as well. Finding them amounts to identifying unitary solutions of the $n$-simplex equations, the building blocks of higher dimensional integrable systems. These are a set of highly non-linear and over determined system of equations making it notoriously hard to solve even when the local Hilbert spaces are spanned by qubits. We systematically overcome this for higher simplex operators constructed using two methods: from Clifford algebras and by lifting Yang-Baxter operators. The $n=3$ or the tetrahedron case is analyzed in detail. For the qubit case our methods produce 13 inequivalent families of unitary tetrahedron operators. 12 of these families are obtained by appending the 5 unitary families of 4 by 4 constant Yang-Baxter operators of Dye-Hietarinta, with a single qubit operator. As applications, universal sets of single, two and three qubit gates are realized using such unitary tetrahedron operators. The ideas presented in this work can be naturally extended to the higher simplex cases. △ Less

Submitted 25 July, 2024; v1 submitted 15 July, 2024; originally announced July 2024.

Comments: 34 pages of main text + 4 pages of appendices + 8 pages of references; v2 Fixed minor typos, updated Acknowledgments

Geometric representations of braid and Yang-Baxter gates

Authors: Kun Zhang, Kun Hao, Kwangmin Yu, Vladimir Korepin, Wen-Li Yang

Abstract: Brick-wall circuits composed of the Yang-Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang-Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang-Baxter gate. We study the geometric… ▽ More Brick-wall circuits composed of the Yang-Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang-Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang-Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang-Baxter gates via the Yang-Baxterization. We find that the braid and Yang-Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang-Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang-Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang-Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang-Baxter gates on quantum computers. △ Less

Submitted 22 October, 2024; v1 submitted 12 June, 2024; originally announced June 2024.

Comments: Published version, 27 pages, 7 figures, 2 tables

Journal ref: J. Phys. A: Math. Theor. 57 445303 (2024)

Toffoli gates solve the tetrahedron equations

Authors: Akash Sinha, Pramod Padmanabhan, Vladimir Korepin

Abstract: The circuit model of quantum computation can be interpreted as a scattering process. In particular, factorised scattering operators result in integrable quantum circuits that provide universal quantum computation and are potentially less noisy. These are realized through Yang-Baxter or 2-simplex operators. A natural question is to extend this construction to higher qubit gates, like the Toffoli ga… ▽ More The circuit model of quantum computation can be interpreted as a scattering process. In particular, factorised scattering operators result in integrable quantum circuits that provide universal quantum computation and are potentially less noisy. These are realized through Yang-Baxter or 2-simplex operators. A natural question is to extend this construction to higher qubit gates, like the Toffoli gates, which also lead to universal quantum computation but with shallower circuits. We show that unitary families of such operators are constructed by the 3-dimensional generalizations of the Yang-Baxter operators known as tetrahedron or 3-simplex operators. The latter satisfy a spectral parameter-dependent tetrahedron equation. This construction goes through for $n$-Toffoli gates realized using $n$-simplex operators. △ Less

Submitted 26 May, 2024; originally announced May 2024.

Comments: 8 pages + References

Solving the Yang-Baxter, tetrahedron and higher simplex equations using Clifford algebras

Authors: Pramod Padmanabhan, Vladimir Korepin

Abstract: Bethe Ansatz was discoverd in 1932. Half a century later its algebraic structure was unearthed: Yang-Baxter equation was discovered, as well as its multidimensional generalizations [tetrahedron equation and $d$-simplex equations]. Here we describe a universal method to solve these equations using Clifford algebras. The Yang-Baxter equation ($d=2$), Zamalodchikov's tetrahedron equation ($d=3$) and… ▽ More Bethe Ansatz was discoverd in 1932. Half a century later its algebraic structure was unearthed: Yang-Baxter equation was discovered, as well as its multidimensional generalizations [tetrahedron equation and $d$-simplex equations]. Here we describe a universal method to solve these equations using Clifford algebras. The Yang-Baxter equation ($d=2$), Zamalodchikov's tetrahedron equation ($d=3$) and the Bazhanov-Stroganov equation ($d=4$) are special cases. Our solutions form a linear space. This helps us to include spectral parameters. Potential applications are discussed. △ Less

Submitted 8 May, 2024; v1 submitted 17 April, 2024; originally announced April 2024.

Comments: v2 70 pages, Includes missing solutions, all of which are succinctly captured in Theorems 1 and 2

Journal ref: Nuclear Physics B Volume 1007 , October 2024, 116664

Quantum simulation of entanglement and hadronization in jet production: lessons from the massive Schwinger model

Authors: Adrien Florio, David Frenklakh, Kazuki Ikeda, Dmitri E. Kharzeev, Vladimir Korepin, Shuzhe Shi, Kwangmin Yu

Abstract: The possible link between entanglement and thermalization, and the dynamics of hadronization are addressed by studying the real-time response of the massive Schwinger model coupled to external sources. This setup mimics the production and fragmentation of quark jets, as the Schwinger model and QCD share the properties of confinement and chiral symmetry breaking. By using quantum simulations on cla… ▽ More The possible link between entanglement and thermalization, and the dynamics of hadronization are addressed by studying the real-time response of the massive Schwinger model coupled to external sources. This setup mimics the production and fragmentation of quark jets, as the Schwinger model and QCD share the properties of confinement and chiral symmetry breaking. By using quantum simulations on classical hardware, we study the entanglement between the produced jets, and observe the growth of the corresponding entanglement entropy in time. This growth arises from the increased number of contributing eigenstates of the reduced density matrix with sufficiently large and close eigenvalues. We also investigate the physical nature of these eigenstates, and find that at early times they correspond to fermionic Fock states. We then observe the transition from these fermionic Fock states to meson-like bound states as a function of time. In other words, we observe how hadronization develops in real time. At late times, the local observables at mid-rapidity (such as the fermion density and the electric field) approach approximately constant values, suggesting the onset of equilibrium and approach to thermalization. △ Less

Submitted 29 March, 2024; originally announced April 2024.

Comments: 10 pages, 12 figures

Optimal realization of Yang-Baxter gate on quantum computers

Authors: Kun Zhang, Kwangmin Yu, Kun Hao, Vladimir Korepin

Abstract: Quantum computers provide a promising method to study the dynamics of many-body systems beyond classical simulation. On the other hand, the analytical methods developed and results obtained from the integrable systems provide deep insights on the many-body system. Quantum simulation of the integrable system not only provides a valid benchmark for quantum computers but is also the first step in stu… ▽ More Quantum computers provide a promising method to study the dynamics of many-body systems beyond classical simulation. On the other hand, the analytical methods developed and results obtained from the integrable systems provide deep insights on the many-body system. Quantum simulation of the integrable system not only provides a valid benchmark for quantum computers but is also the first step in studying integrable-breaking systems. The building block for the simulation of an integrable system is the Yang-Baxter gate. It is vital to know how to optimally realize the Yang-Baxter gates on quantum computers. Based on the geometric picture of the Yang-Baxter gates, we present the optimal realizations of two types of Yang-Baxter gates with a minimal number of CNOT or $R_{zz}$ gates. We also show how to systematically realize the Yang-Baxter gates via the pulse control. We test and compare the different realizations on IBM quantum computers. We find that the pulse realizations of the Yang-Baxter gates always have a higher gate fidelity compared to the optimal CNOT or $R_{zz}$ realizations. On the basis of the above optimal realizations, we demonstrate the simulation of the Yang-Baxter equation on quantum computers. Our results provide a guideline and standard for further experimental studies based on the Yang-Baxter gate. △ Less

Submitted 7 February, 2024; v1 submitted 31 July, 2023; originally announced July 2023.

Comments: Published version, 14 pages, 11 figures

Journal ref: Adv. Quantum Technol. 2024, 2300345

Real-time non-perturbative dynamics of jet production: quantum entanglement and vacuum modification

Authors: Adrien Florio, David Frenklakh, Kazuki Ikeda, Dmitri Kharzeev, Vladimir Korepin, Shuzhe Shi, Kwangmin Yu

Abstract: The production of jets should allow testing the real-time response of the QCD vacuum disturbed by the propagation of high-momentum color charges. Addressing this problem theoretically requires a real-time, non-perturbative method. It is well known that the Schwinger model [QED in $(1+1)$ dimensions] shares many common properties with QCD, including confinement, chiral symmetry breaking, and the ex… ▽ More The production of jets should allow testing the real-time response of the QCD vacuum disturbed by the propagation of high-momentum color charges. Addressing this problem theoretically requires a real-time, non-perturbative method. It is well known that the Schwinger model [QED in $(1+1)$ dimensions] shares many common properties with QCD, including confinement, chiral symmetry breaking, and the existence of vacuum fermion condensate. As a step in developing such an approach, we report here on fully quantum simulations of a massive Schwinger model coupled to external sources representing quark and antiquark jets as produced in $e^+e^-$ annihilation. We study, for the first time, the modification of the vacuum chiral condensate by the propagating jets and the quantum entanglement between the fragmenting jets. Our results indicate strong entanglement between the fragmentation products of the two jets at rapidity separations $Δη\leq 2$, which can potentially exist also in QCD and can be studied in experiments. △ Less

Submitted 13 July, 2023; v1 submitted 27 January, 2023; originally announced January 2023.

Comments: 5 pages + supplementary materials, 10 figures; final version

Journal ref: Phys. Rev. Lett. 131 (2023) 021902

Quantum multi-programming for Grover's search

Authors: Gilchan Park, Kun Zhang, Kwangmin Yu, Vladimir Korepin

Abstract: Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grove… ▽ More Quantum multi-programming is a method utilizing contemporary noisy intermediate-scale quantum computers by executing multiple quantum circuits concurrently. Despite early research on it, the research remains on quantum gates or small-size quantum algorithms without correlation. In this paper, we propose a quantum multi-programming (QMP) algorithm for Grover's search. Our algorithm decomposes Grover's algorithm by the partial diffusion operator and executes the decomposed circuits in parallel by QMP. We proved that this new algorithm increases the rotation angle of the Grover operator which, as a result, increases the success probability. The new algorithm is implemented on IBM quantum computers and compared with the canonical Grover's algorithm and other variations of Grover's algorithms. The empirical tests validate that our new algorithm outperforms other variations of Grover's algorithms as well as the canonical Grover's algorithm. △ Less

Submitted 18 December, 2022; v1 submitted 29 July, 2022; originally announced July 2022.

Journal ref: Quantum Inf. Process. 22, 54 (2023)

Can a spin chain relate combinatorics to number theory?

Authors: Kun Hao, Olof Salberger, Vladimir Korepin

Abstract: The Motzkin spin chain is a spin-$1$ frustration-free model introduced by Shor & Movassagh. The ground state is constructed by mapping random walks on the upper half of the square lattice to spin configurations. It has unusually large entanglement entropy [quantum fluctuations]. The ground state of the Motzkin chain can be analytically described by the Motzkin paths. There is no analytical descrip… ▽ More The Motzkin spin chain is a spin-$1$ frustration-free model introduced by Shor & Movassagh. The ground state is constructed by mapping random walks on the upper half of the square lattice to spin configurations. It has unusually large entanglement entropy [quantum fluctuations]. The ground state of the Motzkin chain can be analytically described by the Motzkin paths. There is no analytical description of the excited states. The model is not solvable. We simplify the model by removing one of the local equivalence moves of the Motzkin paths. The system becomes integrable [similar to the XXX spin chain]. We call it free Motzkin chain. From the point of view of quantum integrability, the model is special since its $R$-matrix does not have crossing unitarity. We solve the periodic free Motzkin chain by generalizing the functional Bethe Ansatz method. We construct a $T-Q$ relation with an additional parameter to formulate the energy spectrum. This new parameter is related to the roots of unity and can be described by the Möbius function in number theory. We observe further patterns of number theory. △ Less

Submitted 10 August, 2023; v1 submitted 15 February, 2022; originally announced February 2022.

Comments: 14 pages, no figure

Journal ref: JHEP08(2023)009

Quantum search on noisy intermediate-scale quantum devices

Authors: Kun Zhang, Kwangmin Yu, Vladimir Korepin

Abstract: 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 NI… ▽ More 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. △ Less

Submitted 27 September, 2022; v1 submitted 31 January, 2022; originally announced February 2022.

Comments: Close to Published version, 12 pages, 6 figures

Journal ref: EPL 140, 18002 (2022)

Local Convertibility in quantum spin systems

Authors: Luigi Amico, Vladimir Korepin, Alioscia Hamma, Salvatore Marco Giampaolo, Fabio Franchini

Abstract: 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… ▽ More 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. △ Less

Submitted 12 August, 2022; v1 submitted 25 January, 2022; originally announced January 2022.

Comments: Chapter for the Springer Volume "Entanglement in Spin Chains - Theory and Quantum Technology Applications", 33 pages, many figures, typos corrected. arXiv admin note: text overlap with arXiv:1604.06403, arXiv:1306.6685

Report number: RBI-ThPhys-2022-1

Entanglement entropy production in deep inelastic scattering

Authors: Kun Zhang, Kun Hao, Dmitri Kharzeev, Vladimir Korepin

Abstract: 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 part… ▽ More 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}$. △ Less

Submitted 4 January, 2022; v1 submitted 10 October, 2021; originally announced October 2021.

Comments: Published version, 8 pages, 1 figure

Journal ref: Phys. Rev. D 105, 014002 (2022)

Implementation of efficient quantum search algorithms on NISQ computers

Authors: Kun Zhang, Pooja Rao, Kwangmin Yu, Hyunkyung Lim, Vladimir Korepin

Abstract: 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… ▽ More 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. △ Less

Submitted 12 July, 2021; v1 submitted 2 February, 2021; originally announced February 2021.

Comments: Published version, 26 pages, 8 figures

Journal ref: Quantum Inf. Process. 20, 233 (2021)

Shor-Movassagh chain leads to unusual integrable model

Authors: Bin Tong, Olof Salberger, Kun Hao, Vladimir Korepin

Abstract: 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$-matric… ▽ More 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). △ Less

Submitted 22 September, 2020; originally announced September 2020.

Comments: 12 pages, 1 figure

Bethe Ansatz for XXX chain with negative spin

Authors: Kun Hao, Dmitri Kharzeev, Vladimir Korepin

Abstract: 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 o… ▽ More 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. △ Less

Submitted 31 October, 2019; v1 submitted 2 September, 2019; originally announced September 2019.

Comments: 21 pages, 2 figures

Journal ref: Int. J. Mod. Phys. A, Vol. 34, No. 31 (2019) 1950197

Depth optimization of quantum search algorithms beyond Grover's algorithm

Authors: Kun Zhang, Vladimir E. Korepin

Abstract: Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a new depth optimization method for quantum search algorithms. We show that Grover's algorithm is not optimal in depth. We propose a quan… ▽ More Grover's quantum search algorithm provides a quadratic speedup over the classical one. The computational complexity is based on the number of queries to the oracle. However, depth is a more modern metric for noisy intermediate-scale quantum computers. We propose a new depth optimization method for quantum search algorithms. We show that Grover's algorithm is not optimal in depth. We propose a quantum search algorithm, which can be divided into several stages. Each stage has a new initialization, which is a rescaling of the database. This decreases errors. The multistage design is natural for parallel running of the quantum search algorithm. △ Less

Submitted 27 March, 2020; v1 submitted 12 August, 2019; originally announced August 2019.

Comments: Published version. 13 pages, 2 figures, 4 tables

Journal ref: Phys. Rev. A 101, 032346 (2020)

Quantum search on Hanoi network

Authors: Pulak Ranjan Giri, Vladimir Korepin

Abstract: 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… ▽ More 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. △ Less

Submitted 27 January, 2020; v1 submitted 19 March, 2019; originally announced March 2019.

Comments: 8 pages, 4 figures, accepted version

Journal ref: International Journal of Quantum InformationVol. 17, No. 07, 1950060 (2019)

Lackadaisical quantum walk for spatial search

Authors: Pulak Ranjan Giri, Vladimir Korepin

Abstract: 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… ▽ More 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. △ Less

Submitted 3 April, 2019; v1 submitted 14 November, 2018; originally announced November 2018.

Comments: 9 pages, 6 figures

Journal ref: Modern Physics Letters A, Vol. 33, No. 1 (2020) 2050043

Non-Interacting Motzkin Chain - Periodic Boundary Conditions

Authors: Olof Salberger, Pramod Padmanabhan, Vladimir Korepin

Abstract: 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… ▽ More 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. △ Less

Submitted 3 September, 2018; originally announced September 2018.

Comments: 18 pages, 5 figures

Renyi entropy of highly entangled spin chains

Authors: Fumihiko Sugino, Vladimir Korepin

Abstract: 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 log… ▽ More 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. △ Less

Submitted 19 September, 2018; v1 submitted 11 June, 2018; originally announced June 2018.

Comments: 14+22 pages, 8 figures; (v2) references added, (v3) version to be published in International Journal of Modern Physics B

Journal ref: Int. J. Mod. Phys. B 32 No.28, 1850306 (2018)

Quantum Phase Transitions and Localization in Semigroup Fredkin Spin Chain

Authors: Pramod Padmanabhan, Fumihiko Sugino, Vladimir Korepin

Abstract: 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 viol… ▽ More 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. △ Less

Submitted 30 March, 2018; originally announced April 2018.

Comments: 31 pages, 15 figures. arXiv admin note: text overlap with arXiv:1710.10426

Journal ref: Quantum Inf Process (2019) 18: 69

Quantum partial search for uneven distribution of multiple target items

Authors: Kun Zhang, Vladimir Korepin

Abstract: 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 block… ▽ More 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. △ Less

Submitted 24 October, 2017; v1 submitted 24 September, 2017; originally announced September 2017.

Comments: 12 pages, 1 figure

Journal ref: Quantum Inf. Process. (2018) 17: 143

Deformed Fredkin Spin Chain with Extensive Entanglement

Authors: Olof Salberger, Takuma Udagawa, Zhao Zhang, Hosho Katsura, Israel Klich, Vladimir Korepin

Abstract: 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,… ▽ More 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) △ Less

Submitted 15 November, 2016; originally announced November 2016.

Journal ref: J. Stat. Mech. (2017) 063103

Fredkin Spin Chain

Authors: Olof Salberger, Vladimir Korepin

Abstract: 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 combinat… ▽ More 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. △ Less

Submitted 12 May, 2016; originally announced May 2016.

Comments: 20 pages, 7 figures

Violation of Cluster Decomposition and Absence of Light-Cones in Local Integer and Half-Integer Spin Chains

Authors: L. Dell'Anna, O. Salberger, L. Barbiero, A. Trombettoni, V. E. Korepin

Abstract: We compute the ground state correlation functions of an exactly solvable chain of integer spins, recently introduced in [R. Movassagh and P. W. Shor, arXiv:1408.1657], whose ground-state can be expressed in terms of a uniform superposition of all colored Motzkin paths. Our analytical results show that for spin s$\ge$2 there is a violation of the cluster decomposition property. This has to be contr… ▽ More We compute the ground state correlation functions of an exactly solvable chain of integer spins, recently introduced in [R. Movassagh and P. W. Shor, arXiv:1408.1657], whose ground-state can be expressed in terms of a uniform superposition of all colored Motzkin paths. Our analytical results show that for spin s$\ge$2 there is a violation of the cluster decomposition property. This has to be contrasted with s=1, where the cluster property holds. Correspondingly, for s=1 one gets a light-cone profile in the propagation of excitations after a local quench, while the cone is absent for s=2, as shown by time dependent density-matrix-renormalization-group. Moreover, we introduce an original solvable model of half-integer spins which we refer to as Fredkin spin chain, whose ground-state can be expressed in terms of superposition of all Dyck paths. For this model we exactly calculate the magnetization and correlation functions, finding that for s=1/2, a cone-like propagation occurs while for higher spins, s$\ge$3/2, the colors prevent any cone formation and clustering is violated, together with square root deviation from the area law for the entanglement entropy. △ Less

Submitted 23 December, 2016; v1 submitted 27 April, 2016; originally announced April 2016.

Comments: 9 pages, 8 figures, published version

Journal ref: Phys. Rev. B 94, 155140 (2016)

Negativity in the Generalized Valence Bond Solid State

Authors: Raul A. Santos, V. Korepin

Abstract: Using a graphical presentation of the spin $S$ one dimensional Valence Bond Solid (VBS) state, based on the representation theory of the $SU(2)$ Lie-algebra of spins, we compute the spectrum of a mixed state reduced density matrix. This mixed state of two blocks of spins $A$ and $B$ is obtained by tracing out the spins outside $A$ and $B$, in the pure VBS state density matrix. We find in particula… ▽ More Using a graphical presentation of the spin $S$ one dimensional Valence Bond Solid (VBS) state, based on the representation theory of the $SU(2)$ Lie-algebra of spins, we compute the spectrum of a mixed state reduced density matrix. This mixed state of two blocks of spins $A$ and $B$ is obtained by tracing out the spins outside $A$ and $B$, in the pure VBS state density matrix. We find in particular that the negativity of the mixed state is non-zero only for adjacent subsystems. The method introduced here can be generalized to the computation of entanglement properties in Levin-Wen models, that possess a similar algebraic structure to the VBS state in the groundstate. △ Less

Submitted 16 March, 2016; originally announced March 2016.

Comments: 8 pages, 3 Figures. Comments welcomed

Journal ref: Quantum Information Processing, (2016), 1-18

A Review on Quantum Search Algorithms

Authors: Pulak Ranjan Giri, Vladimir E. Korepin

Abstract: The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms etc. Quantum parallelism also si… ▽ More The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It can be understood from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review the Grover quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin, called GRK algorithm are also discussed. △ Less

Submitted 8 February, 2016; originally announced February 2016.

Comments: 43 pages, no figure, revtex4

Journal ref: Quantum Inf. Process. Vol. 16 No. 12 (2017) 1-36

Quantum Gates Between Distant Qubits via Spin-Independent Scattering

Authors: Leonardo Banchi, Enrico Compagno, Vladimir Korepin, Sougato Bose

Abstract: 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… ▽ More 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. △ Less

Submitted 29 November, 2017; v1 submitted 11 December, 2014; originally announced December 2014.

Comments: 10 pages, 7 figures. This article supersedes arXiv:1106.2329. Accepted in Quantum

Journal ref: Quantum 1, 36 (2017)

Local convertibility and the quantum simulation of edge states in many-body systems

Authors: Fabio Franchini, Jian Cui, Luigi Amico, Heng Fan, Mile Gu, Vladimir E. Korepin, Leong Chuan Kwek, Vlatko Vedral

Abstract: In some many-body systems, certain ground state entanglement (Renyi) entropies increase even as the correlation length decreases. This entanglement non-monotonicity is a potential indicator of non-classicality. In this work we demonstrate that such a phenomenon, known as non-local convertibility, is due to the edge state (de)construction occurring in the system. To this end, we employ the example… ▽ More In some many-body systems, certain ground state entanglement (Renyi) entropies increase even as the correlation length decreases. This entanglement non-monotonicity is a potential indicator of non-classicality. In this work we demonstrate that such a phenomenon, known as non-local convertibility, is due to the edge state (de)construction occurring in the system. To this end, we employ the example of the Ising chain, displaying an order-disorder quantum phase transitions. Employing both analytical and numerical methods, we compute entanglement entropies for various system bipartitions (A|B) and consider ground states with and without Majorana edge states. We find that the thermal ground states, enjoying the Hamiltonian symmetries, show non-local convertibility if either A or B are smaller than, or of the order of, the correlation length. In contrast, the ordered (symmetry breaking) ground state is always locally convertible. The edge states behavior explains all these results and could disclose a paradigm to understand local convertibility in other quantum phases of matter. The connection we establish between convertibility and non-local, quantum correlations provides a clear criterion of which features a universal quantum simulator should possess to outperform a classical machine. △ Less

Submitted 23 September, 2014; v1 submitted 27 June, 2013; originally announced June 2013.

Comments: Accepted by Physical Review X. 5 pages (+ 2 pages of Methods & SupplementaryMmaterial). 11 figures. Several changes since first submission

Report number: MIT-CTP 4463

Journal ref: Phys. Rev. X 4, 041028 (2014)

Classical Vs Quantum correlations in composite systems

Authors: Luigi Amico, Sougato Bose, Vladimir E. Korepin, Vlatko Vedral

Abstract: Here we provide the contributions' abstracts published in a volume we edited as a special issue in International Journal of Modern Physics B. The volume deals with the recent progress in quantifying quantum correlations beyond the generic notion of 'correlations in a quantum system'. The main goal of the special issue is to provide authoritative reviews on selected topics discussed in the field in… ▽ More Here we provide the contributions' abstracts published in a volume we edited as a special issue in International Journal of Modern Physics B. The volume deals with the recent progress in quantifying quantum correlations beyond the generic notion of 'correlations in a quantum system'. The main goal of the special issue is to provide authoritative reviews on selected topics discussed in the field in the last few years. Nevertheless many articles contain significant original research. The opening section of the issue is dedicated to foundational aspects of quantum mechanics. The second section deals with diverse quantum information insights into the analysis of quantum resources (like entanglement and quantum discord). Many of the concepts presented in the first part of the issue are applied to spin systems in the third section. The last section of the issue is focused on the dynamics of quantum discord in open systems and in quantum communication protocols. △ Less

Submitted 3 December, 2012; v1 submitted 29 November, 2012; originally announced November 2012.

Comments: Special Issue: Table of contents & Abstracts

Journal ref: Int. J. Mod. Phys. B vol.27 n. 1-3 (2013)

Quantum network teleportation for quantum information distribution and concentration

Authors: Yong-Liang Zhang, Yi-Nan Wang, Xiang-Ru Xiao, Li Jing, Liang-Zhu Mu, V. E. Korepin, Heng Fan

Abstract: We investigate the schemes of quantum network teleportation for quantum information distribution and concentration which are essential in quantum cloud computation and quantum internet. In those schemes, the cloud can send simultaneously identical unknown quantum states to clients located in different places by a network like teleportation with a prior shared multipartite entangled state resource.… ▽ More We investigate the schemes of quantum network teleportation for quantum information distribution and concentration which are essential in quantum cloud computation and quantum internet. In those schemes, the cloud can send simultaneously identical unknown quantum states to clients located in different places by a network like teleportation with a prior shared multipartite entangled state resource. The cloud first perform the quantum operation, each client can recover their quantum state locally by using the classical information announced by the cloud about the measurement result. The number of clients can be beyond the number of identical quantum states intentionally being sent, this quantum network teleportation can make sure that the retrieved quantum state is optimal. Furthermore, we present a scheme to realize its reverse process, which concentrates the states from the clients to reconstruct the original state of the cloud. These schemes facilitate the quantum information distribution and concentration in quantum networks in the framework of quantum cloud computation. Potential applications in time synchronization are discussed. △ Less

Submitted 1 November, 2012; originally announced November 2012.

Comments: 7 pages, 1 figure

Journal ref: Phys. Rev. A 87, 022302 (2013)

Mimicking interacting relativistic theories with stationary pulses of light

Authors: Dimitris G. Angelakis, MingXia Huo, Darrick Chang, Leong Chuan Kwek, Vladimir Korepin

Abstract: One of the most well known relativistic field theory models is the Thirring model (TM). Its realization can demonstrate the famous prediction for the renormalization of mass due to interactions. However, experimental verification of the latter requires complex accelerator experiments whereas analytical solutions of the model can be extremely cumbersome to obtain. In this work, following Feynman's… ▽ More One of the most well known relativistic field theory models is the Thirring model (TM). Its realization can demonstrate the famous prediction for the renormalization of mass due to interactions. However, experimental verification of the latter requires complex accelerator experiments whereas analytical solutions of the model can be extremely cumbersome to obtain. In this work, following Feynman's original proposal, we propose a alternative quantum system as a simulator of the TM dynamics. Here the relativistic particles are mimicked, counter-intuitively, by polarized photons in a quantum nonlinear medium. We show that the entire set of regimes of the Thirring model -- bosonic or fermionic, and massless or massive -- can be faithfully reproduced using coherent light trapping techniques. The sought after correlations' scalings can be extracted by simple probing of the coherence functions of the light using standard optical techniques. △ Less

Submitted 31 July, 2012; originally announced July 2012.

Comments: 6 pages with 3 figures

Journal ref: Phys. Rev. Lett. 110, 100502 (2013)

Quantum phase transition in a multicomponent anyonic Lieb-Liniger model

Authors: Raul A. Santos, Francis N. C. Paraan, Vladimir E. Korepin

Abstract: We study a one-dimensional multicomponent anyon model that reduces to a multicomponent Lieb-Liniger gas of impenetrable bosons (Tonks-Girardeau gas) for vanishing statistics parameter. At fixed component densities, the coordinate Bethe ansatz gives a family of quantum phase transitions at special values of the statistics parameter. We show that the ground state energy changes extensively between d… ▽ More We study a one-dimensional multicomponent anyon model that reduces to a multicomponent Lieb-Liniger gas of impenetrable bosons (Tonks-Girardeau gas) for vanishing statistics parameter. At fixed component densities, the coordinate Bethe ansatz gives a family of quantum phase transitions at special values of the statistics parameter. We show that the ground state energy changes extensively between different phases. Special regimes are studied and a general classification for the transition points is given. An interpretation in terms of statistics of composite particles is proposed. △ Less

Submitted 18 July, 2012; v1 submitted 18 April, 2012; originally announced April 2012.

Comments: 6 pages, 2 PDF figures. Corrections, clarifications, references added

Report number: YITP-SB-12-10

Journal ref: Phys. Rev. B 86, 045123 (2012)

Entanglement spectra of q-deformed higher spin VBS states

Authors: Raul A. Santos, Francis N. C. Paraan, Vladimir E. Korepin, Andreas Klümper

Abstract: We calculate the reduced density matrix of a block of integer spin-S's in a q-deformed valence-bond-solid (VBS) state. This matrix is diagonalized exactly for an infinitely long block in an infinitely long chain. We construct an effective Hamiltonian with the same spectrum as the logarithm of the density matrix. We also derive analytic expressions for the von Neumann and Rényi entanglement entropi… ▽ More We calculate the reduced density matrix of a block of integer spin-S's in a q-deformed valence-bond-solid (VBS) state. This matrix is diagonalized exactly for an infinitely long block in an infinitely long chain. We construct an effective Hamiltonian with the same spectrum as the logarithm of the density matrix. We also derive analytic expressions for the von Neumann and Rényi entanglement entropies. For blocks of finite length, we calculate the eigenvalues of the reduced density matrix by perturbation theory and numerical diagonalization. These results enable us to describe the effects of finite-size corrections on the entanglement spectrum and entropy in this generalized VBS model. △ Less

Submitted 12 April, 2012; v1 submitted 28 January, 2012; originally announced January 2012.

Comments: 14 pages, 8 EPS figures

Report number: YITP-SB-12-03

Journal ref: J. Phys. A: Math. Theor. 45 (2012) 175303

Numerical Contraction of the Tensor Network generated by the Algebraic Bethe Ansatz

Authors: Valentin Murg, Vladimir E. Korepin, Frank Verstraete

Abstract: The algebraic Bethe Ansatz is a prosperous and well-established method for solving one-dimensional quantum models exactly. The solution of the complex eigenvalue problem is thereby reduced to the solution of a set of algebraic equations. Whereas the spectrum is usually obtained directly, the eigenstates are available only in terms of complex mathematical expressions. This makes it very hard in gen… ▽ More The algebraic Bethe Ansatz is a prosperous and well-established method for solving one-dimensional quantum models exactly. The solution of the complex eigenvalue problem is thereby reduced to the solution of a set of algebraic equations. Whereas the spectrum is usually obtained directly, the eigenstates are available only in terms of complex mathematical expressions. This makes it very hard in general to extract properties from the states, like, for example, correlation functions. In our work, we apply the tools of Tensor Network States to describe the eigenstates approximately as Matrix Product States. From the Matrix Product State expression, we then obtain observables like correlation functions directly. △ Less

Submitted 30 January, 2012; v1 submitted 26 January, 2012; originally announced January 2012.

Journal ref: Phys. Rev. B 86, 045125 (2012)

The Algebraic Bethe Ansatz and Tensor Networks

Authors: Valentin Murg, Vladimir E. Korepin, Frank Verstraete

Abstract: We describe the Algebraic Bethe Ansatz for the spin-1/2 XXX and XXZ Heisenberg chains with open and periodic boundary conditions in terms of tensor networks. These Bethe eigenstates have the structure of Matrix Product States with a conserved number of down-spins. The tensor network formulation suggestes possible extensions of the Algebraic Bethe Ansatz to two dimensions. We describe the Algebraic Bethe Ansatz for the spin-1/2 XXX and XXZ Heisenberg chains with open and periodic boundary conditions in terms of tensor networks. These Bethe eigenstates have the structure of Matrix Product States with a conserved number of down-spins. The tensor network formulation suggestes possible extensions of the Algebraic Bethe Ansatz to two dimensions. △ Less

Submitted 26 January, 2012; originally announced January 2012.

Journal ref: Phys. Rev. B 86, 045125 (2012)