A canonical form for unital qubit channels under local unitary transforms is obtained. In particular, it is shown that the eigenvalues of the Choi matrix of a unital quantum channel form a complete set of invariants of the canonical form. It follows immediately that every unital qubit channel is the average of four unitary channels. More generally, a unital qubit channel can be expressed as the convex combination of unitary channels with convex coefficients $p_1, dots, p_m$ as long as $2(p_1, dots, p_m)$ is majorized by the vector of eigenvalues of the Choi matrix of the channel. A unital qubit channel in the canonical form will transform the Bloch sphere onto an ellipsoid. We look into the detailed structure of the natural linear maps sending the Bloch sphere onto a corresponding ellipsoid.
{"title":"On unital qubit channels","authors":"Man-Duen Choi, Chi-Kwong Li","doi":"10.26421/qic23.7-8-2","DOIUrl":"https://doi.org/10.26421/qic23.7-8-2","url":null,"abstract":"A canonical form for unital qubit channels under local unitary transforms is obtained. In particular, it is shown that the eigenvalues of the Choi matrix of a unital quantum channel form a complete set of invariants of the canonical form. It follows immediately that every unital qubit channel is the average of four unitary channels. More generally, a unital qubit channel can be expressed as the convex combination of unitary channels with convex coefficients $p_1, dots, p_m$ as long as $2(p_1, dots, p_m)$ is majorized by the vector of eigenvalues of the Choi matrix of the channel. A unital qubit channel in the canonical form will transform the Bloch sphere onto an ellipsoid. We look into the detailed structure of the natural linear maps sending the Bloch sphere onto a corresponding ellipsoid.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"45 1","pages":"562-576"},"PeriodicalIF":0.0,"publicationDate":"2023-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80270954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Quantum image filtering is an extension of classical image filtering algorithms, which mainly studies image filtering models based on quantum characteristics. The existing quantum image filtering focuses on noise detection and noise suppression, ignoring the effect of filtering on image boundaries. In this paper, a new quantum image filtering algorithm is proposed to realize the K-nearest neighbor mean filtering task, which can achieve the purpose of boundary preservation while suppressing noise. The main work includes: a new quantum compute module for calculating the absolute value of the difference between two non-negative integers is proposed, thus constructing the quantum circuit of the distance calculation module for calculating the grayscale distance between the neighborhood pixels and the center pixel; the existing quantum sorting module is improved to sort the neighborhood pixels with the distance as the sorting condition, and thus the quantum circuit of the K-nearest neighbor extraction module is constructed; the quantum circuit of the K-nearest neighbor mean calculation module is designed to calculate the gray mean of the selected neighbor pixels; finally, a complete quantum circuit of the proposed quantum image filtering algorithm is constructed, and carried out the image de-noising simulation experiment. The relevant experimental indicators show that the quantum image K-nearest neighbor mean filtering algorithm has the same effect on image noise suppression as the classical K-nearest neighbor mean filtering algorithm, but the time complexity of this method is reduced from $Oleft(2^{2 n}right)$ of the classical algorithm to $Oleft(n^{2}+q^{2}right)$.
{"title":"Quantum image K-nearest neighbor mean filtering","authors":"Jingke Xi, Shukun Ran","doi":"10.26421/qic23.1-2-4","DOIUrl":"https://doi.org/10.26421/qic23.1-2-4","url":null,"abstract":"Quantum image filtering is an extension of classical image filtering algorithms, which mainly studies image filtering models based on quantum characteristics. The existing quantum image filtering focuses on noise detection and noise suppression, ignoring the effect of filtering on image boundaries. In this paper, a new quantum image filtering algorithm is proposed to realize the K-nearest neighbor mean filtering task, which can achieve the purpose of boundary preservation while suppressing noise. The main work includes: a new quantum compute module for calculating the absolute value of the difference between two non-negative integers is proposed, thus constructing the quantum circuit of the distance calculation module for calculating the grayscale distance between the neighborhood pixels and the center pixel; the existing quantum sorting module is improved to sort the neighborhood pixels with the distance as the sorting condition, and thus the quantum circuit of the K-nearest neighbor extraction module is constructed; the quantum circuit of the K-nearest neighbor mean calculation module is designed to calculate the gray mean of the selected neighbor pixels; finally, a complete quantum circuit of the proposed quantum image filtering algorithm is constructed, and carried out the image de-noising simulation experiment. The relevant experimental indicators show that the quantum image K-nearest neighbor mean filtering algorithm has the same effect on image noise suppression as the classical K-nearest neighbor mean filtering algorithm, but the time complexity of this method is reduced from $Oleft(2^{2 n}right)$ of the classical algorithm to $Oleft(n^{2}+q^{2}right)$.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"124 1","pages":"45-66"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77322480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this manuscript, we show that it is possible to change the environment Markovianity/memory into non-Markovianity/memoryless, and vice versa. This idea is clarified by considering a system of a single two level quantum dot interacts locally with a magnetic field. The Markovianity of the environment depends on whether the coupling between the two systems is time dependent/independent and whether the systems suffering from damping or not. The amount of the lost/gained information and its scrambling depends on the energy gap spacing between the levels of the quantum dot, where the Skew information and the out-of-time ordered are used as quantifiers for both phenomena. Thermally, one can freeze the environment properties to be memory/ memoryless, where our results show the amount of exchanging information and its scrambling are constant as the temperature increases.
{"title":"Markovianity and the memory of magnetic environment interacting locally with a single quantum dot","authors":"A. R. Mohammed, T. El-Shahat, N. Metwally","doi":"10.26421/qic23.1-2-5","DOIUrl":"https://doi.org/10.26421/qic23.1-2-5","url":null,"abstract":"In this manuscript, we show that it is possible to change the environment Markovianity/memory into non-Markovianity/memoryless, and vice versa. This idea is clarified by considering a system of a single two level quantum dot interacts locally with a magnetic field. The Markovianity of the environment depends on whether the coupling between the two systems is time dependent/independent and whether the systems suffering from damping or not. The amount of the lost/gained information and its scrambling depends on the energy gap spacing between the levels of the quantum dot, where the Skew information and the out-of-time ordered are used as quantifiers for both phenomena. Thermally, one can freeze the environment properties to be memory/ memoryless, where our results show the amount of exchanging information and its scrambling are constant as the temperature increases.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"335 1","pages":"67-80"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79730640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Assume that $q$ is a prime power and $mgeq 2$ is a positive integer. Cyclic codes over $mathbb{F}_{q^{2m}}$ of length $n=frac{q^{2m}-1}{rho }$ with $rhomid (q-1)$, and constacyclic codes over $mathbb{F}_{q^{2m}}$ of length $n=frac{q^{2m}-1}{rho }$ with $rhomid (q+1)$ are considered in this paper, respectively. Two classes of quantum codes are derived from the images of these codes by the Hermitian construction. Compared with the previously known quantum codes, the quantum codes in our scheme have better parameters.
{"title":"New quantum codes derived from the images of constacyclic codes","authors":"Liqi Wang, Xiujing Zheng, Shixin Zhu","doi":"10.26421/qic23.1-2-1","DOIUrl":"https://doi.org/10.26421/qic23.1-2-1","url":null,"abstract":"Assume that $q$ is a prime power and $mgeq 2$ is a positive integer. Cyclic codes over $mathbb{F}_{q^{2m}}$ of length $n=frac{q^{2m}-1}{rho }$ with $rhomid (q-1)$, and constacyclic codes over $mathbb{F}_{q^{2m}}$ of length $n=frac{q^{2m}-1}{rho }$ with $rhomid (q+1)$ are considered in this paper, respectively. Two classes of quantum codes are derived from the images of these codes by the Hermitian construction. Compared with the previously known quantum codes, the quantum codes in our scheme have better parameters.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"96 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77413307","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we show how to generalize the quantum approximate counting technique developed by Brassard, H{o}yer and Tapp [ICALP 1998] to a more general setting: estimating the number of marked states of a Markov chain (a Markov chain can be seen as a random walk over a graph with weighted edges). This makes it possible to construct quantum approximate counting algorithms from quantum search algorithms based on the powerful ``quantum walk based search'' framework established by Magniez, Nayak, Roland and Santha [SIAM Journal on Computing 2011]. As an application, we apply this approach to the quantum element distinctness algorithm by Ambainis [SIAM Journal on Computing 2007]: for two injective functions over a set of $N$ elements, we obtain a quantum algorithm that estimates the number $m$ of collisions of the two functions within relative error $epsilon$ by making $tilde{O}left(frac{1}{epsilon^{25/24}}big(frac{N}{sqrt{m}}big)^{2/3}right)$ queries, which gives an improvement over the $Thetabig(frac{1}{epsilon}frac{N}{sqrt{m}}big)$-query classical algorithm based on random sampling when $mll N$.
在本文中，我们展示了如何将Brassard, H {o} yer和Tapp [ICALP 1998]开发的量子近似计数技术推广到更一般的设置:估计马尔可夫链的标记状态的数量(马尔可夫链可以看作是带加权边的图上的随机漫步)。这使得基于Magniez, Nayak, Roland和Santha [SIAM Journal on Computing 2011]建立的强大的“基于量子行走的搜索”框架的量子搜索算法构建量子近似计数算法成为可能。作为一个应用，我们将这种方法应用于Ambainis的量子元素独特性算法[SIAM Journal on Computing 2007]:对于一组$N$元素上的两个内射函数，我们获得了一个量子算法，该算法通过进行$tilde{O}left(frac{1}{epsilon^{25/24}}big(frac{N}{sqrt{m}}big)^{2/3}right)$查询来估计两个函数在相对误差$epsilon$内的碰撞次数$m$，该算法在$mll N$时改进了基于随机抽样的$Thetabig(frac{1}{epsilon}frac{N}{sqrt{m}}big)$ -query经典算法。
{"title":"Quantum approximate counting for Markov chains and collision counting","authors":"F. Gall, Iu-Iong Ng","doi":"10.26421/qic22.15-16-1","DOIUrl":"https://doi.org/10.26421/qic22.15-16-1","url":null,"abstract":"In this paper we show how to generalize the quantum approximate counting technique developed by Brassard, H{o}yer and Tapp [ICALP 1998] to a more general setting: estimating the number of marked states of a Markov chain (a Markov chain can be seen as a random walk over a graph with weighted edges). This makes it possible to construct quantum approximate counting algorithms from quantum search algorithms based on the powerful ``quantum walk based search'' framework established by Magniez, Nayak, Roland and Santha [SIAM Journal on Computing 2011]. As an application, we apply this approach to the quantum element distinctness algorithm by Ambainis [SIAM Journal on Computing 2007]: for two injective functions over a set of $N$ elements, we obtain a quantum algorithm that estimates the number $m$ of collisions of the two functions within relative error $epsilon$ by making $tilde{O}left(frac{1}{epsilon^{25/24}}big(frac{N}{sqrt{m}}big)^{2/3}right)$ queries, which gives an improvement over the $Thetabig(frac{1}{epsilon}frac{N}{sqrt{m}}big)$-query classical algorithm based on random sampling when $mll N$.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"99 1","pages":"1261-1279"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77778341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present a polynomial-complexity algorithm to construct a special orthogonal matrix for the deterministic remote state preparation (DRSP) of an arbitrary $n$-qubit state, and prove that if $n > 3$, such matrices do not exist. Firstly, the construction problem is split into two sub-problems, i.e., finding a solution of a semi-orthogonal matrix and generating all semi-orthogonal matrices. Through giving the definitions and properties of the matching operators, it is proved that the orthogonality of a special matrix is equivalent to the cooperation of multiple matching operators, and then the construction problem is reduced to the problem of solving an XOR linear equation system, which reduces the construction complexity from exponential to polynomial level. Having proved that each semi-orthogonal matrix can be simplified into a unique form, we use the proposed algorithm to confirm that the unique form does not have any solution when $n > 3$, which means it is infeasible to construct such a special orthogonal matrix for the DRSP of an arbitrary $n$-qubit state.
{"title":"Of Constructing a Special Orthogonal Matrix for the Deterministic Remote Preparation of Arbitrary N-qubit State","authors":"Wenjie Liu, Zi-Xi Li, Gonglin Yuan","doi":"10.26421/qic22.15-16-3","DOIUrl":"https://doi.org/10.26421/qic22.15-16-3","url":null,"abstract":"In this paper, we present a polynomial-complexity algorithm to construct a special orthogonal matrix for the deterministic remote state preparation (DRSP) of an arbitrary $n$-qubit state, and prove that if $n > 3$, such matrices do not exist. Firstly, the construction problem is split into two sub-problems, i.e., finding a solution of a semi-orthogonal matrix and generating all semi-orthogonal matrices. Through giving the definitions and properties of the matching operators, it is proved that the orthogonality of a special matrix is equivalent to the cooperation of multiple matching operators, and then the construction problem is reduced to the problem of solving an XOR linear equation system, which reduces the construction complexity from exponential to polynomial level. Having proved that each semi-orthogonal matrix can be simplified into a unique form, we use the proposed algorithm to confirm that the unique form does not have any solution when $n > 3$, which means it is infeasible to construct such a special orthogonal matrix for the DRSP of an arbitrary $n$-qubit state.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"29 1","pages":"1289-1319"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83085712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-10-01DOI: 10.48550/arXiv.2210.00231
Xi Lu, Hongfei Lin
Quantum phase estimation algorithm (PEA) is one of the most important algorithms in early studies of quantum computation. However, we find that the PEA is not an unbiased estimation, which prevents the estimation error from achieving an arbitrarily small level. In this paper, we propose an unbiased phase estimation algorithm (UPEA) based on the original PEA. We also show that a maximum likelihood estimation (MLE) post-processing step applied on UPEA has a smaller mean absolute error than MLE applied on PEA. In the end, we apply UPEA to quantum counting, and use an additional correction step to make the quantum counting algorithm unbiased.
{"title":"Unbiased quantum phase estimation","authors":"Xi Lu, Hongfei Lin","doi":"10.48550/arXiv.2210.00231","DOIUrl":"https://doi.org/10.48550/arXiv.2210.00231","url":null,"abstract":"Quantum phase estimation algorithm (PEA) is one of the most important algorithms in early studies of quantum computation. However, we find that the PEA is not an unbiased estimation, which prevents the estimation error from achieving an arbitrarily small level. In this paper, we propose an unbiased phase estimation algorithm (UPEA) based on the original PEA. We also show that a maximum likelihood estimation (MLE) post-processing step applied on UPEA has a smaller mean absolute error than MLE applied on PEA. In the end, we apply UPEA to quantum counting, and use an additional correction step to make the quantum counting algorithm unbiased.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"124 1","pages":"16-26"},"PeriodicalIF":0.0,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73594749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose an estimation of quantum resources necessary for recovering a key using Known Plain Text Attack (KPA) model for SPARKLE family of LWC authenticated block ciphers - SCHWAEMM. The procedure is based on a general attack using Grover's search algorithm with encryption oracle over key space in superposition. The paper explains step by step how to evaluate the cost of each operation type in encryption oracle in terms of various quantum and reversible gates. The result of this paper is an implementation of the simplified version of this cipher using quantum computer and summary table which shows the depth of quantum circuit, the size of quantum register and how many gates of NCT family are required for implementing the ciphers and attacks on them.
{"title":"Quantum tomography with Gaussian noise","authors":"Haigang Wang, K. He, Yuyang Hao, Shuyuan Yang","doi":"10.26421/qic22.13-14-4","DOIUrl":"https://doi.org/10.26421/qic22.13-14-4","url":null,"abstract":"In this paper, we propose an estimation of quantum resources necessary for recovering a key using Known Plain Text Attack (KPA) model for SPARKLE family of LWC authenticated block ciphers - SCHWAEMM. The procedure is based on a general attack using Grover's search algorithm with encryption oracle over key space in superposition. The paper explains step by step how to evaluate the cost of each operation type in encryption oracle in terms of various quantum and reversible gates. The result of this paper is an implementation of the simplified version of this cipher using quantum computer and summary table which shows the depth of quantum circuit, the size of quantum register and how many gates of NCT family are required for implementing the ciphers and attacks on them.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"9 1","pages":"1144-1157"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81856982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose an estimation of quantum resources necessary for recovering a key using Known Plain Text Attack (KPA) model for SPARKLE family of LWC authenticated block ciphers - SCHWAEMM. The procedure is based on a general attack using Grover's search algorithm with encryption oracle over key space in superposition. The paper explains step by step how to evaluate the cost of each operation type in encryption oracle in terms of various quantum and reversible gates. The result of this paper is an implementation of the simplified version of this cipher using quantum computer and summary table which shows the depth of quantum circuit, the size of quantum register and how many gates of NCT family are required for implementing the ciphers and attacks on them.
{"title":"NIST LWC call finalist","authors":"Adam Jagielski, Krzysztof Kanciak","doi":"10.26421/qic22.13-14-3","DOIUrl":"https://doi.org/10.26421/qic22.13-14-3","url":null,"abstract":"In this paper, we propose an estimation of quantum resources necessary for recovering a key using Known Plain Text Attack (KPA) model for SPARKLE family of LWC authenticated block ciphers - SCHWAEMM. The procedure is based on a general attack using Grover's search algorithm with encryption oracle over key space in superposition. The paper explains step by step how to evaluate the cost of each operation type in encryption oracle in terms of various quantum and reversible gates. The result of this paper is an implementation of the simplified version of this cipher using quantum computer and summary table which shows the depth of quantum circuit, the size of quantum register and how many gates of NCT family are required for implementing the ciphers and attacks on them.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"53 1","pages":"1132-1143"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80350278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Entanglement properties of random multipartite quantum states which are invariant under global $textnormal{SU}(d)$ action are investigated. The random states live in the tensor power of an irreducible representation of $textnormal{SU}(d)$. We calculate and analyze the expectation and fluctuation of the second-order R'enyi entanglement measure of the random invariant and near-invariant states in high dimension, and reveal the phenomenon of concentration of measure the random states exhibit. We show that with high probability a random SU($d$)-invariant state is close to being maximally entangled with respect to any bipartite cut as the dimension of individual system goes to infinity. We also show that this generic entanglement property of random SU(2)-invariant state is robust to arbitrarily finite disturbation.
{"title":"Entanglement properties of random invariant quantum states","authors":"Wei Xie, Weijing Li","doi":"10.26421/QIC22.11-12-1","DOIUrl":"https://doi.org/10.26421/QIC22.11-12-1","url":null,"abstract":"Entanglement properties of random multipartite quantum states which are invariant under global $textnormal{SU}(d)$ action are investigated. The random states live in the tensor power of an irreducible representation of $textnormal{SU}(d)$. We calculate and analyze the expectation and fluctuation of the second-order R'enyi entanglement measure of the random invariant and near-invariant states in high dimension, and reveal the phenomenon of concentration of measure the random states exhibit. We show that with high probability a random SU($d$)-invariant state is close to being maximally entangled with respect to any bipartite cut as the dimension of individual system goes to infinity. We also show that this generic entanglement property of random SU(2)-invariant state is robust to arbitrarily finite disturbation.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"338 1","pages":"901-923"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76150604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：