A. Abdelwahab, S. A. Ghwail, N. Metwally, M. H. Mahran, A. Obada
The local and non local behavior of the accelerated Gisin state are investigated either before or after filtering process. It is shown that, the possibility of predicting the non-local behavior is forseen at large values of the weight of the Gisin and acceleration parameters. Due to the filtering process, the non-locality behavior of the Gisin state is predicted at small values of the weight parameter. The amount of non classical correlations are quantified by means of the local quantum uncertainty (LQU)and the concurrence, where the LQU is more sensitive to the non-locality than the concurrence. The phenomenon of the sudden changes is displayed for both quantifiers. Our results show that, the accelerated Gisin state could be used to mask information, where all the possible partitions of the masked state satisfy the masking criteria. Moreover, there is a set of states, which satisfy the masking condition, that is generated between each qubit and its masker qubit. For this set, the amount of the non-classical correlations increases as the acceleration parameter increases . Further, the filtering process improves these correlations, where their maximum bounds are much larger than those depicted for non-filtered states.
{"title":"Gisin state: its non-locality, quantum correlations and efficiency to perform quantum masking","authors":"A. Abdelwahab, S. A. Ghwail, N. Metwally, M. H. Mahran, A. Obada","doi":"10.26421/qic21.15-16-2","DOIUrl":"https://doi.org/10.26421/qic21.15-16-2","url":null,"abstract":"The local and non local behavior of the accelerated Gisin state are investigated either before or after filtering process. It is shown that, the possibility of predicting the non-local behavior is forseen at large values of the weight of the Gisin and acceleration parameters. Due to the filtering process, the non-locality behavior of the Gisin state is predicted at small values of the weight parameter. The amount of non classical correlations are quantified by means of the local quantum uncertainty (LQU)and the concurrence, where the LQU is more sensitive to the non-locality than the concurrence. The phenomenon of the sudden changes is displayed for both quantifiers. Our results show that, the accelerated Gisin state could be used to mask information, where all the possible partitions of the masked state satisfy the masking criteria. Moreover, there is a set of states, which satisfy the masking condition, that is generated between each qubit and its masker qubit. For this set, the amount of the non-classical correlations increases as the acceleration parameter increases . Further, the filtering process improves these correlations, where their maximum bounds are much larger than those depicted for non-filtered states.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"163 1","pages":"1274-1295"},"PeriodicalIF":0.0,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74206240","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}
We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are $*$-isomorphic. We first show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is $*$-isomorphic to the game algebra of an associated bisynchronous game on $nk$ inputs and $nk$ outputs. As a result, we show that there are bisynchronous games with equal question and answer sets, whose optimal strategies only exist in the quantum commuting model, and not in the quantum approximate model. Moreover, we show that there are bisynchronous games with equal question and answer sets that have non-zero game algebras, but no winning quantum commuting strategies, resolving a problem of V.I. Paulsen and M. Rahaman. We also exhibit a $*$-isomorphism between any synchronous game algebra with $n$ questions and $k>3$ answers and a synchronous game algebra with $n(k-2)$ questions and $3$ answers.
{"title":"*-isomorphic Game Algebras","authors":"Samuel J. Harris","doi":"10.26421/qic22.11-12-2","DOIUrl":"https://doi.org/10.26421/qic22.11-12-2","url":null,"abstract":"We establish several strong equivalences of synchronous non-local games, in the sense that the corresponding game algebras are $*$-isomorphic. We first show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is $*$-isomorphic to the game algebra of an associated bisynchronous game on $nk$ inputs and $nk$ outputs. As a result, we show that there are bisynchronous games with equal question and answer sets, whose optimal strategies only exist in the quantum commuting model, and not in the quantum approximate model. Moreover, we show that there are bisynchronous games with equal question and answer sets that have non-zero game algebras, but no winning quantum commuting strategies, resolving a problem of V.I. Paulsen and M. Rahaman. We also exhibit a $*$-isomorphism between any synchronous game algebra with $n$ questions and $k>3$ answers and a synchronous game algebra with $n(k-2)$ questions and $3$ answers.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"8 3-4","pages":"924-946"},"PeriodicalIF":0.0,"publicationDate":"2021-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91496906","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}
Silva et al. produced quantum codes related to topology and coloring, which are associated with tessellations on the orientable surfaces of genus $ge 1$ and the non-orientable surfaces of the genus 1. Current work presents an approach to build quantum surface and color codes} on non-orientable surfaces of genus $ geq 2n+1 $ for $ngeq 1$. We also present several tables of new surface and color codes related to non-orientable surfaces. These codes have the ratios $k/n$ and $d/n$ better than the codes obtained from orientable surfaces.
{"title":"Orientable Surfaces","authors":"Debashish Bhowmik, D. Maity, E. B. Silva","doi":"10.26421/qic21.13-14-4","DOIUrl":"https://doi.org/10.26421/qic21.13-14-4","url":null,"abstract":"Silva et al. produced quantum codes related to topology and coloring, which are associated with tessellations on the orientable surfaces of genus $ge 1$ and the non-orientable surfaces of the genus 1. Current work presents an approach to build quantum surface and color codes} on non-orientable surfaces of genus $ geq 2n+1 $ for $ngeq 1$. We also present several tables of new surface and color codes related to non-orientable surfaces. These codes have the ratios $k/n$ and $d/n$ better than the codes obtained from orientable surfaces.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"28 1","pages":"1135-1153"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87996463","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}
G. Cui, Zhimin Wang, Shengbin Wang, S. Shi, R. Shang, Wendong Li, Zhiqiang Wei, Y. Gu
Solving differential equations is one of the most promising applications of quantum computing. Recently we proposed an efficient quantum algorithm for solving one-dimensional Poisson equation avoiding the need to perform quantum arithmetic or Hamiltonian simulation. In this paper, we further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. To this end, we first optimize the quantum 1D-Poisson solver by developing a new way of performing the sine transformation. The circuit depth for implementing the sine transform is reduced from n2 to n without increasing the total qubit cost of the whole circuit, which is achieved by neatly reusing the additional ancillary quits. Then, we analyse the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit. We find that the phase damping noise has little effect on our algorithm, while the bit flip noise has the greatest impact. In addition, threshold errors of the quantum gates are obtained to make the fidelity of the circuit output being greater than 90%. The results of noise analysis will provide a good guidance for the subsequent work of error mitigation and error correction for our algorithm. The noise-analysis method developed in this work can be used for other algorithms to be executed on the NISQ devices.
{"title":"Optimization and noise analysis of the quantum algorithm for solving one-dimensional Poisson equation","authors":"G. Cui, Zhimin Wang, Shengbin Wang, S. Shi, R. Shang, Wendong Li, Zhiqiang Wei, Y. Gu","doi":"10.26421/QIC22.7-8-2","DOIUrl":"https://doi.org/10.26421/QIC22.7-8-2","url":null,"abstract":"Solving differential equations is one of the most promising applications of quantum computing. Recently we proposed an efficient quantum algorithm for solving one-dimensional Poisson equation avoiding the need to perform quantum arithmetic or Hamiltonian simulation. In this paper, we further develop this algorithm to make it closer to the real application on the noisy intermediate-scale quantum (NISQ) devices. To this end, we first optimize the quantum 1D-Poisson solver by developing a new way of performing the sine transformation. The circuit depth for implementing the sine transform is reduced from n2 to n without increasing the total qubit cost of the whole circuit, which is achieved by neatly reusing the additional ancillary quits. Then, we analyse the effect of common noise existing in the real quantum devices on our algorithm using the IBM Qiskit toolkit. We find that the phase damping noise has little effect on our algorithm, while the bit flip noise has the greatest impact. In addition, threshold errors of the quantum gates are obtained to make the fidelity of the circuit output being greater than 90%. The results of noise analysis will provide a good guidance for the subsequent work of error mitigation and error correction for our algorithm. The noise-analysis method developed in this work can be used for other algorithms to be executed on the NISQ devices.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"5 1","pages":"569-593"},"PeriodicalIF":0.0,"publicationDate":"2021-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74842039","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}
We present a construction of highly entangled states defined on the topology of a platonic solid using tensor networks based on ancillary Absolute Maximally Entangled (AME) states. We illustrate the idea using the example of a quantum state based on AME(5,2) over a dodecahedron. We analyze the entropy of such states on many different partitions, and observe that they come on integer numbers and are almost maximal. We also observe that all platonic solids accept the construction of AME states based on Reed-Solomon codes since their number of facets, vertices and edges are always a prime number plus one.
{"title":"Platonic entanglement","authors":"Jos'e I. Latorre, Germ'an Sierra","doi":"10.26421/qic21.13-14-1","DOIUrl":"https://doi.org/10.26421/qic21.13-14-1","url":null,"abstract":"We present a construction of highly entangled states defined on the topology of a platonic solid using tensor networks based on ancillary Absolute Maximally Entangled (AME) states. We illustrate the idea using the example of a quantum state based on AME(5,2) over a dodecahedron. We analyze the entropy of such states on many different partitions, and observe that they come on integer numbers and are almost maximal. We also observe that all platonic solids accept the construction of AME states based on Reed-Solomon codes since their number of facets, vertices and edges are always a prime number plus one.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"48 1","pages":"1081-1090"},"PeriodicalIF":0.0,"publicationDate":"2021-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78478997","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}
No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we formalise the task achieved by these experiments, extending it to the control of arbitrary noisy channels, and to more general types of control involving higher dimensional control systems. For the standard notion of coherent control, we identify the information-theoretic resource for controlling an arbitrary quantum channel on a $d$-dimensional system: specifically, the resource is an extended quantum channel acting as the original channel on a $d$-dimensional sector of a $(d+1)$-dimensional system. Using this resource, arbitrary controlled channels can be built with a universal circuit architecture. We then extend the standard notion of control to more general notions, including control of multiple channels with possibly different input and output systems. Finally, we develop a theoretical framework, called supermaps on routed channels, which provides a compact representation of coherent control as an operation performed on the extended channels, and highlights the way the operation acts on different sectors.
{"title":"Universal control of quantum processes using sector-preserving channels","authors":"Augustin Vanrietvelde, G. Chiribella","doi":"10.26421/QIC21.15-16-5","DOIUrl":"https://doi.org/10.26421/QIC21.15-16-5","url":null,"abstract":"No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we formalise the task achieved by these experiments, extending it to the control of arbitrary noisy channels, and to more general types of control involving higher dimensional control systems. For the standard notion of coherent control, we identify the information-theoretic resource for controlling an arbitrary quantum channel on a $d$-dimensional system: specifically, the resource is an extended quantum channel acting as the original channel on a $d$-dimensional sector of a $(d+1)$-dimensional system. Using this resource, arbitrary controlled channels can be built with a universal circuit architecture. We then extend the standard notion of control to more general notions, including control of multiple channels with possibly different input and output systems. Finally, we develop a theoretical framework, called supermaps on routed channels, which provides a compact representation of coherent control as an operation performed on the extended channels, and highlights the way the operation acts on different sectors.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"18 1","pages":"1320-1352"},"PeriodicalIF":0.0,"publicationDate":"2021-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84922004","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 is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence may act as a useful resource in quantum information theory. We will employ here quantum coherence to detect and classify the entanglement property of three-qubit states. Moreover, we have shown that if any three-qubit state violates another necessary condition for the detection of a general biseparable state then the given three-qubit state cannot be a biseparable state. Since there are only three categories of states for the three-qubit system so if we detect that the state under probe is neither a separable nor a biseparable state then we can definitely conclude that the given three-qubit state is a genuine entangled state. We have illustrated our results with a few examples.
{"title":"Detection and classification of three-qubit states using l_1 norm of coherence","authors":"A. Kumari, S. Adhikari","doi":"10.26421/QIC23.5-6-1","DOIUrl":"https://doi.org/10.26421/QIC23.5-6-1","url":null,"abstract":"Entanglement is a purely quantum mechanical phenomenon and thus it has no classical analog. On the other hand, coherence is a well-known phenomenon in classical optics and in quantum mechanics. Recent research shows that quantum coherence may act as a useful resource in quantum information theory. We will employ here quantum coherence to detect and classify the entanglement property of three-qubit states. Moreover, we have shown that if any three-qubit state violates another necessary condition for the detection of a general biseparable state then the given three-qubit state cannot be a biseparable state. Since there are only three categories of states for the three-qubit system so if we detect that the state under probe is neither a separable nor a biseparable state then we can definitely conclude that the given three-qubit state is a genuine entangled state. We have illustrated our results with a few examples.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"145 1","pages":"361-378"},"PeriodicalIF":0.0,"publicationDate":"2021-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87975001","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}
he matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we propose a quantum algorithm for matrix functions based on a procedure to implement the linear combination of the inverses on quantum computers. Compared with the previous study [S. Takahira, A. Ohashi, T. Sogabe, and T.S. Usuda, Quant. Inf. Comput., textbf{20}, 1&2, 14--36, (Feb. 2020)] that proposed a quantum algorithm to compute a quantum state for the matrix function based on the circular contour centered at the origin, the quantum algorithm in the present paper can be applied to a more general contour. Moreover, the algorithm is described by the block-encoding framework. Similarly to the previous study, the algorithm can be applied even if the input matrix is not a Hermitian or normal matrix. This is an advantage compared with quantum singular value transformation.
矩阵函数可由柯西积分公式定义，并可由移位矩阵的逆的线性组合用正交公式逼近。本文提出了一种在量子计算机上实现逆线性组合的矩阵函数量子算法。与以往研究相比[S;Takahira, A. Ohashi, T. Sogabe和T.S. Usuda, Quant. Inf. computer。[j]， textbf{20}, 1＆2, 14—36，(2020年2月)]提出了一种基于以原点为中心的圆形轮廓计算矩阵函数量子态的量子算法，本文的量子算法可以应用于更一般的轮廓。该算法采用块编码框架进行描述。与之前的研究类似，即使输入矩阵不是厄米矩阵或正态矩阵，该算法也可以应用。这与量子奇异值变换相比具有优势。
{"title":"Quantum algorithms based on the block-encoding framework for matrix functions by contour integrals","authors":"S. Takahira, A. Ohashi, T. Sogabe, T. Usuda","doi":"10.26421/qic22.11-12-4","DOIUrl":"https://doi.org/10.26421/qic22.11-12-4","url":null,"abstract":"he matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we propose a quantum algorithm for matrix functions based on a procedure to implement the linear combination of the inverses on quantum computers. Compared with the previous study [S. Takahira, A. Ohashi, T. Sogabe, and T.S. Usuda, Quant. Inf. Comput., textbf{20}, 1&2, 14--36, (Feb. 2020)] that proposed a quantum algorithm to compute a quantum state for the matrix function based on the circular contour centered at the origin, the quantum algorithm in the present paper can be applied to a more general contour. Moreover, the algorithm is described by the block-encoding framework. Similarly to the previous study, the algorithm can be applied even if the input matrix is not a Hermitian or normal matrix. This is an advantage compared with quantum singular value transformation.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"23 1","pages":"965-979"},"PeriodicalIF":0.0,"publicationDate":"2021-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88869989","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}
We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.
{"title":"A benchmark for quantum optimization: the traveling salesman","authors":"R. H. Warren","doi":"10.26421/QIC21.7-8-2","DOIUrl":"https://doi.org/10.26421/QIC21.7-8-2","url":null,"abstract":"We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"17 1","pages":"557-562"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88216164","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 key distribution cannot satisfy some users without quantum capability, so semi-quantum key distribution emerges as the times required. Semi-quantum key distribution protocol is described as Alice has quantum ability to prepare and measure qubits with an arbitrary basis, while Bob only measures qubits with the computational basis or reflects qubits to Alice. However, most existing semi-quantum key distribution protocols have been performed with low eavesdropping detection probability. In this paper, we present an innovative semi-quantum key distribution protocol with high efficiency based on EPR and single-particle hybridization, in which the specific contents of {scriptsize CTRL} or {scriptsize SIFT} operations have been newly defined. Then, the security analysis indicates the proposed protocol is asymptotically secure with more high eavesdropping detection probability against individual eavesdropping attacks. Moreover, the efficiency analysis shows that the presented protocol is more efficient than similar literatures.
{"title":"EPR and single-particle hybridization","authors":"Yuan Tian, Jian Li, Kaiguo Yuan, Chaoyang Li, Hengji Li, Xiubo Chen","doi":"10.26421/QIC21.7-8-3","DOIUrl":"https://doi.org/10.26421/QIC21.7-8-3","url":null,"abstract":"Quantum key distribution cannot satisfy some users without quantum capability, so semi-quantum key distribution emerges as the times required. Semi-quantum key distribution protocol is described as Alice has quantum ability to prepare and measure qubits with an arbitrary basis, while Bob only measures qubits with the computational basis or reflects qubits to Alice. However, most existing semi-quantum key distribution protocols have been performed with low eavesdropping detection probability. In this paper, we present an innovative semi-quantum key distribution protocol with high efficiency based on EPR and single-particle hybridization, in which the specific contents of {scriptsize CTRL} or {scriptsize SIFT} operations have been newly defined. Then, the security analysis indicates the proposed protocol is asymptotically secure with more high eavesdropping detection probability against individual eavesdropping attacks. Moreover, the efficiency analysis shows that the presented protocol is more efficient than similar literatures.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"88 1","pages":"563-576"},"PeriodicalIF":0.0,"publicationDate":"2021-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83808825","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
扫码关注我们
求助内容：
应助结果提醒方式：