In this paper we consider feedback control algorithms for the rapid purification of a bipartite state consisting of two qubits, when the observer has access to only one of the qubits. We show 1) that the algorithm that maximizes the average purification rate is not the same as that that for a single qubit, and 2) that it is always possible to construct an algorithm that generates a deterministic rate of purification for {\em both} qubits. We also reveal a key difference between projective and continuous measurements with regard to state-purification.
The partial separability of multipartite qubit density matrixes is strictly defined. We give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit density matrix to be partially separable is its reduced density matrix to satisfy PPT condition.
Quantum properties of correlations have a key role in disparate fields of physics, from quantum information processing, to quantum foundations, to strongly correlated systems. We tackle a specific aspect of the fundamental quantum marginal problem: we address the issue of deducing the global properties of correlations of tripartite quantum states based on the knowledge of their bipartite reductions, focusing on relating specific properties of bipartite correlations to global correlation properties. We prove that strictly classical bipartite correlations may still require global entanglement an…
Various inequalities (Boole inequality, Chung-Erdös inequality, Frechet inequality) for Kolmogorov (classical) probabilities are considered. Quantum counterparts of these inequalities are introduced, which have an extra `quantum correction' term, and which hold for all quantum states. When certain sufficient conditions are satisfied, the quantum correction term is zero, and the classical version of these inequalities holds for all states. But in general, the classical version of these inequalities is violated by some of the quantum states. For example in bipartite systems, classical Boole ineq…
We study a particular class of states of a bipartite system consisting of two 4-level parties. By means of an adapted extended reduction criterion we associate their entanglement properties to the geometric patterns of a planar lattice consisting of 16 points.
Bipartite quantum states are classified into three categories: separable states, bound entangled states, and free entangled states. It is of great importance to characterize these families of states for the development of quantum information science. In this paper, I show that the separable states and the bound entangled states have a common spectral property. More precisely, I prove that for undistillable -- separable and bound entangled -- states, the eigenvalue vector of the global system is majorized by that of the local system. This result constitutes a new sufficient condition for distil…
The stabiliser formalism allows the efficient description of a sizeable class of pure as well as mixed quantum states of N-qubit systems. That same formalism has important applications in the field of quantum error correcting codes, where mixed stabiliser states correspond to projectors on subspaces associated with stabiliser codes. Here, we derive efficient reduction procedures to obtain various useful normal forms for stabiliser states. We explicitly prove that these procedures will always converge to the correct result and that these procedures are efficient in that they only require a poly…
It is well known that the Schmidt decomposition exists for all pure states of a two-party quantum system. We demonstrate that there are two ways to obtain an analogous decomposition for arbitrary rank-1 operators acting on states of a bipartite finite-dimensional Hilbert space. These methods amount to joint Schmidt-type decompositions of two pure states where the two sets of coefficients and local bases depend on the properties of either state, however, at the expense of the local bases not all being orthonormal and in one case the complex-valuedness of the coefficients. With these results we …
Near-term large quantum computers are not able to operate as a single processing unit. It is therefore required to partition a quantum circuit into smaller parts, and then each part is executed on a small unit. This approach is known as distributed quantum computation. In this study, a dynamic programming algorithm is proposed to minimize the number of communications in a distributed quantum circuit (DQC). This algorithm consists of two steps: first, the quantum circuit is converted into a bipartite graph model, and then a dynamic programming approach (DP) is proposed to partition the model in…
We model repetitive quantum error correction (QEC) with the single-error-correcting five-qubit code on a network of individually-controlled qubits with always-on Ising couplings, using our previously designed universal set of quantum gates based on sequences of shaped decoupling pulses. In addition to serving as accurate quantum gates, the sequences also provide dynamical decoupling (DD) of low-frequency phase noise. The simulation involves integrating unitary dynamics of six qubits over the duration of tens of thousands of control pulses, using classical stochastic phase noise as a source of …
Multipartite quantum entanglement serves as a resource for spatially separated parties performing distributed quantum information processing. Any multipartite entangled state can be generated from appropriately distributed bipartite entangled states by local operations and classical communication (LOCC), and in this sense, any distributed process based on shared multipartite entanglement and LOCC is simulatable by using only bipartite entangled states and LOCC. We show here that this reduction scenario does not hold when there exists a limitation on the size of the local quantum system of each…
We consider using Hamiltonian feedback control to increase the speed at which a continuous measurement purifies (reduces) the state of a quantum system, and thus to increase the speed of the preparation of pure states. For a measurement of an observable with N equispaced eigenvalues, we show that there exists a feedback algorithm which will speed up the rate of state-reduction by at least a factor of 2(N+1)/3.
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the resulting bipartite quantum state satisfies the reduction criterion in different asymptotic regimes. We consider as well the basis-independent version of the reduction criterion (the absolute reduction criterion), computing thresholds for the corresponding eigenvalue sets. We do the same for other sets relevant in the study of absolute separability, using techniq…
We investigate multipartite entanglement for composite quantum systems in a pure state. Using the generalized Bloch representation for n-qubit states, we express the condition that all k-qubit reductions of the whole system are maximally mixed, reflecting maximum bipartite entanglement across all k vs. n-k bipartitions. As a special case, we examine the class of balanced pure states, which are constructed from a subset of the Pauli group P_n that is isomorphic to Z_2^n. This makes a connection with the theory of quantum error-correcting codes and provides bounds on the largest allowed k for fi…
We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms for deciding both properties in $\tilde{O}(n^{3/2})$ time and using $O(\log n)$ classical and quantum bits of storage in the adjacency matrix model. We then present quantum algorithms for deciding the two properties in the adjacency array model, which run in time $\tilde{O}(n\sqrt{d_m})$ and also require $O(\log n)$ space, where $d_m$ is the maximum degree of …
The structure of the state spaces of bipartite (N tensor N) quantum systems which are invariant under product representations of the group SO(3) of three-dimensional proper rotations is analyzed. The subsystems represent particles of arbitrary spin j which transform according to an irreducible representation of the rotation group. A positive map theta is introduced which describes the time reversal symmetry of the local states and which is unitarily equivalent to the transposition of matrices. It is shown that the partial time reversal transformation theta_2 = (I tensor theta) acting on the co…
A classical non-signalling (or causal) box is an operation on classical bipartite input with classical bipartite output such that no signal can be sent from a party to the other through the use of the box. The quantum counterpart of such boxes, i.e. completely positive trace-preserving maps on bipartite states, though studied in literature, have been investigated less intensively than classical boxes. We present here some results and remarks about such maps. In particular, we analyze: the relations among properties as causality, non-locality and entanglement; the connection between causal and …
The uncertainty of measurement on a quantum system can be reduced in presence of quantum memory [M. Berta et. al. Nature Phys. {\bf 6}, 659 (2010)]. By measurement on quantum memory, some information (non-classical information) is inaccessible, hence, it limits the lower bound of entropic uncertainty relation. In the present work, we improve the lower bound of entropic uncertainty relation in presence of quantum memory by considering inaccessibility of non classical correlation at Bob side and also compare the lower bound given by M. Berta et. al. and our prescription for two different kind of…
We explore the effect of two-dimensional position-space non-commutativity on the bipartite entanglement of continuous variable systems. We first extend the standard symplectic framework for studying entanglement of Gaussian states of commutative systems to the case of non-commutative systems residing in two dimensions. Using the positive partial transpose criterion for separability of bipartite states we derive a new condition on the separability of a non-commutative system that is dependent on the noncommutative parameter $θ$. We then consider the specific example of a bipartite Gaussian stat…
Using four-wave mixing in a hot atomic vapor, we generate a pair of entangled twin beams in the microsecond pulsed regime near the D1 line of $^{85}$Rb, making it compatible with commonly used quantum memory techniques. The beams are generated in the bright and vacuum-squeezed regimes, requiring two separate methods of analysis, without and with local oscillators, respectively. We report a noise reduction of up to $3.8\pm 0.2$ dB below the standard quantum limit in the pulsed regime and a level of entanglement that violates an Einstein--Podolsky--Rosen inequality.
Quantum speed limit time for bipartite entanglement in neutrino oscillations in matter with nonstandard interactions
Indian Institute of Science, Bangalore（印度科学学院）；SVKM’s Narsee Monjee Institute of Management Studies (NMIMS) Deemed-to-be-University（SVKM纳尔西·蒙吉管理研究所（NMIMS））；Indian Institute of Technology Jodhpur（焦特普尔印度理工学院）；University of Hyderabad（海德拉巴大学）
We consider a composite open quantum system consisting of a fast subsystem coupled to a slow one. Using the time-scale separation, we develop an adiabatic elimination technique to derive at any order the reduced model describing the slow subsystem. The method, based on an asymptotic expansion and geometric singular perturbation theory, ensures the physical interpretation of the reduced second-order model by giving the reduced dynamics in a Lindblad form and the state reduction in Kraus map form. We give explicit second-order formulas for Hamiltonian or cascade coupling between the two subsyste…
In this paper, we discuss the partial separability and its criteria problems of multipartite qubit mixed-states. First we strictly define what is the partial separability of a multipartite qubit system. Next we give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit mixed-state to be partially separable is its reduction to satisfy the PPT condition. PACC numbers: 03.67.Mn; 03.65.Ud; 03.67.Hk
The classical and quantum dynamics of two particles constrained on $S^1$ is discussed via Dirac's approach. We show that when state is maximally entangled between two subsystems, the product of dispersion in the measurement reduces. We also quantify the upper bound on the external field $\vec{B}$ such that $\vec{B}\geq\vec{B}_{upper}$ implies no reduction in the product of dispersion pertaining to one subsystem. Further, we report on the cut-off value of the external field $\vec{B}_{cutoff}$, above which the bipartite entanglement is lost and there exists a direct relationship between uncertai…
Adiabatic elimination methods allow the reduction of the space dimension needed to describe systems dynamics which exhibits separation of time scale. For open quantum system, it consists in eliminating the fast part assuming it has almost instantaneously reached its steady-state and obtaining an approximation of the evolution of the slow part. These methods can be applied to eliminate a linear subspace within the system Hilbert space, or alternatively to eliminate a fast subsystems in a bipartite quantum system. In this work, we extend an adiabatic elimination method used for removing fast deg…
In this paper we study the reduction criterion for detecting entanglement of large dimensional bipartite quantum systems. We first obtain an explicit formula for the moments of a random quantum state to which the reduction criterion has been applied. We show that the empirical eigenvalue distribution of this random matrix converges strongly to a limit that we compute, in three different asymptotic regimes. We then employ tools from free probability to study the asymptotic positivity of the reduction operators. Finally, we compare the reduction criterion with other entanglement criteria, via th…
We consider the dynamics of a system coupled to a thermal bath, going beyond the standard two-level system through the addition of an energy excitation degree of freedom. Further extensions are to systems containing many fermions, with the master equations modified to take Fermi-Dirac statistics into account, and to potentials with a time-dependent bias that induce resonant avoided crossing transitions. The limit $Q \to \infty$, where the interaction rate with the bath is much greater than all free oscillation rates for the system, is interrogated. Two behaviors are possible: freezing (quantum…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that confine the dynamics to a smaller subspace of the full Hilbert space. In this work, we use invariant subspace methods, that can be computed systematically using Lanczos algorithm, to obtain the reduced set of states that encompass the dynamics of the problem at hand without the specific knowledge of underlying symmetries. First, we apply this method to obta…
Measurements are a primitive for characterizing quantum systems. Reducing the time taken to perform a measurement may be beneficial in many areas of quantum information processing. We show that permuting the eigenvalues of the state matrix in the logical basis, using open loop control, provides a $O(n)$ reduction in the measurement time, where $n$ is the number of qubits in the register. This reduction is of the same order as the (previously introduced) locally optimal feedback protocol. The advantage of the open loop protocol is that it is far less difficult experimentally. Because the contro…
We consider an optical probe that interacts with an ensemble of rare earth ions doping a materialin the shape of a cantilever. By optical spectral hole burning, the inhomogeneously broadenedtransition in the ions is prepared to transmit the probe field within a narrow window, but bendingof the cantilever causes strain in the material which shifts the ion resonances. The motion of thecantilever may thus be registered by the phase shift of the probe. By continuously measuringthe optical field we induce a rapid reduction of the position and momentum uncertainty of thecantilever. Doing so, the pro…
Considerable progress has been made in understanding how dissipation drives the state of a single qubit from a quantum-mechanical superposition to a classical mixed state. This paper uses a Bloch-Redfield approach to study how, in a system of two qubits, dissipation drives the bipartite state of the two qubits from an entangled state to a product state. The measure used for mixed-state entanglement is Wootters's formula for the entanglement of formation. For qubits that start in an entangled state and are then decoupled, entanglement is found to decay faster in general than the decoherence of …
De Finetti theorems show how sufficiently exchangeable states are well-approximated by convex combinations of i.i.d. states. Recently, it was shown that in many quantum information applications a more relaxed de Finetti reduction (i.e. only a matrix inequality between the symmetric state and one of de Finetti form) is enough, and that it leads to more concise and elegant arguments. Here we show several uses and general flexible applicability of a constrained de Finetti reduction in quantum information theory, which was recently discovered by Duan, Severini and Winter. In particular we show tha…
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity. Furthermore, we show that our algorithm for cycle detection has improved performance under the promise of large circuit rank or a small number of edges. We also provide algorithms for detecting even-length cycles and for estimating the circuit rank of a graph. All of our algorithms have logarithmic space complexity.
