Schmidt Rank Research Articles

The Schmidt Rank for the Commuting Operator Framework

In quantum information theory, the Schmidt rank is a fundamental measure for the entanglement dimension of a pure bipartite state. Its natural definition uses the Schmidt decomposition of vectors on bipartite Hilbert spaces, which does not exist (or at least is not canonically given) if the observable algebras of the local systems are allowed to be general C*-algebras. In this work, we generalize the Schmidt rank to the commuting operator framework where the joint system is not necessarily described by the minimal tensor product but by a general bipartite algebra. We give algebraic and operational definitions for the Schmidt rank and show their equivalence. We analyze bipartite states and compute the Schmidt rank in several examples: the vacuum in quantum field theory, Araki–Woods-Powers states, as well as ground states and translation invariant states on spin chains which are viewed as bipartite systems for the left and right half chains. We conclude with a list of open problems for the commuting operator framework.

Order-six complex hadamard matrices constructed by Schmidt rank and partial transpose in operator algebra

Hadamard matrices play a key role in the study of algebra and quantum information theory, and it is an open problem to characterize 6 6 Hadamard matrices. In this paper, we investigate the problem in terms of the Schmidt rank. The primary achievement of this paper lies in establishing a systematic approach to generate 6 6 Hadamard matrices and H-2 reducible matrices through partial transpose. First, if the Schmidt rank of a Hadamard matrix is at most three, then the partial transpose of the Hadamard matrix is also a Hadamard matrix. Conversely, if the Schmidt rank is four, then the partial transpose is no longer a Hadamard matrix. Second, we discuss the relationship between Schmidt rank and H-2 reducible matrices. We prove Hadamard matrices with Schmidt-rank-one are all H-2 reducible, and prove that some Schmidt-rank-two matrices are H-2 reducible. Finally, we confirm that the partial transpose of an H-2 reducible Schmidt-rank-one or two Hadamard matrix remains H-2 reducible.

Relative rank and regularization

Abstract We introduce a new concept of rank – relative rank associated to a filtered collection of polynomials. When the filtration is trivial, our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of relative bias. The main result of the paper is a relation between these two quantities over finite fields (as a special case, we obtain a new proof of the results in [21]). This relation allows us to get an accurate estimate for the number of points on an affine variety given by a collection of polynomials which is of high relative rank (Lemma 3.2). The key advantage of relative rank is that it allows one to perform an efficient regularization procedure which is polynomial in the initial number of polynomials (the regularization process with Schmidt rank is far worse than tower exponential). The main result allows us to replace Schmidt rank with relative rank in many key applications in combinatorics, algebraic geometry, and algebra. For example, we prove that any collection of polynomials $\mathcal P=(P_i)_{i=1}^c$ of degrees $\le d$ in a polynomial ring over an algebraically closed field of characteristic $>d$ is contained in an ideal $\mathcal I({\mathcal Q})$ , generated by a collection ${\mathcal Q}$ of polynomials of degrees $\le d$ which form a regular sequence, and ${\mathcal Q}$ is of size $\le A c^{A}$ , where $A=A(d)$ is independent of the number of variables.

Quantum state discrimination with assisted entanglement

State discrimination is one of the key steps in quantum information tasks. This paper introduces the assisted quantum entanglement to achieve this step. For this purpose, the paper introduces some preliminary knowledge to help enter the research topic, such as the matrix rank, Kronecker product, quantum states and the calculation method of Schmidt decomposition and rank. The latter involves the Singular value decomposition in matrix factorization theory. The method of distinguishing orthogonal states in single and many-body systems is also introduced, by using the so-called positive operator-valued measurements. Then the paper proves the fact that single or multipartite system non-orthogonal states are indistinguishable regardless of whether there are auxiliary resources, which may be either separable or entangled states. The paper further illustrates the feasibility of maximum entangled states acting on two-body systems and gives corresponding examples. At the same time, the feasibility of auxiliary resources for smaller entanglement is also investigated.

Compact generation scheme of path–frequency hyperentangled photons using 2D periodical nonlinear photonic crystal

Hyperentanglement is a promising resource for achieving high capacity quantum communication. Here, we propose a compact scheme for the generation of path–frequency hyperentangled photon pairs via spontaneous parametric down-conversion (SPDC) processes, where six different paths and two different frequencies are covered. A two-dimensional periodical χ (2) nonlinear photonic crystal (NPC) is designed to satisfy type-I quasi-phase-matching conditions in the plane perpendicular to the incident pump beam, and a perfect phase match is achieved along the pump beam’s direction to ensure high conversion efficiency, with theoretically estimated photon flux up to 2.068 × 105 pairs⋅s−1⋅mm−2. We theoretically calculate the joint-spectral amplitude (JSA) of the generated photon pair and perform Schmidt decomposition on it, where the resulting entropy S of entanglement and effective Schmidt rank K reach 3.2789 and 6.4675, respectively. Our hyperentangled photon source scheme could provide new avenues for high-dimensional quantum communication and high-speed quantum information processing.

Schmidt rank and singularities

UDC 512.5 We revisit Schmidt's theorem connecting the Schmidt rank of a tensor with the codimension of a certain variety and adapt the proof to the case of arbitrary characteristic. We also find a sharper result of this kind for homogeneous polynomials, assuming the characteristic does not divide the degree. Further, we use this to relate the Schmidt rank of a homogeneous polynomial (resp., a collection of homogeneous polynomials of the same degree) with the codimension of the singular locus of the corresponding hypersurface (resp., intersection of hypersurfaces). This gives an effective version of Ananyan--Hochster's theorem [J. Amer. Math. Soc., <strong>33</strong>, No. 1, 291–309 (2020), Theorem A].

The inflation hierarchy and the polarization hierarchy are complete for the quantum bilocal scenario

It is a fundamental but difficult problem to characterize the set of correlations that can be obtained by performing measurements on quantum mechanical systems. The problem is particularly challenging when the preparation procedure for quantum states is assumed to comply with a given causal structure. Recently, a first completeness result for this quantum causal compatibility problem has been given based on the so-called quantum inflation technique. However, completeness was achieved by imposing additional technical constraints, such as an upper bound on the Schmidt rank of the observables. Here, we show that these complications are unnecessary in the quantum bilocal scenario, a much-studied abstract model of entanglement swapping experiments. We prove that the quantum inflation hierarchy is complete for the bilocal scenario in the commuting observable model of locality. We also give a bilocal version of an observation by Tsirelson, namely, in finite dimensions, the commuting observable model and the tensor product model of locality coincide. These results answer questions recently posed by Renou and Xu [arXiv:2210.09065v2 (2022)]. Finally, we point out that our techniques can be interpreted more generally as giving rise to a semidefinite programming hierarchy that is complete for the problem of optimizing polynomial functions in the states of operator algebras defined by generators and relations. The completeness of this polarization hierarchy follows from a quantum de Finetti theorem for states on maximal C*-tensor products.

A Convergent Inflation Hierarchy for Quantum Causal Structures

A causal structure is a description of the functional dependencies between random variables. A distribution is compatible with a given causal structure if it can be realized by a process respecting these dependencies. Deciding whether a distribution is compatible with a structure is a practically and fundamentally relevant, yet very difficult problem. Only recently has a general class of algorithms been proposed: These so-called inflation techniques associate to any causal structure a hierarchy of increasingly strict compatibility tests, where each test can be formulated as a computationally efficient convex optimization problem. Remarkably, it has been shown that in the classical case, this hierarchy is complete in the sense that each non-compatible distribution will be detected at some level of the hierarchy. An inflation hierarchy has also been formulated for causal structures that allow for the observed classical random variables to arise from measurements on quantum states—however, no proof of completeness of this quantum inflation hierarchy has been supplied. In this paper, we construct a first version of the quantum inflation hierarchy that is provably convergent. It takes an additional parameter, r, which can be interpreted as an upper bound on the Schmidt rank of the observables involved. For each r, it provides a family of increasingly strict and ultimately complete compatibility tests for correlations that are compatible with a given causal structure under this Schmidt rank constraint. From a technical point of view, convergence proofs are built on de Finetti theorems, which show that certain symmetries (which can be imposed in convex optimization problems) imply independence of random variables (which is not directly a convex constraint). A main technical ingredient to our proof is a Quantum de Finetti Theorem that holds for general tensor products of C^*-algebras, generalizing previous work that was restricted to minimal tensor products.

Complete hierarchy of linear systems for certifying quantum entanglement of subspaces

We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms known methods already at the first level, and it is complete in the sense that every entangled subspace is shown to be so at some finite level of the hierarchy. It straightforwardly generalizes to the case of higher Schmidt rank, as well as the multipartite cases of completely and genuinely entangled subspaces. These hierarchies work extremely well in practice even in very large quantum systems, as they can be implemented via elementary linear algebra techniques rather than the semidefinite programming techniques that are required by previously known hierarchies.

Entangled state distillation from single copy mixed states beyond LOCC

No pure entangled state can be distilled from a 2⊗2 or 2⊗3 mixed state by separable operations. In 3⊗3, pure entanglement can be distilled by separable operation but not by LOCC. In this letter, we proved the conjecture (Chitambar and Duan (2009) [21]) that it is possible to distill pure entanglement for 2⊗4 system by LOCC and further improve these in higher dimensions to distill a pure entangled state of Schmidt rank d from a m⊗n mixed state by separable operation when m+n⩾3d. We found results for tripartite systems with target state d-level GHZ-type state. These results provide a class of systems where separable operation is strictly stronger than LOCC.

Schmidt rank of quartics over perfect fields

Let k be a perfect field of characteristic ≠ 2. We prove that the Schmidt rank (also known as strength) of a quartic polynomial f over k is bounded above in terms of only the Schmidt rank of f over $$\overline {\bf{k}} $$ , an algebraic closure of k.

Entanglement measures for two-particle quantum histories

Quantum entanglement is a key resource, which grants quantum systems the ability to accomplish tasks that are classically impossible. Here, we apply Feynman's sum-over-histories formalism to interacting bipartite quantum systems and introduce entanglement measures for bipartite quantum histories. Based on the Schmidt decomposition of the matrix comprised of the Feynman propagator complex coefficients, we prove that bipartite quantum histories are entangled if and only if the Schmidt rank of this matrix is larger than 1. The proposed approach highlights the utility of using a separable basis for constructing the bipartite quantum histories and allows for quantification of their entanglement from the complete set of experimentally measured sequential weak values. We then illustrate the nonclassical nature of entangled histories with the use of Hardy's overlapping interferometers and explain why local hidden variable theories are unable to correctly reproduce all observable quantum outcomes. Our theoretical results elucidate how the composite tensor product structure of multipartite quantum systems is naturally extended across time and clarify the difference between quantum histories viewed as projection operators in the history Hilbert space and those viewed as chain operators and propagators in the standard Hilbert space.

Classification of Schmidt-rank-two multipartite unitary gates by singular number

The multipartite unitary gates are called genuine if they are not product unitary operators across any bipartition. We mainly investigate the classification of genuine multipartite unitary gates of Schmidt rank two (SR-2), by focusing on the multiqubit scenario. For genuine multipartite (excluding bipartite) unitary gates of SR-2, there is an essential fact that their Schmidt decompositions are unique. Based on this fact, we propose a key notion named as singular number (SN) to classify the unitary gates concerned. The SN is defined as the number of local singular operators in the Schmidt decomposition. We then determine the accurate range of SN. For each SN, we formulate the parametric Schmidt decompositions of genuine multiqubit unitary gates under local equivalence. Finally, we extend the study to three-qubit diagonal unitary gates due to the close relation between diagonal unitary gates and SR-2 unitaries. We start with discussing two typical examples of SR-2, one of which is a fundamental three-qubit unitary gate, i.e. the CCZ gate. Then we characterize the diagonal unitary gates of SR greater than two. We show that a three-qubit diagonal unitary gate has SR at most three, and present a necessary and sufficient condition for such a unitary gate of SR-3. This completes the characterization of all genuine three-qubit diagonal unitary gates.

Synthesis and Upper Bound of Schmidt Rank of Bipartite Controlled‐Unitary Gates

AbstractQuantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, it is shown generalized controlled‐X (GCX) gates, 6 single‐qubit rotations about the y‐ and z‐axes, and single‐partite y‐ and z‐rotation‐types which are defined in this paper are sufficient to simulate a controlled‐unitary gate with controlling on . In the scenario of the unitary gate with that is locally equivalent to a diagonal unitary on , GCX gates and single‐partite y‐ and z‐rotation‐types are required to simulate it. The quantum circuit for implementing and are presented. Furthermore, it is found that with controlling has Schmidt rank two, and in other cases the diagonalized form of the target unitaries can be expanded in terms of specific simple types of product unitary operators.

QOptCraft: A Python package for the design and study of linear optical quantum systems

The manipulation of the quantum states of light in linear optical systems has multiple applications in quantum optics and quantum computation. The package QOptCraft gives a collection of methods to solve some of the most usual problems when designing quantum experiments with linear interferometers. The methods include functions that compute the quantum evolution matrix for n photons from the classical description of the system and inverse methods that, for any desired quantum evolution, will either give the complete description of the experimental system that realizes that unitary evolution or, when this is impossible, the complete description of the linear system which approximates the desired unitary with a locally minimal error. The functions in the package include implementations of different known decompositions that translate the classical scattering matrix of a linear system into a list of beam splitters and phase shifters and methods to compute the effective Hamiltonian that describes the quantum evolution of states with n photons. The package is completed with routines for useful tasks like generating random linear optical systems, computing matrix logarithms, and quantum state entanglement measurement via metrics such as the Schmidt rank. The routines are chosen to avoid usual numerical problems when dealing with the unitary matrices that appear in the description of linear systems. Program summaryProgram Title: QOptCraftCPC Library link to program files:https://doi.org/10.17632/r24hszggf4.1Developer's repository link:https://github.tel.uva.es/juagar/qoptcraftLicensing provisions: Apache-2.0Programming language: Python 3 v3.9.5:0a7dcbd, May 3 2021 17:27:52Supplementary material:: User's manual at https://github.tel.uva.es/juagar/qoptcraft/-/blob/main/QOptCraft_V1.1_user_guide.pdfNature of problem: The evolution of the quantum states of light in linear optical devices can be computed from the scattering matrix of the system using a few alternative points of view. Apart from being able to compute the evolution through a known optical system, it is interesting to consider the less studied inverse problem of design: finding the optical system which gives or approximates a desired evolution. Linear optical systems are limited and can only provide a small subset of all the physically possible quantum transformations on multiple photons. Choosing the best approximation for the evolutions that cannot be achieved with linear optics is not trivial.This software deals with the analysis of the quantum evolution of multiple photons in linear optical devices and the design of optical setups that achieve or approximate a desired quantum evolution.Solution method: We have automated multiple computation processes regarding quantum experiments via linear optic devices. The methods rely on the properties of the groups and algebras that describe the problem of light evolution in linear system.The library QOptCraft for Python 3 includes known numerical methods for decomposing an optical system into beam splitters and phase shifters and methods to give the quantum evolution of system classically described by a scattering matrix using either the Heisenberg picture evolution of the states, a description based on the permanents of certain matrices or the evolution from the effective Hamiltonian of the system. It also provides methods for the design of achievable evolutions, using the adjoint representation, and for approximating quantum evolutions outside the reach of linear optics with an iterative method using Toponogov's comparison theorem from differential geometry. The package is completed with useful functions that deal with systems including losses and gain, described with quasiunitary matrices, the generation of random matrices and stable implementations of the matrix logarithm.Additional comments including restrictions and unusual features: The package is designed to work with intermediate scale optical systems. Due to the combinatorial growth in the state space with the number of photons and modes involved, there is an upper limit on the efficiency of any classical calculation. QOptCraft serves as a design tool to explore the building blocks of photonic quantum computers, optical systems that generate useful quantum states of light for their use in metrology or other applications or the design of quantum optics experiments to probe the foundations of quantum mechanics.

Thermalization of Gauge Theories from their Entanglement Spectrum.

Using dual theories embedded into a larger unphysical Hilbert space along entanglement cuts, we study the entanglement structure of Z_{2} lattice gauge theory in (2+1) spacetime dimensions. We demonstrate Li and Haldane's conjecture, and show consistency of the entanglement Hamiltonian with the Bisognano-Wichmann theorem. Studying nonequilibrium dynamics after a quench, we provide an extensive description of thermalization in Z_{2} gauge theory which proceeds in a characteristic sequence: Maximization of the Schmidt rank and spreading of level repulsion at early times, self-similar evolution with scaling coefficients α=0.8±0.2 and β=0.0±0.1 at intermediate times, and finally thermal saturation of the von Neumann entropy.

On the Use of Total State Decompositions for the Study of Reduced Dynamics

The description of the dynamics of an open quantum system in the presence of initial correlations with the environment needs different mathematical tools than the standard approach to reduced dynamics, which is based on the use of a time-dependent completely positive trace preserving (CPTP) map. Here, we take into account an approach that is based on a decomposition of any possibly correlated bipartite state as a conical combination involving statistical operators on the environment and general linear operators on the system, which allows one to fix the reduced-system evolution via a finite set of time-dependent CPTP maps. In particular, we show that such a decomposition always exists, also for infinite dimensional Hilbert spaces, and that the number of resulting CPTP maps is bounded by the Schmidt rank of the initial global state. We further investigate the case where the CPTP maps are semigroups with generators in the Gorini-Kossakowski-Lindblad-Sudarshan form; for two simple qubit models, we identify the positivity domain defined by the initial states that are mapped into proper states at any time of the evolution fixed by the CPTP semigroups.

Diagonal unitary and orthogonal symmetries in quantum theory: II. Evolution operators

We study bipartite unitary operators which stay invariant under the local actions of diagonal unitary and orthogonal groups. We investigate structural properties of these operators, arguing that the diagonal symmetry makes them suitable for analytical study. As a first application, we construct large new families of dual unitary gates in arbitrary finite dimensions, which are important toy models for entanglement spreading in quantum circuits. We then analyze the non-local nature of these invariant operators, both in discrete (operator Schmidt rank) and continuous (entangling power) settings. Our scrutiny reveals that these operators can be used to simulate any bipartite unitary gate via stochastic local operations and classical communication. Furthermore, we establish a one-to-one connection between the set of local diagonal unitary invariant dual unitary operators with maximum entangling power and the set of complex Hadamard matrices. Finally, we discuss distinguishability of unitary operators in the setting of the stated diagonal symmetry.

The Independence of Distinguishability and the Dimension of the System

The are substantial studies on distinguishabilities, especially local distinguishability, of quantum states. It is shown that a necessary condition of a local distinguishable state set is the total Schmidt rank not larger than the system dimension. However, if we view states in a larger system, the restriction will be invalid. Hence, a nature problem is that can indistinguishable states become distinguishable by viewing them in a larger system without employing extra resources. In this paper, we consider this problem for (perfect or unambiguous) LOCC$_{1}$, PPT and SEP distinguishabilities. We demonstrate that if a set of states is indistinguishable in $\otimes _{k=1}^{K} C^{d _{k}}$, then it is indistinguishable even being viewed in $\otimes _{k=1}^{K} C^{d _{k}+h _{k}}$, where $K, d _{k}\geqslant2, h _{k}\geqslant0$ are integers. This shows that such distinguishabilities are properties of states themselves and independent of the dimension of quantum system. Our result gives the maximal numbers of LOCC$_{1}$ distinguishable states and can be employed to construct a LOCC indistinguishable product basis in general systems. Our result is suitable for general states in general systems. For further discussions, we define the local-global indistinguishable property and present a conjecture.

End‐faithful spanning trees in graphs without normal spanning trees

AbstractSchmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to characterise other important classes of graphs. In this paper, we address Halin's question: we characterise an important class of graphs by an ordinal function. Another largely open problem raised by Halin asks for a characterisation of the class of graphs with an end‐faithful spanning tree. A well‐studied subclass is formed by the graphs with a normal spanning tree. We determine a larger subclass, the class of normally traceable graphs, which consists of the connected graphs with a rayless tree‐decomposition into normally spanned parts. Investigating the class of normally traceable graphs further we prove that, for every normally traceable graph, having a rayless spanning tree is equivalent to all its ends being dominated. Our proofs rely on a characterisation of the class of normally traceable graphs by an ordinal rank function that we provide.