Pub Date : 2024-05-11DOI: 10.1007/s11128-024-04391-0
Manuel P. Cuéllar, M. C. Pegalajar, C. Cano
Explainable artificial intelligence is a research topic whose relevance has increased in recent years, especially with the advent of large machine learning models. However, very few attempts have been proposed to improve interpretability in the case of quantum artificial intelligence, and many existing quantum machine learning models in the literature can be considered almost as black boxes. In this article, we argue that an appropriate semantic interpretation of a given quantum circuit that solves a problem can be of interest to the user not only to certify the correct behavior of the learned model, but also to obtain a deeper insight into the problem at hand and its solution. We focus on decision-making problems that can be formulated as classification tasks and propose a method for learning quantum rule-based systems to solve them using evolutionary optimization algorithms. The approach is tested to learn rules that solve control and decision-making tasks in reinforcement learning environments, to provide interpretable agent policies that help to understand the internal dynamics of an unknown environment. Our results conclude that the learned policies are not only highly explainable, but can also help detect non-relevant features of problems and produce a minimal set of rules.
{"title":"Automatic evolutionary design of quantum rule-based systems and applications to quantum reinforcement learning","authors":"Manuel P. Cuéllar, M. C. Pegalajar, C. Cano","doi":"10.1007/s11128-024-04391-0","DOIUrl":"https://doi.org/10.1007/s11128-024-04391-0","url":null,"abstract":"<p>Explainable artificial intelligence is a research topic whose relevance has increased in recent years, especially with the advent of large machine learning models. However, very few attempts have been proposed to improve interpretability in the case of quantum artificial intelligence, and many existing quantum machine learning models in the literature can be considered almost as black boxes. In this article, we argue that an appropriate semantic interpretation of a given quantum circuit that solves a problem can be of interest to the user not only to certify the correct behavior of the learned model, but also to obtain a deeper insight into the problem at hand and its solution. We focus on decision-making problems that can be formulated as classification tasks and propose a method for learning quantum rule-based systems to solve them using evolutionary optimization algorithms. The approach is tested to learn rules that solve control and decision-making tasks in reinforcement learning environments, to provide interpretable agent policies that help to understand the internal dynamics of an unknown environment. Our results conclude that the learned policies are not only highly explainable, but can also help detect non-relevant features of problems and produce a minimal set of rules.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-11DOI: 10.1007/s11128-024-04373-2
Yasuaki Fujitani, Chusei Kiumi
One direction to investigate the relation between quantum walks and their underlying graphs is to define geometric quantity concerning quantum walks. In order to contribute to this direction, we define a transport distance between Grover walks, which can be seen as a quantum analogue of symmetric random walks. We employ signed optimal transport theory to formulate this distance. Also, we define coarse Ricci curvature induced by Grover walks and investigate its property. It has been found that this coarse Ricci curvature has similar properties to those of coarse Ricci curvature induced by random walks.
{"title":"Transport distance between Grover walks on graphs and coarse Ricci curvature","authors":"Yasuaki Fujitani, Chusei Kiumi","doi":"10.1007/s11128-024-04373-2","DOIUrl":"https://doi.org/10.1007/s11128-024-04373-2","url":null,"abstract":"<p>One direction to investigate the relation between quantum walks and their underlying graphs is to define geometric quantity concerning quantum walks. In order to contribute to this direction, we define a transport distance between Grover walks, which can be seen as a quantum analogue of symmetric random walks. We employ signed optimal transport theory to formulate this distance. Also, we define coarse Ricci curvature induced by Grover walks and investigate its property. It has been found that this coarse Ricci curvature has similar properties to those of coarse Ricci curvature induced by random walks.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937461","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
SM4 cryptographic algorithm is a block cipher algorithm issued by China’s state cryptographic administration and has become an international standard. We implement the quantum circuits of SM4 block cipher by optimizing the number of qubits and the value of depth-times-width. The quantum circuits of the S-box are first studied. According to the algebraic structure of the S-box, four kinds of improved quantum circuits of S-box are presented for different phases in SM4 based on composite field arithmetic. In order to optimize the number of qubits, we implement the quantum circuit of SM4 by connecting the quantum subcircuits in series. The implemented quantum circuit of SM4 only uses 260 qubits, which is the least number of qubits used not only in implementing the SM4 quantum circuit, but also in implementing the block cipher algorithms with 8-bit S-box, 128-bit plaintext and 128-bit secret key. When optimizing the value of depth-times-width, we achieve it through parallel implementation. The trade-off quantum circuit uses a total of 288 quantum bits, and the Toffoli depth is 1716. The depth-times-width is 49,4208, which is less than the existing best value 82,5792.
{"title":"Quantum circuit implementations of SM4 block cipher optimizing the number of qubits","authors":"Qing-bin Luo, Qiang Li, Xiao-yu Li, Guo-wu Yang, Jinan Shen, Minghui Zheng","doi":"10.1007/s11128-024-04394-x","DOIUrl":"https://doi.org/10.1007/s11128-024-04394-x","url":null,"abstract":"<p>SM4 cryptographic algorithm is a block cipher algorithm issued by China’s state cryptographic administration and has become an international standard. We implement the quantum circuits of SM4 block cipher by optimizing the number of qubits and the value of depth-times-width. The quantum circuits of the S-box are first studied. According to the algebraic structure of the S-box, four kinds of improved quantum circuits of S-box are presented for different phases in SM4 based on composite field arithmetic. In order to optimize the number of qubits, we implement the quantum circuit of SM4 by connecting the quantum subcircuits in series. The implemented quantum circuit of SM4 only uses 260 qubits, which is the least number of qubits used not only in implementing the SM4 quantum circuit, but also in implementing the block cipher algorithms with 8-bit S-box, 128-bit plaintext and 128-bit secret key. When optimizing the value of depth-times-width, we achieve it through parallel implementation. The trade-off quantum circuit uses a total of 288 quantum bits, and the Toffoli depth is 1716. The depth-times-width is 49,4208, which is less than the existing best value 82,5792.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937332","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-10DOI: 10.1007/s11128-024-04392-z
Suzhen Yuan, Wenhao Zhao, Jeremiah D. Deng, Shuyin Xia, Xianli Li
Amidst the rapid advancements in technology, there is a growing demand for processing an increasing volume and quality of images, which necessitates faster image processing capabilities. Enhancing the efficiency of image processing algorithms has thus become a critical priority. Existing quantum image edge detection algorithms tend to exhibit high circuit complexity, which is directly linked to the dimensions of the images being processed, leading to less than optimal computational velocities. In this study, we introduce a quantum image edge detection algorithm that is based on the Laplacian of Gaussian operator. This novel algorithm capitalizes on the quantum parallelism of quantum computing, resulting in a marked enhancement in both the speed and performance of edge detection. To substantiate the practicality of our approach, we conduct simulations using the International Business Machines Quantum (IBM Q) platform. The circuit complexity of our algorithm is meticulously computed, revealing a lower complexity compared to analogous quantum edge detection algorithms. Notably, this complexity is detached from the image size and is solely contingent upon the grayscale value range of the image pixels.
{"title":"Quantum image edge detection based on Laplacian of Gaussian operator","authors":"Suzhen Yuan, Wenhao Zhao, Jeremiah D. Deng, Shuyin Xia, Xianli Li","doi":"10.1007/s11128-024-04392-z","DOIUrl":"https://doi.org/10.1007/s11128-024-04392-z","url":null,"abstract":"<p>Amidst the rapid advancements in technology, there is a growing demand for processing an increasing volume and quality of images, which necessitates faster image processing capabilities. Enhancing the efficiency of image processing algorithms has thus become a critical priority. Existing quantum image edge detection algorithms tend to exhibit high circuit complexity, which is directly linked to the dimensions of the images being processed, leading to less than optimal computational velocities. In this study, we introduce a quantum image edge detection algorithm that is based on the Laplacian of Gaussian operator. This novel algorithm capitalizes on the quantum parallelism of quantum computing, resulting in a marked enhancement in both the speed and performance of edge detection. To substantiate the practicality of our approach, we conduct simulations using the International Business Machines Quantum (IBM Q) platform. The circuit complexity of our algorithm is meticulously computed, revealing a lower complexity compared to analogous quantum edge detection algorithms. Notably, this complexity is detached from the image size and is solely contingent upon the grayscale value range of the image pixels.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-09DOI: 10.1007/s11128-024-04351-8
Roman Abramov, Leonid Fedichkin, Dmitry Tsarev, Alexander Alodjants
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics. Our method is based on the fact that some graphs represent a result of Kronecker’s product of line graphs. We support our methods by means of various numerical experiments that check quantum and classical random walks on hypercycles and their convolutions. Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.
{"title":"High-dimensional graphs convolution for quantum walks photonic applications","authors":"Roman Abramov, Leonid Fedichkin, Dmitry Tsarev, Alexander Alodjants","doi":"10.1007/s11128-024-04351-8","DOIUrl":"https://doi.org/10.1007/s11128-024-04351-8","url":null,"abstract":"<p>Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and hypercycle convolution that preserves quantum walk dynamics. Our method is based on the fact that some graphs represent a result of Kronecker’s product of line graphs. We support our methods by means of various numerical experiments that check quantum and classical random walks on hypercycles and their convolutions. Our findings may be useful for saving a significant number of qubits required for algorithms that use quantum walk simulation on quantum devices.\u0000</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-09DOI: 10.1007/s11128-024-04396-9
Prodipto Das, Sumit Biswas, Sandip Kanoo
The foundation of this research is the quantum implementation of two hashing algorithms, namely Secure Hash Algorithm (SHA1) and Message Digest (MD5). Quantum cryptography is a challenging topic in network security for future networks. Quantum cryptography is an outgrowth of two broad topics—cryptology and cryptanalysis. In this paper, SHA1 and MD5 algorithms are designed and implemented for quantum computers. The main aim is to study and investigate the time requirement to build a hash and the bit rate at which a hash value is sent through. In this paper, a comprehensive analysis of these two algorithms is performed. Experiments have been done to compare and contrast the performances of the classical and proposed algorithms. In the experiment, it was found that the total time of execution of quantum SHA1 and quantum MD5 is much higher than the classical SHA1 and MD5. During quantum MD5 execution, it is observed that the time doubles when the number of chunks is increased from 1 to 2. Another experimental observation is that the execution time of the implemented algorithms depends upon the processor’s speed.
{"title":"Quantum implementation of SHA1 and MD5 and comparison with classical algorithms","authors":"Prodipto Das, Sumit Biswas, Sandip Kanoo","doi":"10.1007/s11128-024-04396-9","DOIUrl":"https://doi.org/10.1007/s11128-024-04396-9","url":null,"abstract":"<p>The foundation of this research is the quantum implementation of two hashing algorithms, namely Secure Hash Algorithm (SHA1) and Message Digest (MD5). Quantum cryptography is a challenging topic in network security for future networks. Quantum cryptography is an outgrowth of two broad topics—cryptology and cryptanalysis. In this paper, SHA1 and MD5 algorithms are designed and implemented for quantum computers. The main aim is to study and investigate the time requirement to build a hash and the bit rate at which a hash value is sent through. In this paper, a comprehensive analysis of these two algorithms is performed. Experiments have been done to compare and contrast the performances of the classical and proposed algorithms. In the experiment, it was found that the total time of execution of quantum SHA1 and quantum MD5 is much higher than the classical SHA1 and MD5. During quantum MD5 execution, it is observed that the time doubles when the number of chunks is increased from 1 to 2. Another experimental observation is that the execution time of the implemented algorithms depends upon the processor’s speed.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-07DOI: 10.1007/s11128-024-04383-0
Z. Gholami, Z. Noorinejad, M. Amini, E. Ghanbari-Adivi
A novel method has been devised to compute the local integrals of motion (LIOMs) for a one-dimensional many-body localized system. In this approach, a class of optimal unitary transformations is deduced in a tensor network formalism to diagonalize the Hamiltonian of the specified system. To construct the tensor network, we utilize the eigenstates of the subsystems’ Hamiltonian to attain the desired unitary transformations. Subsequently, we optimize the eigenstates and acquire appropriate unitary localized operators that will represent the LIOMs tensor network. The efficiency of the method was assessed and found to be both fast and almost accurate. In framework of the introduced tensor network representation, we examine how the entanglement spreads along the considered many-body localized system and evaluate the outcomes of the approximations employed in this approach. The important and interesting result is that in the proposed tensor network approximation, if the length of the blocks is greater than the length of localization, then the entropy growth will be linear in terms of the logarithmic time. Also, it has been demonstrated that the entanglement can be calculated by only considering two blocks next to each other, if the Hamiltonian has been diagonalized using the unitary transformation made by the provided tensor network representation.
{"title":"Tensor network representation and entanglement spreading in many-body localized systems: a novel approach","authors":"Z. Gholami, Z. Noorinejad, M. Amini, E. Ghanbari-Adivi","doi":"10.1007/s11128-024-04383-0","DOIUrl":"https://doi.org/10.1007/s11128-024-04383-0","url":null,"abstract":"<p>A novel method has been devised to compute the local integrals of motion (LIOMs) for a one-dimensional many-body localized system. In this approach, a class of optimal unitary transformations is deduced in a tensor network formalism to diagonalize the Hamiltonian of the specified system. To construct the tensor network, we utilize the eigenstates of the subsystems’ Hamiltonian to attain the desired unitary transformations. Subsequently, we optimize the eigenstates and acquire appropriate unitary localized operators that will represent the LIOMs tensor network. The efficiency of the method was assessed and found to be both fast and almost accurate. In framework of the introduced tensor network representation, we examine how the entanglement spreads along the considered many-body localized system and evaluate the outcomes of the approximations employed in this approach. The important and interesting result is that in the proposed tensor network approximation, if the length of the blocks is greater than the length of localization, then the entropy growth will be linear in terms of the logarithmic time. Also, it has been demonstrated that the entanglement can be calculated by only considering two blocks next to each other, if the Hamiltonian has been diagonalized using the unitary transformation made by the provided tensor network representation.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889829","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-07DOI: 10.1007/s11128-024-04398-7
Xin Xu, Jiang-Yuan Lian, Tian-Yu Ye
In this paper, we design the first semiquantum private comparison (SQPC) protocol which is realized via cavity quantum electrodynamics (QED) by making use of the evolution law of atom. With the help of a semi-honest third party (TP), the proposed protocol can compare the equality of private inputs from two semiquantum parties who only have limited quantum capabilities. The proposed protocol uses product states as initial quantum resource and employs none of unitary operations, quantum entanglement swapping operation or delay lines. Security proof turns out that it can defeat both the external attack and the internal attack.
{"title":"Semiquantum private comparison via cavity QED","authors":"Xin Xu, Jiang-Yuan Lian, Tian-Yu Ye","doi":"10.1007/s11128-024-04398-7","DOIUrl":"https://doi.org/10.1007/s11128-024-04398-7","url":null,"abstract":"<p>In this paper, we design the first semiquantum private comparison (SQPC) protocol which is realized via cavity quantum electrodynamics (QED) by making use of the evolution law of atom. With the help of a semi-honest third party (TP), the proposed protocol can compare the equality of private inputs from two semiquantum parties who only have limited quantum capabilities. The proposed protocol uses product states as initial quantum resource and employs none of unitary operations, quantum entanglement swapping operation or delay lines. Security proof turns out that it can defeat both the external attack and the internal attack.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-06DOI: 10.1007/s11128-024-04397-8
Pritam Roy, Subhankar Bera, Shashank Gupta, A. S. Majumdar
Device-independent quantum secure direct communication (DI-QSDC) is a promising primitive in quantum cryptography aimed towards addressing the problems of device imperfections and key management. However, significant effort is required to tackle practical challenges such as the distance limitation due to the decohering effects of quantum channels. Here, we explore the constructive effect of non-Markovian noise to improve the performance of DI-QSDC. Considering two different environmental dynamics modelled by the amplitude damping and the dephasing channels, we show that for both cases non-Markovianty leads to a considerable improvement over Markovian dynamics in terms of three benchmark performance criteria of the DI-QSDC task. Specifically, we find that non-Markovian noise (i) enhances the protocol security measured by Bell violation, (ii) leads to a lower quantum bit error rate, and (iii) enables larger communication distances by increasing the capacity of secret communication.
{"title":"Device-independent quantum secure direct communication under non-Markovian quantum channels","authors":"Pritam Roy, Subhankar Bera, Shashank Gupta, A. S. Majumdar","doi":"10.1007/s11128-024-04397-8","DOIUrl":"https://doi.org/10.1007/s11128-024-04397-8","url":null,"abstract":"<p>Device-independent quantum secure direct communication (DI-QSDC) is a promising primitive in quantum cryptography aimed towards addressing the problems of device imperfections and key management. However, significant effort is required to tackle practical challenges such as the distance limitation due to the decohering effects of quantum channels. Here, we explore the constructive effect of non-Markovian noise to improve the performance of DI-QSDC. Considering two different environmental dynamics modelled by the amplitude damping and the dephasing channels, we show that for both cases non-Markovianty leads to a considerable improvement over Markovian dynamics in terms of three benchmark performance criteria of the DI-QSDC task. Specifically, we find that non-Markovian noise (i) enhances the protocol security measured by Bell violation, (ii) leads to a lower quantum bit error rate, and (iii) enables larger communication distances by increasing the capacity of secret communication.\u0000</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-05-06DOI: 10.1007/s11128-024-04380-3
Xia Yan, Mingxing Luo, Songya Ma
As a new functional network supporting communication, quantum network can provide higher security and lower complexity for quantum information processing. Based on the one-to-one quantum state merging and quantum state redistribution, we first generalize them to the multi-to-one situation and give the optimal cost pair for merging or redistributing quantum states from each sender to the receiver in turn. It is proved that previously received information can reduce the cost of the next transfer. Then, using the method of fusion, we propose a state transfer protocol over the multi-access channel network with one intermediate node and provide its optimal cost pair. Finally, two specific examples are given to demonstrate our results when a GHZ-like state or a Werner-type state is taken as the shared entanglement resource.
作为一种支持通信的新型功能网络,量子网络可以为量子信息处理提供更高的安全性和更低的复杂性。在一对一量子态合并和量子态再分配的基础上,我们首先将其推广到多对一的情况,并给出了每个发送方依次向接收方合并或再分配量子态的最优成本对。事实证明,之前接收到的信息可以降低下一次传输的成本。然后,利用融合的方法,我们提出了一种在多接入信道网络上只有一个中间节点的状态传输协议,并提供了其最优成本对。最后,我们给出了两个具体的例子来证明我们在以类似 GHZ 的状态或 Werner 类型的状态作为共享纠缠资源时取得的成果。
{"title":"State transfer on the multi-access channel network","authors":"Xia Yan, Mingxing Luo, Songya Ma","doi":"10.1007/s11128-024-04380-3","DOIUrl":"https://doi.org/10.1007/s11128-024-04380-3","url":null,"abstract":"<p>As a new functional network supporting communication, quantum network can provide higher security and lower complexity for quantum information processing. Based on the one-to-one quantum state merging and quantum state redistribution, we first generalize them to the multi-to-one situation and give the optimal cost pair for merging or redistributing quantum states from each sender to the receiver in turn. It is proved that previously received information can reduce the cost of the next transfer. Then, using the method of fusion, we propose a state transfer protocol over the multi-access channel network with one intermediate node and provide its optimal cost pair. Finally, two specific examples are given to demonstrate our results when a GHZ-like state or a Werner-type state is taken as the shared entanglement resource.</p>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}