arXiv subjects

Markus Grassl

Publications and source records attributed to Markus Grassl.

At least 37 records · Page 2Linked to original sources

arXiv2020

Quantum concepts in optical polarization

We comprehensively review the quantum theory of the polarization properties of light. In classical optics, these traits are characterized by the Stokes parameters, which can be geometrically interpreted using the Poincaré sphere. Remarkably, these Stokes parameters can also be applied to the quantum world, but then important differences emerge: now, because fluctuations in the number of photons are unavoidable, one is forced to work in the three-dimensional Poincaré space that can be regarded as a set of nested spheres. Additionally, higher-order moments of the Stokes variables might play a substantial role for quantum states, which is not the case for most classical Gaussian states. This brings about important differences between these two worlds that we review in detail. In particular, the classical degree of polarization produces unsatisfactory results in the quantum domain. We compare alternative quantum degrees and put forth that they order various states differently. Finally, intrinsically nonclassical states are explored and their potential applications in quantum technologies are discussed.

quant-ph↗

arXiv2020

Entanglement-Assisted Quantum Communication Beating the Quantum Singleton Bound

Brun, Devetak, and Hsieh [Science 314, 436 (2006)] demonstrated that pre-shared entanglement between sender and receiver enables quantum communication protocols that have better parameters than schemes without the assistance of entanglement. Subsequently, the same authors derived a version of the so-called quantum Singleton bound that relates the parameters of the entanglement-assisted quantum-error correcting codes proposed by them. We present a new entanglement-assisted quantum communication scheme with parameters violating this bound in certain ranges.

quant-ph↗

arXiv2020

Quantum Codes of Maximal Distance and Highly Entangled Subspaces

We present new bounds on the existence of general quantum maximum distance separable codes (QMDS): the length $n$ of all QMDS codes with local dimension $D$ and distance $d \geq 3$ is bounded by $n \leq D^2 + d - 2$. We obtain their weight distribution and present additional bounds that arise from Rains' shadow inequalities. Our main result can be seen as a generalization of bounds that are known for the two special cases of stabilizer QMDS codes and absolutely maximally entangled states, and confirms the quantum MDS conjecture in the special case of distance-three codes. As the existence of QMDS codes is linked to that of highly entangled subspaces (in which every vector has uniform $r$-body marginals) of maximal dimension, our methods directly carry over to address questions in multipartite entanglement.

quant-ph↗

arXiv2020

Testing a Quantum Error-Correcting Code on Various Platforms

Quantum error correction plays an important role in fault-tolerant quantum information processing. It is usually difficult to experimentally realize quantum error correction, as it requires multiple qubits and quantum gates with high fidelity. Here we propose a simple quantum error-correcting code for the detected amplitude damping channel. The code requires only two qubits. We implement the encoding, the channel, and the recovery on an optical platform, the IBM Q System, and a nuclear magnetic resonance system. For all of these systems, the error correction advantage appears when the damping rate exceeds some threshold. We compare the features of these quantum information processing systems used and demonstrate the advantage of quantum error correction on current quantum computing platforms.

quant-ph↗

arXiv2019

Iso-entangled mutually unbiased bases, symmetric quantum measurements and mixed-state designs

Discrete structures in Hilbert space play a crucial role in finding optimal schemes for quantum measurements. We solve the problem whether a complete set of five iso-entangled mutually unbiased bases exists in dimension four, providing an explicit analytical construction. The reduced density matrices of these $20$ pure states forming this generalized quantum measurement form a regular dodecahedron inscribed in a sphere of radius $\sqrt{3/20}$ located inside the Bloch ball of radius $1/2$. Such a set forms a mixed-state $2$-design --- a discrete set of quantum states with the property that the mean value of any quadratic function of density matrices is equal to the integral over the entire set of mixed states with respect to the flat Hilbert-Schmidt measure. We establish necessary and sufficient conditions mixed-state designs need to satisfy and present general methods to construct them. Furthermore, it is shown that partial traces of a projective design in a composite Hilbert space form a mixed-state design, while decoherence of elements of a projective design yields a design in the classical probability simplex. We identify a distinguished two-qubit orthogonal basis such that four reduced states are evenly distributed inside the Bloch ball and form a mixed-state $2$-design.

quant-ph↗

arXiv2018

Residual and Destroyed Accessible Information after Measurements

When quantum states are used to send classical information, the receiver performs a measurement on the signal states. The amount of information extracted is often not optimal due to the receiver's measurement scheme and experimental apparatus. For quantum non-demolition measurements, there is potentially some residual information in the post-measurement state, while part of the information has been extracted and the rest is destroyed. Here, we propose a framework to characterize a quantum measurement by how much information it extracts and destroys, and how much information it leaves in the residual post-measurement state. The concept is illustrated for several receivers discriminating coherent states.

quant-ph↗

arXiv2017

Fibonacci-Lucas SIC-POVMs

We present a conjectured family of SIC-POVMs which have an additional symmetry group whose size is growing with the dimension. The symmetry group is related to Fibonacci numbers, while the dimension is related to Lucas numbers. The conjecture is supported by exact solutions for dimensions d=4,8,19,48,124,323, as well as a numerical solution for dimension d=844.

quant-ph↗

arXiv2017

Codes for Simultaneous Transmission of Quantum and Classical Information

We consider the characterization as well as the construction of quantum codes that allow to transmit both quantum and classical information, which we refer to as `hybrid codes'. We construct hybrid codes $[\![n,k{: }m,d]\!]_q$ with length $n$ and distance $d$, that simultaneously transmit $k$ qudits and $m$ symbols from a classical alphabet of size $q$. Many good codes such as $[\![7,1{: }1,3]\!]_2$, $[\![9,2{: }2,3]\!]_2$, $[\![10,3{: }2,3]\!]_2$, $[\![11,4{: }2,3]\!]_2$, $[\![11,1{: }2,4]\!]_2$, $[\![13,1{: }4,4]\!]_2$, $[\![13,1{: }1,5]\!]_2$, $[\![14,1{: }2,5]\!]_2$, $[\![15,1{: }3,5]\!]_2$, $[\![19,9{: }1,4]\!]_2$, $[\![20,9{: }2,4]\!]_2$, $[\![21,9{: }3,4]\!]_2$, $[\![22,9{: }4,4]\!]_2$ have been found. All these codes have better parameters than hybrid codes obtained from the best known stabilizer quantum codes.

quant-ph↗

arXiv2017

Coarse graining the phase space of $N$ qubits

We develop a systematic coarse graining procedure for systems of $N$ qubits. We exploit the underlying geometrical structures of the associated discrete phase space to produce a coarse-grained version with reduced effective size. Our coarse-grained spaces inherit key properties of the original ones. In particular, our procedure naturally yields a subset of the original measurement operators, which can be used to construct a coarse discrete Wigner function. These operators also constitute a systematic choice of incomplete measurements for the tomographer wishing to probe an intractably large system.

quant-ph↗

arXiv2016

Invariant Perfect Tensors

Invariant tensors are states in the SU(2) tensor product representation that are invariant under the SU(2) action. They play an important role in the study of loop quantum gravity. On the other hand, perfect tensors are highly entangled many-body quantum states with local density matrices maximally mixed. Recently, the notion of perfect tensors recently has attracted a lot of attention in the fields of quantum information theory, condensed matter theory, and quantum gravity. In this work, we introduce the concept of an invariant perfect tensor (IPT), which is a $n$-valent tensor that is both invariant and perfect. We discuss the existence and construction of IPT. For bivalent tensors, the invariant perfect tensor is the unique singlet state for each local dimension. The trivalent invariant perfect tensor also exists and is uniquely given by Wigner's $3j$ symbol. However, we show that, surprisingly, there does not exist four-valent invariant perfect tensors for any dimension. On the contrary, when the dimension is large, almost all invariant tensors are perfect asymptotically, which is a consequence of the phenomenon of concentration of measure for multipartite quantum states.

quant-ph↗

arXiv2016

The Clifford group fails gracefully to be a unitary 4-design

A unitary t-design is a set of unitaries that is "evenly distributed" in the sense that the average of any t-th order polynomial over the design equals the average over the entire unitary group. In various fields -- e.g. quantum information theory -- one frequently encounters constructions that rely on matrices drawn uniformly at random from the unitary group. Often, it suffices to sample these matrices from a unitary t-design, for sufficiently high t. This results in more explicit, derandomized constructions. The most prominent unitary t-design considered in quantum information is the multi-qubit Clifford group. It is known to be a unitary 3-design, but, unfortunately, not a 4-design. Here, we give a simple, explicit characterization of the way in which the Clifford group fails to constitute a 4-design. Our results show that for various applications in quantum information theory and in the theory of convex signal recovery, Clifford orbits perform almost as well as those of true 4-designs. Technically, it turns out that in a precise sense, the 4th tensor power of the Clifford group affords only one more invariant subspace than the 4th tensor power of the unitary group. That additional subspace is a stabilizer code -- a structure extensively studied in the field of quantum error correction codes. The action of the Clifford group on this stabilizer code can be decomposed explicitly into previously known irreps of the discrete symplectic group. We give various constructions of exact complex projective 4-designs or approximate 4-designs of arbitrarily high precision from Clifford orbits. Building on results from coding theory, we give strong evidence suggesting that these orbits actually constitute complex projective 5-designs.

quant-ph↗

arXiv2016

Experimental Detection of Entanglement Polytopes via Local Filters

Entanglement polytopes result in finitely many types of entanglement that can be detected by only measuring single-particle spectra. With high probability, however, the local spectra lie in more than one polytope, hence providing no information about the entanglement type. To overcome this problem, we propose to additionally use local filters. We experimentally demonstrate the detection of entanglement polytopes in a four-qubit system. Using local filters we can distinguish the entanglement type of states with the same single particle spectra, but which belong to different polytopes.

quant-ph↗

arXiv2016

New self-dual additive $\mathbb{F}_4$-codes constructed from circulant graphs

In order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive $\mathbb{F}_4$-codes of length $n$ and minimum weight $d$ from circulant graphs. The quantum codes with these parameters are constructed for the first time.

math.CO↗

arXiv2016

Concatenated Codes for Amplitude Damping

We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric errors, many new codes with good parameters are found, which are better than the amplitude damping codes obtained by any previously known construction.

quant-ph↗

arXiv2016

Codeword Stabilized Quantum Codes for Asymmetric Channels

We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In particular, we look at codes for Pauli error models that correct one or two amplitude damping errors. Applying local Clifford operations on graph states, we are able to exhaustively search for all possible codes up to length $9$. With a similar method, we also look at codes for the Pauli error model that detect a single amplitude error and detect multiple phase damping errors. Many new codes with good parameters are found, including nonadditive codes and degenerate codes.

quant-ph↗

arXiv2015

Applying Grover's algorithm to AES: quantum resource estimates

We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford$+T$ gates as the underlying fault-tolerant logical quantum gate set. In particular, for all three variants of AES (key size 128, 192, and 256 bit) that are standardized in FIPS-PUB 197, we establish precise bounds for the number of qubits and the number of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.

quant-ph↗

arXiv2015

Quantum Error-Correcting Codes for Qudit Amplitude Damping

Traditional quantum error-correcting codes are designed for the depolarizing channel modeled by generalized Pauli errors occurring with equal probability. Amplitude damping channels model, in general, the decay process of a multilevel atom or energy dissipation of a bosonic system at zero temperature. We discuss quantum error-correcting codes adapted to amplitude damping channels for higher dimensional systems (qudits). For multi-level atoms, we consider a natural kind of decay process, and for bosonic systems,we consider the qudit amplitude damping channel obtained by truncating the Fock basis of the bosonic modes to a certain maximum occupation number. We construct families of single-error-correcting quantum codes that can be used for both cases. Our codes have larger code dimensions than the previously known single-error-correcting codes of the same lengths. Additionally, we present families of multi-error correcting codes for these two channels, as well as generalizations of our construction technique to error-correcting codes for the qutrit $V$ and $Λ$ channels.

quant-ph↗

arXiv2015

Quantum MDS Codes over Small Fields

We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS codes can be obtained by shortening. We provide numerical evidence for our conjecture that almost all admissible lengths, from a lower bound $n_0(q,d)$ on, are achievable by shortening. Some additional codes that fill gaps in the list of achievable lengths are presented as well along with a construction of a family of QMDS codes of length $q^2+2$, where $q=2^m$, that appears to be new.

quant-ph↗