IET Quantum Communication最新文献

{"title":"Unconventional reconciliation path for quantum mechanics and general relativity","authors":"Samuel Polopa Yuguru","doi":"10.1049/qtc2.12034","DOIUrl":"https://doi.org/10.1049/qtc2.12034","url":null,"abstract":"<p>Physics in general is successfully governed by quantum mechanics at the microscale and principles of relativity at the macroscale. Any attempts to unify them using conventional methods have somewhat remained elusive for nearly a century up to the present stage. Here, a classical gedanken experiment of electron-wave diffraction of a single slit is intuitively examined for its quantized states. A unidirectional monopole pair (MP) field as quanta of the electric field is pictorially conceptualised into 4D space-time. Its application towards quantum mechanics and general relativity appears consistent with existing knowledge in physics. This considers a multiverse of MP models at a hierarchy of scales. Einsteinian gravity is then defined to be of circular acceleration with angular momentum in time reversal mode to an overarching MP field precessing into forward time. Such descriptions provide a credible intuitive tool for physics applications in general. Its proposed design can be assessed using conventional methods, perhaps in incremental steps and this warrants further investigations.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 2","pages":"99-111"},"PeriodicalIF":0.0,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12034","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137523825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Encoding patterns for quantum algorithms","authors":"Manuela Weigold,&nbsp;Johanna Barzen,&nbsp;Frank Leymann,&nbsp;Marie Salm","doi":"10.1049/qtc2.12032","DOIUrl":"10.1049/qtc2.12032","url":null,"abstract":"<p>As quantum computers are based on the laws of quantum mechanics, they are capable of solving certain problems faster than their classical counterparts. However, quantum algorithms with a theoretical speed-up often assume that data can be loaded efficiently. In general, the runtime complexity of the loading routine depends on (i) the data encoding that defines how the data is represented by the state of the quantum computer and (ii) the data itself. In some cases, loading the data requires at least exponential time that destroys a potential speed-up. And especially for the first generation of devices that are currently available, the resources (qubits and operations) needed to encode the data are limited. In this work, we, therefore, present six patterns that describe how data is handled by quantum computers.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"2 4","pages":"141-152"},"PeriodicalIF":0.0,"publicationDate":"2021-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12032","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125615537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Circuit design for clique problem and its implementation on quantum computer","authors":"Arpita Sanyal Bhaduri,&nbsp;Amit Saha,&nbsp;Banani Saha,&nbsp;Amlan Chakrabarti","doi":"10.1049/qtc2.12029","DOIUrl":"10.1049/qtc2.12029","url":null,"abstract":"<p>Finding cliques in a graph has a wide range of applications due to its pattern matching ability. The <i>k</i>-clique problem, a subset of the clique problem, determines whether or not an arbitrary network has a clique of size <i>k</i>. Modern-day applications include a variation of the <i>k</i>-clique problem that lists all cliques of size <i>k</i>. However, the quantum implementation of such a variation of the <i>k</i>-clique problem has not been addressed yet. In this work, apart from the theoretical solution of such a <i>k</i>-clique problem, practical quantum-gate-based implementation has been addressed using Grover's algorithm. In a classical-quantum hybrid architecture, this approach is extended to build the circuit for the maximum clique problem. Our technique is generalised since the program automatically builds the circuit for any given undirected and unweighted graph and any chosen <i>k</i>. For a small <i>k</i> with regard to a big graph, the proposed solution to addressing the <i>k</i>-clique issue has shown a reduction in qubit cost and circuit depth when compared to the state-of-the-art approach. A framework is also presented for mapping the automated generated circuit for clique problems to quantum devices. Using IBM's Qiskit, an analysis of the experimental results is demonstrated.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"30-49"},"PeriodicalIF":0.0,"publicationDate":"2021-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12029","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129905279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Guest editorial: Selected extended papers from the Quantum Software Architecture Workshop at IEEE International Conference on Software Architecture 2021 (ICSA 2021)","authors":"Johanna Barzen,&nbsp;Sebastian Feld,&nbsp;Frank Leymann,&nbsp;Karoline Wild","doi":"10.1049/qtc2.12031","DOIUrl":"10.1049/qtc2.12031","url":null,"abstract":"&lt;p&gt;At a fast pace, applications of quantum algorithms are being built by industrial and academic users to gain experiences with this quickly evolving technology. The more these endeavours are shifting from an experimental stage towards solving real practical problems, it becomes clear that a systematic approach is needed to develop the corresponding quantum applications. This need is based on the fact that software that involves quantum computers is very different from classical software. Such a systematic approach for building quantum software must especially consider the early phases of the corresponding development process addressing the architecture of quantum software.&lt;/p&gt;&lt;p&gt;Guidelines for successful quantum software architecture are missing and research in this domain has just begun. Questions to be answered include, for example, which architectural style should be followed, or whether there are already established best practices? Real-world quantum software is most often hybrid—that is, a quantum application consists of quantum circuits as well as classical programs. This implies that building a quantum application means having to solve a corresponding integration problem. For decades, such integration problems are addressed by workflow technology, implying a first architectural style for building hybrid quantum software. A quantum circuit that processes data expects this data as quantum states. Such states can be prepared by using any of a multitude of approaches each having pros and cons. The knowledge about these solutions can be presented as patterns, indicating the relevance of architectural pattern languages for hybrid quantum applications.&lt;/p&gt;&lt;p&gt;Running individual circuits is appropriate for initial experiments with quantum algorithms. But when quantum software is used in production, issues such as scalability, availability, or security, for example, appear. Furthermore, it should not be assumed that all quantum software is developed from scratch. Instead, existing applications should be reused as much as possible to accelerate benefitting from potential speedups or enhanced precision of quantum algorithms. For this purpose, methods for re-factoring existing applications, for example, are needed.&lt;/p&gt;&lt;p&gt;The articles in this special issue are partly based on contributions of the &lt;i&gt;1st Workshop on Quantum Software Architecture&lt;/i&gt;. The goal of this workshop was to bring together researchers and practitioners from different areas of quantum computing and (classical) software architecture to help shaping a quantum software community and to discuss problems and solutions for hybrid quantum software like the ones mentioned above.&lt;/p&gt;&lt;p&gt;The workshop also proposed solutions to several questions of a lifecycle for developing hybrid quantum software on how to test implemented quantum software, how to migrate from proof of concepts to productive systems, how to automate the deployment of hybrid quantum software, and how to specify KPIs for mea","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"2 4","pages":"139-140"},"PeriodicalIF":0.0,"publicationDate":"2021-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12031","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82569601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Negative controlled Fredkin gate circuits with mirrors","authors":"Tanay Chattopadhyay","doi":"10.1049/qtc2.12030","DOIUrl":"10.1049/qtc2.12030","url":null,"abstract":"<p>Data loss is a major problem in conventional circuits. But it cannot happen in reversible circuits. So energy dissipation per bit loss does not happen in this circuit. Also, recovery of input data can be possible in this circuit. Negative controlled Fredkin gate (NCF) is a self-invertible reversible gate. It performs SWAP operation if its control input is logic zero. In this paper, a mechanically controlled mirror-based NCF gate is designed, where the operation is based on the movement of mirrors. To move the mirror from its position electrical signal can be used. Optical signals are used in computational operations. Some complex reversible circuits viz. some logical operations (XOR-XNOR, AND-NAND, OR-NOR), DE-MUX/MUX, switching, and data shifting circuits are also shown in this paper. Quantum realization of the circuit was performed. Also, the matrix calculation was done to find out the operation of the circuit. Optical delay, optical cost, quantum delay, and quantum cost of every proposed design were calculated.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"60-71"},"PeriodicalIF":0.0,"publicationDate":"2021-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12030","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131922725","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Classical benchmarking for microwave quantum illumination","authors":"Athena Karsa,&nbsp;Stefano Pirandola","doi":"10.1049/qtc2.12025","DOIUrl":"10.1049/qtc2.12025","url":null,"abstract":"<p>Quantum illumination theoretically promises up to a 6 dB error-exponent advantage in target detection over the best classical protocol. The advantage is maximised by a regime that includes a very high background, which occurs naturally when one considers microwave operation. Such a regime has well-known practical limitations, though it is clear that, theoretically, knowledge of the associated classical benchmark in the microwave is lacking. The requirement of amplifiers for signal detection necessarily renders the optimal classical protocol here different to that which is traditionally used, and only applicable in the optical domain. This work outlines what is the true classical benchmark for the microwave Quantum illumination using coherent states, providing new bounds on error probability and closed formulae for the receiver operating characteristic, for both optimal (based on quantum relative entropy) and homodyne detection schemes. An alternative source generation procedure based on coherent states is also proposed, which demonstrates the potential to make classically optimal performances achievable in optical applications. The same bounds and measures for the performance of such a source are provided, and its potential utility in the future of room temperature quantum detection schemes in the microwave is discussed.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"2 4","pages":"246-257"},"PeriodicalIF":0.0,"publicationDate":"2021-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12025","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126725778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimisation of the routing protocol for quantum wireless Ad Hoc network","authors":"Ling Zhang,&nbsp;Qin Liu","doi":"10.1049/qtc2.12028","DOIUrl":"10.1049/qtc2.12028","url":null,"abstract":"<p>This study addresses the optimisation of on-demand routing protocols for quantum wireless Ad Hoc network. The study improves the route discovery protocol by proposing a ‘reverse synchronisation method’, which means after the route request is completed, the quantum channel establishment process can be carried out simultaneously with the route reply process. This method is better than the general method which builds quantum channels after the forward path establishment, reduces the time and the number of messages for quantum channel establishment, thus improving the efficiency. Accordingly, this study elaborates the specific methods, procedures and related upgrading message formats involved in quantum route discovery, quantum channel establishment and qubit information transmission of on-demand routing protocol for quantum wireless Ad Hoc network.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"5-12"},"PeriodicalIF":0.0,"publicationDate":"2021-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12028","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122534999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Retrieval of exudate-affected retinal image patches using Siamese quantum classical neural network","authors":"Mahua Nandy Pal,&nbsp;Minakshi Banerjee,&nbsp;Ankit Sarkar","doi":"10.1049/qtc2.12026","DOIUrl":"10.1049/qtc2.12026","url":null,"abstract":"<p>Deep neural networks were previously used in the arena of image retrieval. Siamese network architecture is also used for image similarity comparison. Recently, the application of quantum computing in different fields has gained research interest. Researchers are keen to explore the prospect of quantum circuit implementation in terms of supervised learning, resource utilization, and energy-efficient reversible computing. In this study, the authors propose an application of quantum circuit in Siamese architecture and explored its efficiency in the field of exudate-affected retinal image patch retrieval. Quantum computing applied within Siamese network architecture may be effective for image patch characteristic comparison and retrieval work. Although there is a restriction of managing high-dimensional inner product space, the circuit with a limited number of qubits represents exudate-affected retinal image patches and retrieves similar patches from the patch database. Parameterized quantum circuit (PQC) is implemented using a quantum machine learning library on Google Cirq framework. PQC model is composed of classical pre/post-processing and parameterized quantum circuit. System efficiency is evaluated with the most widely used retrieval evaluation metrics: mean average precision (MAP) and mean reciprocal rank (MRR). The system achieved an encouraging and promising result of 98.1336% MAP and 100% MRR. Image pixels are implicitly converted to rectangular grid qubits in this experiment. The experimentation was further extended to IBM Qiskit framework also. In Qiskit, individual pixels are explicitly encoded using novel enhanced quantum representation (NEQR) image encoding algorithm. The probability distributions of both query and database patches are compared through Jeffreys distance to retrieve similar patches.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"85-98"},"PeriodicalIF":0.0,"publicationDate":"2021-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12026","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131192454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Geometry of distributive multiparty entanglement in 4 − qubit hypergraph states","authors":"Ramita Sarkar,&nbsp;Shreya Banerjee,&nbsp;Subhasish Bag,&nbsp;Prasanta K. Panigrahi","doi":"10.1049/qtc2.12027","DOIUrl":"10.1049/qtc2.12027","url":null,"abstract":"<p>A detailed investigation of the multiparty entanglement present in the 4 − qubit quantum hypergraph states is presented, following a measurement-based geometrical approach. Considering a classification of the 4 − party quantum system represented by a mathematical hypergraph based on the connections between its vertices, the genuine 4 − party entanglement present in each bi-partition of the states have been measured. A strong correlation between the connectivity of the vertices of the hypergraphs and the genuine 4 − party entanglement has been found. The equivalence of the genuine 4 − party entanglement present in each bi-partition is shown considering similar connectivity of the vertices. This explicates the cyclic permutation symmetry of the multiparty entanglement present in the 4 − qubit hypergraph states. Physically, one may expect the quantum systems with superposition of many states to behave in this symmetric manner while mapped into a network-type picture, which the authors have quantified, as well as classified in this work.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"72-84"},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12027","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125536082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel quantum algorithm for ant colony optimisation","authors":"Mrityunjay Ghosh,&nbsp;Nivedita Dey,&nbsp;Debdeep Mitra,&nbsp;Amlan Chakrabarti","doi":"10.1049/qtc2.12023","DOIUrl":"10.1049/qtc2.12023","url":null,"abstract":"<p>Ant colony optimisation (ACO) is a commonly used meta-heuristic to solve complex combinatorial optimisation problems like the travelling salesman problem (TSP), vehicle routing problem (VRP) etc. However, classical ACO algorithms provide better optimal solutions but do not reduce computation time overhead to a significant extent. Algorithmic speed-up can be achieved by using parallelism offered by quantum computing. Existing quantum algorithms to solve ACO are either quantum-inspired classical algorithms or hybrid quantum-classical algorithms. Since all these algorithms need the intervention of classical computing, leveraging the true potential of quantum computing on real quantum hardware remains a challenge. This study's main contribution is to propose a fully quantum algorithm to solve ACO, enhancing the quantum information processing toolbox in the fault-tolerant quantum computing (FTQC) era. We have solved the single source single destination (SSSD) shortest-path problem using our proposed adaptive quantum circuit for representing the dynamic pheromone-updating strategy in real IBMQ devices. Our quantum ACO technique can be further used as a quantum ORACLE to solve complex optimisation problems in a fully quantum setup with significant speed up upon the availability of more qubits.</p>","PeriodicalId":100651,"journal":{"name":"IET Quantum Communication","volume":"3 1","pages":"13-29"},"PeriodicalIF":0.0,"publicationDate":"2021-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/qtc2.12023","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131351126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}