SearcharxivSearch

arXiv subjects

Tanmay Singal

Publications and source records attributed to Tanmay Singal.

17 recordsLinked to original sources

Wigner's Theorem for stabilizer states and quantum designs

We describe the symmetry group of the stabilizer polytope for any number $n$ of systems and any prime local dimension $d$. In the qubit case, the symmetry group coincides with the linear and anti-linear Clifford operations. In the case of qudits, the structure is somewhat richer: for $n=1$, it is a wreath product of permutations of bases and permutations of the elements within each basis. For $n>1$, the symmetries are given by affine symplectic similitudes. These are the affine maps that preserve the symplectic form of the underlying discrete phase space up to a non-zero multiplier. We phrase these results with respect to a number of a priori different notions of "symmetry'', including Kadison symmetries (bijections that are compatible with convex combinations), Wigner symmetries (bijections that preserve inner products), and symmetries realized by an action on Hilbert space. Going beyond stabilizer states, we extend an observation of Heinrich and Gross (Ref. [25]) and show that the symmetries of fairly general sets of Hermitian operators are constrained by certain moments. In particular: the symmetries of a set that behaves like a 3-design preserve Jordan products and are therefore realized by conjugation with unitaries or anti-unitaries. (The structure constants of the Jordan algebra are encoded in an order-three tensor, which we connect to the third moments of a design). This generalizes Kadison's formulation of the classic Wigner Theorem on quantum mechanical symmetries.

quant-ph

Counting stabiliser codes for arbitrary dimension

In this work, we compute the number of $[[n,k]]_d$ stabilizer codes made up of $d$-dimensional qudits, for arbitrary positive integers $d$. In a seminal work by Gross (Ref. [23]) the number of $[[n,k]]_d$ stabilizer codes was computed for the case when $d$ is a prime (or the power of a prime, i.e., $d=p^m$, but when the qudits are Galois-qudits). The proof in Ref. Ref. [23] is inapplicable to the non-prime case. For our proof, we introduce a group structure to $[[n,k]]_d$ codes, and use this in conjunction with the Chinese remainder theorem to count the number of $[[n,k]]_d$ codes. Our work overlaps with Ref. Ref. [23] when $d$ is a prime and in this case our results match exactly, but the results differ for the more generic case. Despite that, the overall order of magnitude of the number of stabilizer codes scales agnostic of whether the dimension is prime or non-prime. This is surprising since the method employed to count the number of stabilizer states (or more generally stabilizer codes) depends on whether $d$ is prime or not. The cardinality of stabilizer states, which was so far known only for the prime-dimensional case (and the Galois qudit prime-power dimensional case) plays an important role as a quantifier in many topics in quantum computing. Salient among these are the resource theory of magic, design theory, de Finetti theorem for stabilizer states, the study and optimisation of the classical simulability of Clifford circuits, the study of quantum contextuality of small-dimensional systems and the study of Wigner-functions. Our work makes available this quantifier for the generic case, and thus is an important step needed to place results for quantum computing with non-prime dimensional quantum systems on the same pedestal as prime-dimensional systems.

quant-ph

Single-Copy Certification of Two-Qubit Gates without Entanglement

A quantum state transformation can be generally approximated by single- and two-qubit gates. This, however, does not hold with noisy intermediate-scale quantum technologies due to the errors appearing in the gate operations, where errors of two-qubit gates such as controlled-NOT and SWAP operations are dominated. In this work, we present a cost efficient single-copy certification for a realization of a two-qubit gate in the presence of depolarization noise, where it is aimed to identify if the realization is noise-free, or not. It is shown that entangled resources such as entangled states and a joint measurement are not necessary for the purpose, i.e., a noise-free two-qubit gate is not needed to certify an implementation of a two-qubit gate. A proof-of-principle demonstration is presented with photonic qubits.

quant-ph

One parameter generalization of BW inequality and its application to open quantum dynamics

In this paper, we introduce a one parameter generalization of the famous Böttcher-Wenzel (BW) inequality in terms of a $q$-deformed commutator. For $n \times n$ matrices $A$ and $B$, we consider the inequality \[ \Re\langle[B,A],[B,A]_q\rangle \le c(q) \|A\|^2 \|B\|^2, \] where $\langle A,B \rangle = {\rm tr}(A^*B)$ is the Hilbert-Schmidt inner product, $\|A\|$ is the Frobenius norm, $[A,B] =AB-BA$ is the commutator, and $[A,B]_q =AB-qBA$ is the $q$-deformed commutator. We prove that when $n=2$, or when $A$ is normal with any size $n$, the optimal bound is given by \[ c(q) = \frac{(1+q) +\sqrt{2(1+q^2)}}{2}. \] We conjecture that this is also true for any matrices, and this conjecture is perfectly supported for $n$ up to $15$ by numerical optimization. When $q=1$, this inequality is exactly BW inequality. When $q=0$, this inequality leads the sharp bound for the $r$-function which is recently derived for the application to universal constraints of relaxation rates in open quantum dynamics.

math.QA

Implementation of quantum measurements using classical resources and only a single ancillary qubit

We propose a scheme to implement general quantum measurements, also known as Positive Operator Valued Measures (POVMs) in dimension $d$ using only classical resources and a single ancillary qubit. Our method is based on the probabilistic implementation of $d$-outcome measurements which is followed by postselection of some of the received outcomes. We conjecture that the success probability of our scheme is larger than a constant independent of $d$ for all POVMs in dimension $d$. Crucially, this conjecture implies the possibility of realizing arbitrary nonadaptive quantum measurement protocol on a $d$-dimensional system using a single auxiliary qubit with only a \emph{constant} overhead in sampling complexity. We show that the conjecture holds for typical rank-one Haar-random POVMs in arbitrary dimensions. Furthermore, we carry out extensive numerical computations showing success probability above a constant for a variety of extremal POVMs, including SIC-POVMs in dimension up to 1299. Finally, we argue that our scheme can be favourable for the experimental realization of POVMs, as noise compounding in circuits required by our scheme is typically substantially lower than in the standard scheme that directly uses Naimark's dilation theorem.

quant-ph

Approximate 3-designs and partial decomposition of the Clifford group representation using transvections

We study a scheme to implement an asymptotic unitary 3-design. The scheme implements a random Pauli once followed by the implementation of a random transvection Clifford by using state twirling. Thus the scheme is implemented in the form of a quantum channel. We show that when this scheme is implemented $k$ times, then, in the $k \rightarrow \infty$ limit, the overall scheme implements a unitary $3$-design. This is proved by studying the eigendecomposition of the scheme: the $+1$ eigenspace of the scheme coincides with that of an exact unitary $3$-design, and the remaining eigenvalues are bounded by a constant. Using this we prove that the scheme has to be implemented approximately $\mathcal{O}(m + \log 1/ε)$ times to obtain an $ε$-approximate unitary $3$-design, where $m$ is the number of qubits, and $ε$ is the diamond-norm distance of the exact unitary $3$-design. Also, the scheme implements an asymptotic unitary $2$-design with the following convergence rate: it has to be sampled $\mathcal{O}(\log 1/ε)$ times to be an $ε$-approximate unitary $2$-design. Since transvection Cliffords are a conjugacy class of the Clifford group, the eigenspaces of the scheme's quantum channel coincide with the irreducible invariant subspaces of the adjoint representation of the Clifford group. Some of the subrepresentations we obtain are the same as were obtained in J. Math. Phys. 59, 072201 (2018), whereas the remaining are new invariant subspaces. Thus we obtain a partial decomposition of the adjoint representation for $3$ copies for the Clifford group. Thus, aside from providing a scheme for the implementation of unitary $3$-design, this work is of interest for studying representation theory of the Clifford group, and the potential applications of this topic. The paper ends with open questions regarding the scheme and representation theory of the Clifford group.

quant-ph

Bounding the Frobenius norm of a q-deformed commutator

For two $n \times n$ complex matrices $A$ and $B$, we define the $q$-deformed commutator as $[ A, B ]_q := A B - q BA$ for a real parameter $q$. In this paper, we investigate a generalization of the Böttcher-Wenzel inequality which gives the sharp upper bound of the (Frobenius) norm of the commutator. In our generalisation, we investigate sharp upper bounds on the $q$-deformed commutator. This generalization can be studied in two different scenarios: firstly bounds for general matrices, and secondly for traceless matrices. For both scenarios, partial answers and conjectures are given for positive and negative $q$. In particular, denoting the Frobenius norm by $||.||_F$, when either $A$ or $B$ is normal, we prove the following inequality to be true and sharp: $|| [ A , B ]_q||_F^2 \le \left(1+q^2 \right) ||A||_F^2 ||B||_F^2$ for positive $q$. Also, we conjecture that the same bound is true for positive $q$ when either $A$ or $B$ is traceless. For negative $q$, we conjecture other sharp upper bounds to be true for the generic scenarios and the scenario when either of $A$ or $B$ is traceless. All conjectures are supported with numerics and proved for $n=2$.

math.QA

Determining planetary positions in the sky for $\pm 50$ years to an accuracy of $\stackrel{<}{_{\sim}} 1^{\circ}$ with a calculator}

In this paper, we describe a very simple method to calculate the positions of the planets in the sky. The technique used enables us to calculate planetary positions to an accuracy of $\stackrel{<}{_{\sim}} 1^{\circ}$ for $\pm 50$ years from the starting epoch. Moreover, this involves very simple calculations and can be done using a calculator. All we need are the initial specifications of planetary orbits for some standard epoch and the time periods of their revolutions.

astro-ph.IM

Is Interstellar travel to an exoplanet Possible?

It is shown that space travel, even in the most distant future, will remain confined to our own planetary system, and a similar conclusion will hold forth for any other civilization, no matter how advanced it might be, unless those extra-terrestrial species have life spans order of magnitude longer than ours. Even in such a case it is unlikely that they will travel much farther than their immediate stellar neighbourhood, as each such excursion will exhaust the resources of their home planet so much that those will dwindle rather fast and there might not be much left for the further scientific and technological advancements. So the science-fiction fancy of a "Galactic Empire" may ever remain in our fantasies only. And as for the mythical UFOs, whose quiet appearances do get reported in the press once in a while, recent explorations have shown no evidence that any such thing could have an origination within our own solar system itself. And a "quiet trip" back and forth from a distant star is almost impossible as the exhaust in any such trip will dazzle the sky like another sun or perhaps more like a gamma ray burst occurring but not in a distant part of the universe instead going off right in our own solar backyard.

physics.pop-ph

A Structure of Minimum Error Discrimination for Linearly Independent States

In this paper we study the Minimum Error Discrimination problem (MED) for ensembles of linearly independent (LI) states. We define a bijective map from the set of those ensembles to itself and we show that the Pretty Good Measurement (PGM) and the optimal measurement for the MED are related by the map. In particular, the fixed points of the map are those ensembles for which the PGM is the optimal measurement. Also, we simplify the optimality conditions for the measurement of an ensemble of LI states.

quant-ph

Detecting Noisy Channels by Channel Discrimination : Local versus Entangled Resources

Dynamics of many-qubit systems, that may correspond to computational processing with quantum systems, can be efficiently and generally approximated by a sequence of two- and single-qubit gates. In practical applications, however, a quantum gate prepared as a unitary transformation may appear as a noisy channel and consequently may inhibit quantum advantages. In this work, we apply the scheme of channel discrimination to detect if a quantum gate that is actually realized is unitary or noisy. We show that a two-qubit unitary transformation and its noisy counterpart can be optimally discriminated by local resources, without the necessity of creating entanglement repeatedly. It is also shown that the scheme can be applied to estimation of the fraction of noise existing in quantum gates.

quant-ph

Preserving Measurements for Optimal State Discrimination over Quantum Channels

In this work, we consider optimal state discrimination for a quantum system that interacts with an environment, i.e., states evolve under a quantum channel. We show the conditions on a quantum channel and an ensemble of states such that a measurement for optimal state discrimination is preserved. In particular, we show that when an ensemble of states with equal {\it a priori} probabilities is given, an optimal measurement can be preserved over any quantum channel by applying local operations and classical communication, that is, by manipulating the quantum states before and after the channel application. Examples are provided for illustration. Our results can be readily applied to quantum communication protocols over various types of noise.

quant-ph

Necessary Condition for Local Distinguishability of Maximally Entangled States: Beyond Orthogonality Preservation

The (im)possibility of local distinguishability of orthogonal multipartite quantum states still remains an intriguing question. Beyond $\mathbb{C}^{3}\otimes\mathbb{C}^{3}$, the problem remains unsolved even for maximally entangled states (MES). So far, the only known condition for the local distinguishability of states is the well-known orthogonality preservation (OP). Using an upper bound on the locally accessible information for bipartite states, we derive a very simple necessary condition for any set of pairwise orthogonal MES in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$ to be perfectly locally distinguishable. This condition is seen to be stronger than the OP condition. This is particularly so for any set of $d$ number of pairwise orthogonal MES in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$. When testing this condition for the local distinguishability of all sets of four generalized Bell states in $\mathbb{C}^{4}\otimes \mathbb{C}^{4}$, we find that it is not only necessary but also sufficient to determine their local distinguishability. This demonstrates that the aforementioned upper-bound may play a significant role in the general scenario of local distinguishability of bipartite states.

quant-ph

Minimum Error Discrimination for an Ensemble of Linearly Independent Pure States

Inspired by the work done by Belavkin [Belavkin V. P., Stochastics, 1, 315 (1975)], and independently by Mochon, [Phys. Rev. A 73, 032328, (2006)], we formulate the problem of minimum error discrimination of any ensemble of $n$ linearly independent pure states by stripping the problem of its rotational covariance and retaining only the rotationally invariant aspect of the problem. This is done by embedding the optimal conditions in a matrix equality as well as matrix inequality. Employing the implicit function theorem in these conditions we get a set of first-order coupled ordinary non-linear differential equations which can be used to drag the solution from an initial point (where solution is known) to another point (whose solution is sought). This way of obtaining the solution can be done through a simple Taylor series expansion and analytic continuation when required. Thus, we \emph{complete} the work done by Belavkin and Mochon by ultimately leading their theory to a solution for the minimum error discrimination problem of linearly independent pure state ensembles. We also compare the computational complexity of our technique with a barrier-type interior point method of SDP and show that our technique is computationally as efficient as (actually, a bit more than) the SDP algorithm, with the added advantage of being much simpler to implement.

quant-ph

Framework for distinguishability of orthogonal bipartite states by one-way local operations and classical communication

In the topic of perfect local distinguishability of orthogonal multipartite quantum states, most results obtained so far pertain to bipartite systems whose subsystems are of specific dimensions. In contrast very few results for bipartite systems whose subsystems are of arbitrary dimensions, are known. This is because a rich variety of (algebraic or geometric) structure is exhibited by different sets of orthogonal states owing to which it is difficult to associate some common property underlying them all, i.e., a common property that would play a crucial role in the local distinguishability of these states. In this paper, I propose a framework for the distinguishability by one-way LOCC ($1$-LOCC) of sets of orthogonal bipartite states in a $d_A \otimes d_B$ bipartite system, where $d_A, d_B$ are the dimensions of both subsytems, labelled as $A$ and $B$. I show that if the $i$-th party (where $i=A,B$) can initiate a $1$-LOCC protocol to perfectly distinguish among a set of orthogonal bipartite states, then the information of the existence of such a $1$-LOCC protocol lies in a subspace of $d_i \times d_i$ hermitian matrices, denoted by $\Tb^{(i)}$, and that the method to extract this information (of the existence of this $1$-LOCC protocol) from $\Tb^{(i)}$ depends on the value of $dim \Tb^{(i)}$. In this way one can give sweeping results for the $1$-LOCC (in)distinguishability of all sets of orthogonal bipartite states corresponding to certain values of $dim \Tb^{(i)}$. Thus I propose that the value of $dim \Tb^{(i)}$ gives the common underlying property based on which sweeping results for the $1$-LOCC (in)distinguishability of orthogonal bipartite quantum states can be made.

quant-ph

Algebraic Structure of the Minimum Error Discrimination Problem for Linearly Independent Density Matrices

The minimum error discrimination problem for ensembles of linearly independent pure states are known to have an interesting structure; for such a given ensemble the optimal POVM is given by the pretty good measurment of another ensemble which can be related to the former ensemble by a bijective mapping $\mathscr{R}$ on the "space of ensembles". In this paper we generalize this result to ensembles of general linearly independent states (not necessarily pure) and also give an analytic expression for the inverse of the map, i.e., for $\mathscr{R}^{-1}$. In the process of proving this we also simplify the necessary and sufficient conditions that a POVM needs to satisfy to maximize the probability of success for the MED of an LI ensemble of states. This simplification is then employed to arrive at a rotationally invariant necessary and sufficient conditions of optimality. Using these rotationally invariant conditions it is established that every state of a LI mixed state ensemble can be resolved to a pure state decomposition so that the corresponding pure state ensemble (corresponding to pure states of all mixed states together) has as its optimal POVM a pure state decomposition of the optimal POVM of mixed state ensemble. This gives the necessary and sufficient conditions for the PGM of a LI ensemble to be its optimal POVM; another generalization for the pure state case. Also, these rotationally invariant conditions suggest a technique to give the optimal POVM for an ensemble of LI states. This technique is polynomial in time and outpeforms standard barrier-type interior point SDP in terms of computational complexity.

quant-ph

Minimum Error Discrimination of Linearly Independent Pure States: Analytic Properties of POVM

The optimization conditions for minimum error discrimination of linearly independent pure states comprise of two kinds: stationary conditions over the space of rank one projective measurements and the global maximization conditions. A discrete number of projective measurments will solve th former of which a unique one will solve the latter. In the case of three real linearly independent pure states we show that the stationary conditions translate to a system of simultaneous polynomial (non linear) equations in three variabes thus explaining why it's so difficult to obtain a closed-form solution for the optimal POVM. Additionally, our method suggests that as an ensemble of LI pure states is varied as a smooth function of some independent parameters, the optimal POVM will also vary smoothly as a function of the same parameters. By employing the implicit functions theorem we exploit this fact to obtain a technique to find the solution of MED of LI pure states by dragging the solution from a known example (say, pure orthogonal states) to any general linearly indepenent ensemble of pure states in the same Hilbert space. By employing RK4 to solve the first order coupled non-linear differential equations find that the resulting error is within the RK4 error performance.

quant-ph