Quantum multipartite maskers vs quantum error-correcting codes
- URL: http://arxiv.org/abs/2005.11169v2
- Date: Tue, 26 May 2020 00:31:54 GMT
- Title: Quantum multipartite maskers vs quantum error-correcting codes
- Authors: Kanyuan Han, Zhihua Guo, Huaixin Cao, Yuxing Du, and Chuan Yang
- Abstract summary: We consider relationship between quantum multipartite maskers (QMMs) and quantum error-correcting codes (QECCs)
An isometry is a QMM of all pure states of system if and only if its range is a QECC of any one-erasure channel.
- Score: 0.6850683267295249
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Since masking of quantum information was introduced by Modi et al. in [PRL
120, 230501 (2018)], many discussions on this topic have been published. In
this paper, we consider relationship between quantum multipartite maskers
(QMMs) and quantum error-correcting codes (QECCs). We say that a subset $Q$ of
pure states of a system $K$ can be masked by an operator $S$ into a
multipartite system $\H^{(n)}$ if all of the image states $S|\psi\>$ of states
$|\psi\>$ in $Q$ have the same marginal states on each subsystem. We call such
an $S$ a QMM of $Q$. By establishing an expression of a QMM, we obtain a
relationship between QMMs and QECCs, which reads that an isometry is a QMM of
all pure states of a system if and only if its range is a QECC of any
one-erasure channel. As an application, we prove that there is no an isometric
universal masker from $\C^2$ into $\C^2\otimes\C^2\otimes\C^2$ and then the
states of $\C^3$ can not be masked isometrically into
$\C^2\otimes\C^2\otimes\C^2$. This gives a consummation to a main result and
leads to a negative answer to an open question in [PRA 98, 062306 (2018)].
Another application is that arbitrary quantum states of $\C^d$ can be
completely hidden in correlations between any two subsystems of the tripartite
system $\C^{d+1}\otimes\C^{d+1}\otimes\C^{d+1}$, while arbitrary quantum states
cannot be completely hidden in the correlations between subsystems of a
bipartite system [PRL 98, 080502 (2007)].
Related papers
- Mitigating Non-Markovian and Coherent Errors Using Quantum Process Tomography of Proxy States [0.0]
We consider three of the most common bosonic error correction codes -- the CLY, binomial and dual rail.
We find that the dual rail code shows the best performance.
We also develop a new technique for error mitigation in quantum control.
arXiv Detail & Related papers (2024-11-05T19:18:30Z) - Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound [44.154181086513574]
We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ frackn = frac13 $.
We demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs.
arXiv Detail & Related papers (2024-10-05T11:56:15Z) - The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$.
In particular, we design global protocols for small set expansion, unique games, and PCP verification.
We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
arXiv Detail & Related papers (2024-02-29T01:35:46Z) - Dimension Independent Disentanglers from Unentanglement and Applications [55.86191108738564]
We construct a dimension-independent k-partite disentangler (like) channel from bipartite unentangled input.
We show that to capture NEXP, it suffices to have unentangled proofs of the form $| psi rangle = sqrta | sqrt1-a | psi_+ rangle where $| psi_+ rangle has non-negative amplitudes.
arXiv Detail & Related papers (2024-02-23T12:22:03Z) - Constructions of $k$-uniform states in heterogeneous systems [65.63939256159891]
We present two general methods to construct $k$-uniform states in the heterogeneous systems for general $k$.
We can produce many new $k$-uniform states such that the local dimension of each subsystem can be a prime power.
arXiv Detail & Related papers (2023-05-22T06:58:16Z) - Multipartite entanglement and quantum error identification in
$D$-dimensional cluster states [0.0]
We show how to create $m$-uniform states using local gates or interactions.
We show how to achieve larger $m$ values using quasi-$D$ dimensional cluster states.
This opens the possibility to use cluster states to benchmark errors on quantum computers.
arXiv Detail & Related papers (2023-03-27T18:00:02Z) - Testing matrix product states [5.225550006603552]
We study the problem of testing whether an unknown state $|psirangle$ is a matrix product state (MPS) in the property testing model.
MPS are a class of physically-relevant quantum states which arise in the study of quantum many-body systems.
arXiv Detail & Related papers (2022-01-05T21:10:50Z) - $k$-Uniform states and quantum information masking [15.308818907018546]
A pure state of $N$ parties with local dimension $d$ is called a $k$-uniform state if all the reductions to $k$ parties are maximally mixed.
We show that when $dgeq 4k-2$ is a prime power, there exists a $k$-uniform state for any $Ngeq 2k$ (resp. $2kleq Nleq d+1$)
arXiv Detail & Related papers (2020-09-26T01:27:45Z) - Masking quantum information into a tripartite syste [1.343950231082215]
We consider relationship between quantum multipartite maskers (QMMs) and quantum error-correcting codes (QECCs)
An isometry is a QMM of all pure states of system if and only if its range is a QECC of any one-erasure channel.
arXiv Detail & Related papers (2020-04-30T01:55:55Z) - Bosonic quantum communication across arbitrarily high loss channels [68.58838842613457]
A general attenuator $Phi_lambda, sigma$ is a bosonic quantum channel that acts by combining the input with a fixed environment state.
We show that for any arbitrary value of $lambda>0$ there exists a suitable single-mode state $sigma(lambda)$.
Our result holds even when we fix an energy constraint at the input of the channel, and implies that quantum communication at a constant rate is possible even in the limit of arbitrarily low transmissivity.
arXiv Detail & Related papers (2020-03-19T16:50:11Z) - Quantum Coupon Collector [62.58209964224025]
We study how efficiently a $k$-element set $Ssubseteq[n]$ can be learned from a uniform superposition $|Srangle of its elements.
We give tight bounds on the number of quantum samples needed for every $k$ and $n$, and we give efficient quantum learning algorithms.
arXiv Detail & Related papers (2020-02-18T16:14:55Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.