J. Akahori, Norio Konno, Rikuki Okamoto, Iwao Sato
Interacting particle systems studied in this paper are probabilistic cellular automata with nearest-neighbor interaction including the Domany-Kinzel model. A special case of the Domany-Kinzel model is directed percolation. We regard the interacting particle system as a Markov chain on a graph. Then we present a new quantization of the interacting particle system. After that, we introduce a zeta function of the quantized model and give its determinant expression. Moreover, we calculate the absolute zeta function of the quantized model for the Domany-Kinzel model.
{"title":"A quantization of interacting particle systems","authors":"J. Akahori, Norio Konno, Rikuki Okamoto, Iwao Sato","doi":"10.26421/qic24.3-4-2","DOIUrl":"https://doi.org/10.26421/qic24.3-4-2","url":null,"abstract":"Interacting particle systems studied in this paper are probabilistic cellular automata with nearest-neighbor interaction including the Domany-Kinzel model. A special case of the Domany-Kinzel model is directed percolation. We regard the interacting particle system as a Markov chain on a graph. Then we present a new quantization of the interacting particle system. After that, we introduce a zeta function of the quantized model and give its determinant expression. Moreover, we calculate the absolute zeta function of the quantized model for the Domany-Kinzel model.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"250 1","pages":"210-226"},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140466600","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}
Ricardo Pérez-Castillo, Manuel Ángel Serrano, J. A. Cruz-Lemus, Mario Piattini
Quantum computing is the turning point that represents a revolution in software development that will make it possible to solve those problems unsolvable with classical computing. Just as in other milestones in the history of software development, such as the adoption of object-oriented systems, where new software development processes and new life cycles emerged, with the quantum computing revolution, a new life cycle for quantum and hybrid software systems is needed. Although there are some life cycle proposals for quantum software systems, most of them do not comprehensively address the specific needs of these systems. In this paper, a quantum life cycle proposal is presented adapted from the Incremental Commitment Spiral Model (ICSM) and an example of its use is presented. nd that projection cannot exceed $lfloorfrac{n}{2}rfloor$.
{"title":"Guidelines to use the ICSM for developing quantum-classical systems","authors":"Ricardo Pérez-Castillo, Manuel Ángel Serrano, J. A. Cruz-Lemus, Mario Piattini","doi":"10.26421/QIC24.1-2-4","DOIUrl":"https://doi.org/10.26421/QIC24.1-2-4","url":null,"abstract":"Quantum computing is the turning point that represents a revolution in software development that will make it possible to solve those problems unsolvable with classical computing. Just as in other milestones in the history of software development, such as the adoption of object-oriented systems, where new software development processes and new life cycles emerged, with the quantum computing revolution, a new life cycle for quantum and hybrid software systems is needed. Although there are some life cycle proposals for quantum software systems, most of them do not comprehensively address the specific needs of these systems. In this paper, a quantum life cycle proposal is presented adapted from the Incremental Commitment Spiral Model (ICSM) and an example of its use is presented. nd that projection cannot exceed $lfloorfrac{n}{2}rfloor$.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"960 ","pages":"71-88"},"PeriodicalIF":0.0,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140467439","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}
The vast amount of data generated by various applications necessitates the need for advanced computing capabilities to process, analyze and extract insights from it. Quantum computing, with its ability to perform complex operations in parallel, holds immense promise for data mining in cloud environments. This article examines cutting-edge methods for using quantum computing for data mining. The paper analyzes several key quantum algorithms, including Grover's search algorithm, quantum principal component analysis (QPCA), and quantum support vector machines (QSVM). It delves into the details of these algorithms, exploring their principles, applications, and potential benefits in various domains. We also done the comparative analysis of various algorithms and discussed about the difficulties of using quantum computing for data mining, such as the requirement for specialized knowledge, scalability issues, and hardware constraints. Overall, this work demonstrates the ability of quantum computing for scalable and effective data mining in cloud systems and proposes future research avenues for investigating the use of quantum computing for data mining.
{"title":"A Comparative Analysis of Quantum-based Approaches for Scalable and Efficient Data mining in Cloud Environments","authors":"K. Sudharson, B. Alekhya","doi":"10.26421/QIC23.9-10-3","DOIUrl":"https://doi.org/10.26421/QIC23.9-10-3","url":null,"abstract":"The vast amount of data generated by various applications necessitates the need for advanced computing capabilities to process, analyze and extract insights from it. Quantum computing, with its ability to perform complex operations in parallel, holds immense promise for data mining in cloud environments. This article examines cutting-edge methods for using quantum computing for data mining. The paper analyzes several key quantum algorithms, including Grover's search algorithm, quantum principal component analysis (QPCA), and quantum support vector machines (QSVM). It delves into the details of these algorithms, exploring their principles, applications, and potential benefits in various domains. We also done the comparative analysis of various algorithms and discussed about the difficulties of using quantum computing for data mining, such as the requirement for specialized knowledge, scalability issues, and hardware constraints. Overall, this work demonstrates the ability of quantum computing for scalable and effective data mining in cloud systems and proposes future research avenues for investigating the use of quantum computing for data mining.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"44 1","pages":"783-813"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87803979","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 an important quantum resource, which can be used in quantum teleportation and quantum computation. How to judge and measure entanglement or separability has become a basic problem in quantum information theory. In this paper, by analyzing the properties of generalized ring $mathbb{Z}[i]^{{2}^{n}}$, a new method is presented to judge the entanglement or separability of any quantum state in the discrete quantum computing model proposed by Gatti and Lacalle. Different from previous criteria based on matrices, it is relatively simple to operate in mathematical calculation. And if a quantum state is separable, it can calculate the separable mathematical expression. Taking $n=2,3$ as examples, the concrete forms of all separable states in the model are presented. It provides a new research perspective for the discrete quantum computing model.
{"title":"Criteria for entanglement and separability of discrete quantum states","authors":"Miao Wang, Zhenfu Cao, Xiaolei Dong","doi":"10.26421/qic23.7-8-1","DOIUrl":"https://doi.org/10.26421/qic23.7-8-1","url":null,"abstract":"Entanglement is an important quantum resource, which can be used in quantum teleportation and quantum computation. How to judge and measure entanglement or separability has become a basic problem in quantum information theory. In this paper, by analyzing the properties of generalized ring $mathbb{Z}[i]^{{2}^{n}}$, a new method is presented to judge the entanglement or separability of any quantum state in the discrete quantum computing model proposed by Gatti and Lacalle. Different from previous criteria based on matrices, it is relatively simple to operate in mathematical calculation. And if a quantum state is separable, it can calculate the separable mathematical expression. Taking $n=2,3$ as examples, the concrete forms of all separable states in the model are presented. It provides a new research perspective for the discrete quantum computing model.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"37 1","pages":"541-561"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85607336","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 recent years, several properties and recurrence criteria of discrete-time open quantum walks (OQWs) have been presented. Recently, Pellegrini introduced continuous-time open quantum walks (CTOQWs) as continuous-time natural limits of discrete-time OQWs. In this work, we study semifinite CTOQWs and some of their basic properties concerning statistics, such as transition probabilities and site recurrence. The notion of SJK-recurrence for CTOQWs is introduced, and it is shown to be equivalent to the traditional concept of recurrence. This statistic arises from the definition of $delta$-skeleton of CTOQWs, which is a dynamic that allows us to obtain a discrete-time OQW in terms of a CTOQW. We present a complete criterion for site recurrence in the case of CTOQW induced by a coin of finite dimension with a set of vertices $mathbb{Z}$ such that its auxiliary Lindblad operator has a single stationary state. Finally, we present a similar criterion that completes the case in which the internal degree of freedom of each site is of dimension 2.
{"title":"Site recurrence for continuous-time open quantum walks on the line","authors":"Newton Loebens","doi":"10.26421/QIC23.7-8-3","DOIUrl":"https://doi.org/10.26421/QIC23.7-8-3","url":null,"abstract":"In recent years, several properties and recurrence criteria of discrete-time open quantum walks (OQWs) have been presented. Recently, Pellegrini introduced continuous-time open quantum walks (CTOQWs) as continuous-time natural limits of discrete-time OQWs. In this work, we study semifinite CTOQWs and some of their basic properties concerning statistics, such as transition probabilities and site recurrence. The notion of SJK-recurrence for CTOQWs is introduced, and it is shown to be equivalent to the traditional concept of recurrence. This statistic arises from the definition of $delta$-skeleton of CTOQWs, which is a dynamic that allows us to obtain a discrete-time OQW in terms of a CTOQW. We present a complete criterion for site recurrence in the case of CTOQW induced by a coin of finite dimension with a set of vertices $mathbb{Z}$ such that its auxiliary Lindblad operator has a single stationary state. Finally, we present a similar criterion that completes the case in which the internal degree of freedom of each site is of dimension 2.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"7 1","pages":"577-602"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85300643","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 study the quantum complexity of the integration of a function with an unknown singularity. We assume that the function has $r$ continuous derivatives, with the derivative of order $r$ being H"older continuous with the exponent $rho$ on the whole integration interval except the one singular point. We show that the $ve$-complexity of this problem is of order $ve^{-1/(r+rho+1)}$. Since the classical deterministic complexity of this problem is $ve^{-1/(r+rho)}$, quantum computers give a speed-up for this problem for all values of parameters $r$ and $rho$.
{"title":"On the quantum complexity of integration of a function with unknown singularity","authors":"Maciej Goćwin","doi":"10.26421/QIC23.7-8-4","DOIUrl":"https://doi.org/10.26421/QIC23.7-8-4","url":null,"abstract":"In this paper we study the quantum complexity of the integration of a function with an unknown singularity. We assume that the function has $r$ continuous derivatives, with the derivative of order $r$ being H\"older continuous with the exponent $rho$ on the whole integration interval except the one singular point. We show that the $ve$-complexity of this problem is of order $ve^{-1/(r+rho+1)}$. Since the classical deterministic complexity of this problem is $ve^{-1/(r+rho)}$, quantum computers give a speed-up for this problem for all values of parameters $r$ and $rho$.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"43 1","pages":"603-613"},"PeriodicalIF":0.0,"publicationDate":"2023-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82734513","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-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters $[[frac{{{q^2} - 1}}{a},frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q$, where $q$ is a prime power with the form $q = am pm ell$, $a = frac{{ell^2} - 1}{3}$ is an odd integer, $ell equiv 2 (bmod 6)$ or $ell equiv 4 (bmod 6)$, and $m$ is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.
{"title":"New entanglement-assisted quantum MDS codes derived from cyclic codes","authors":"Sujuan Huang, Shixin Zhu, Pan Wang","doi":"10.26421/QIC23.5-6-4","DOIUrl":"https://doi.org/10.26421/QIC23.5-6-4","url":null,"abstract":"Entanglement-assisted quantum error-correcting codes, which can be seen as a generalization of quantum error-correcting codes, can be constructed from arbitrary classical linear codes by relaxing the self-orthogonality properties and using pre-shared entangled states between the sender and the receiver, and can also improve the performance of quantum error-correcting codes. In this paper, we construct some families of entanglement-assisted quantum maximum-distance-separable codes with parameters $[[frac{{{q^2} - 1}}{a},frac{{{q^2} - 1}}{a} - 2d+2 + c,d;c]]_q$, where $q$ is a prime power with the form $q = am pm ell$, $a = frac{{ell^2} - 1}{3}$ is an odd integer, $ell equiv 2 (bmod 6)$ or $ell equiv 4 (bmod 6)$, and $m$ is a positive integer. Most of these codes are new in the sense that their parameters are not covered by the codes available in the literature.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"44 1","pages":"415-440"},"PeriodicalIF":0.0,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77211728","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}
Recently, proposed algorithms for quantum computing and generated quantum computer technologies continue to evolve. On the other hand, machine learning has become an essential method for solving many problems such as computer vision, natural language processing, prediction and classification. Quantum machine learning is a new field developed by combining the advantages of these two primary methods. As a hybrid approach to quantum and classical computing, variational quantum circuits are a form of machine learning that allows predicting an output value against input variables. In this study, the effects of superposition and entanglement on weather forecasting, were investigated using a variational quantum circuit model when the dataset size is small. The use of the entanglement layer between the variational layers has made significant improvements on the circuit performance. The use of the superposition layer before the data encoding layer resulted in the use of less variational layers.
{"title":"The effect of superposition and entanglement on hybrid quantum machine learning for weather forecasting","authors":"Besir Ogur, I. Yilmaz","doi":"10.26421/qic23.3-4-1","DOIUrl":"https://doi.org/10.26421/qic23.3-4-1","url":null,"abstract":"Recently, proposed algorithms for quantum computing and generated quantum computer technologies continue to evolve. On the other hand, machine learning has become an essential method for solving many problems such as computer vision, natural language processing, prediction and classification. Quantum machine learning is a new field developed by combining the advantages of these two primary methods. As a hybrid approach to quantum and classical computing, variational quantum circuits are a form of machine learning that allows predicting an output value against input variables. In this study, the effects of superposition and entanglement on weather forecasting, were investigated using a variational quantum circuit model when the dataset size is small. The use of the entanglement layer between the variational layers has made significant improvements on the circuit performance. The use of the superposition layer before the data encoding layer resulted in the use of less variational layers.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"154 1","pages":"181-194"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79701533","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}
Secure multiparty quantum computation is an important and essential paradigm of quantum computing. All the existing aggregating protocols are $(n, n)$ threshold approaches, where $n$ represents the total number of players. If one player is dishonest, the aggregation protocols cannot aggregate efficiently. In this paper, we propose a $(t, n)$ threshold-based aggregating protocol, where $t$ represents the threshold number of players. This protocol uses Shamir's secret sharing, quantum state, SUM gate, quantum Fourier transform, blind matrix, and Pauli operator. This protocol can perform the aggregation securely and efficiently. In this protocol, we simulate this aggregating protocol using the IBM quantum processor to verify the correctness and feasibility.
{"title":"Secure multiparty quantum aggregating protocol","authors":"Kartick Sutradhar","doi":"10.26421/qic23.3-4-4","DOIUrl":"https://doi.org/10.26421/qic23.3-4-4","url":null,"abstract":"Secure multiparty quantum computation is an important and essential paradigm of quantum computing. All the existing aggregating protocols are $(n, n)$ threshold approaches, where $n$ represents the total number of players. If one player is dishonest, the aggregation protocols cannot aggregate efficiently. In this paper, we propose a $(t, n)$ threshold-based aggregating protocol, where $t$ represents the threshold number of players. This protocol uses Shamir's secret sharing, quantum state, SUM gate, quantum Fourier transform, blind matrix, and Pauli operator. This protocol can perform the aggregation securely and efficiently. In this protocol, we simulate this aggregating protocol using the IBM quantum processor to verify the correctness and feasibility.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"1 1","pages":"245-256"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87886843","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}
The Exclusive-OR Sum-of-Product (ESOP) minimization problem has long been of interest to the research community because of its importance in classical logic design (including low-power design and design for test), reversible logic synthesis, and knowledge discovery, among other applications. However, no exact minimal minimization method has been presented for more than seven variables on arbitrary functions. This paper presents a novel quantum-classical hybrid algorithm for the exact minimal ESOP minimization of incompletely specified Boolean functions. This algorithm constructs oracles from sets of constraints and leverages the quantum speedup offered by Grover's algorithm to find solutions to these oracles, thereby improving over classical algorithms. Improved encoding of ESOP expressions results in substantially fewer decision variables compared to many existing algorithms for many classes of Boolean functions. This paper also extends the idea of exact minimal ESOP minimization to additionally minimize the cost of realizing an ESOP expression as a quantum circuit. To the extent of the authors' knowledge, such a method has never been published. This algorithm was tested on completely and incompletely specified Boolean functions via quantum simulation.
{"title":"ESOP minimization","authors":"Hrithik Ketineni, Marek Perkowski doi","doi":"10.26421/qic23.3-4-2","DOIUrl":"https://doi.org/10.26421/qic23.3-4-2","url":null,"abstract":"The Exclusive-OR Sum-of-Product (ESOP) minimization problem has long been of interest to the research community because of its importance in classical logic design (including low-power design and design for test), reversible logic synthesis, and knowledge discovery, among other applications. However, no exact minimal minimization method has been presented for more than seven variables on arbitrary functions. This paper presents a novel quantum-classical hybrid algorithm for the exact minimal ESOP minimization of incompletely specified Boolean functions. This algorithm constructs oracles from sets of constraints and leverages the quantum speedup offered by Grover's algorithm to find solutions to these oracles, thereby improving over classical algorithms. Improved encoding of ESOP expressions results in substantially fewer decision variables compared to many existing algorithms for many classes of Boolean functions. This paper also extends the idea of exact minimal ESOP minimization to additionally minimize the cost of realizing an ESOP expression as a quantum circuit. To the extent of the authors' knowledge, such a method has never been published. This algorithm was tested on completely and incompletely specified Boolean functions via quantum simulation.","PeriodicalId":20904,"journal":{"name":"Quantum Inf. Comput.","volume":"23 1","pages":"195-222"},"PeriodicalIF":0.0,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81201957","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
扫码关注我们
求助内容：
应助结果提醒方式：