Pub Date : 2023-09-27DOI: 10.1109/TQE.2023.3320052
René Bødker Christensen;Petar Popovski
In this article, we show that a pair of entangled qubits can be used to compute a product privately. More precisely, two participants with a private input from a finite field can perform local operations on a shared, Bell-like quantum state, and when these qubits are later sent to a third participant, the third participant can determine the product of the inputs, but without learning more about the individual inputs. We give a concrete way to realize this product computation for arbitrary finite fields of prime order.
{"title":"Private Product Computation Using Quantum Entanglement","authors":"René Bødker Christensen;Petar Popovski","doi":"10.1109/TQE.2023.3320052","DOIUrl":"https://doi.org/10.1109/TQE.2023.3320052","url":null,"abstract":"In this article, we show that a pair of entangled qubits can be used to compute a product privately. More precisely, two participants with a private input from a finite field can perform local operations on a shared, Bell-like quantum state, and when these qubits are later sent to a third participant, the third participant can determine the product of the inputs, but without learning more about the individual inputs. We give a concrete way to realize this product computation for arbitrary finite fields of prime order.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8924785/9998549/10265118.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49981486","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}
Pub Date : 2023-09-26DOI: 10.1109/TQE.2023.3319319
Shu Lok Tsang;Maxwell T. West;Sarah M. Erfani;Muhammad Usman
Quantum machine learning (QML) has received increasing attention due to its potential to outperform classical machine learning methods in problems, such as classification and identification tasks. A subclass of QML methods is quantum generative adversarial networks (QGANs), which have been studied as a quantum counterpart of classical GANs widely used in image manipulation and generation tasks. The existing work on QGANs is still limited to small-scale proof-of-concept examples based on images with significant downscaling. Here, we integrate classical and quantum techniques to propose a new hybrid quantum–classical GAN framework. We demonstrate its superior learning capabilities over existing quantum techniques by generating $28 times 28$ pixels grayscale images without dimensionality reduction or classical pre/postprocessing on multiple classes of the standard Modified National Institute of Standards and Technology (MNIST) and Fashion MNIST datasets, which achieves comparable results to classical frameworks with three orders of magnitude less trainable generator parameters. To gain further insight into the working of our hybrid approach, we systematically explore the impact of its parameter space by varying the number of qubits, the size of image patches, the number of layers in the generator, the shape of the patches, and the choice of prior distribution. Our results show that increasing the quantum generator size generally improves the learning capability of the network. The developed framework provides a foundation for future design of QGANs with optimal parameter set tailored for complex image generation tasks.
{"title":"Hybrid Quantum–Classical Generative Adversarial Network for High-Resolution Image Generation","authors":"Shu Lok Tsang;Maxwell T. West;Sarah M. Erfani;Muhammad Usman","doi":"10.1109/TQE.2023.3319319","DOIUrl":"https://doi.org/10.1109/TQE.2023.3319319","url":null,"abstract":"Quantum machine learning (QML) has received increasing attention due to its potential to outperform classical machine learning methods in problems, such as classification and identification tasks. A subclass of QML methods is quantum generative adversarial networks (QGANs), which have been studied as a quantum counterpart of classical GANs widely used in image manipulation and generation tasks. The existing work on QGANs is still limited to small-scale proof-of-concept examples based on images with significant downscaling. Here, we integrate classical and quantum techniques to propose a new hybrid quantum–classical GAN framework. We demonstrate its superior learning capabilities over existing quantum techniques by generating \u0000<inline-formula><tex-math>$28 times 28$</tex-math></inline-formula>\u0000 pixels grayscale images without dimensionality reduction or classical pre/postprocessing on multiple classes of the standard Modified National Institute of Standards and Technology (MNIST) and Fashion MNIST datasets, which achieves comparable results to classical frameworks with three orders of magnitude less trainable generator parameters. To gain further insight into the working of our hybrid approach, we systematically explore the impact of its parameter space by varying the number of qubits, the size of image patches, the number of layers in the generator, the shape of the patches, and the choice of prior distribution. Our results show that increasing the quantum generator size generally improves the learning capability of the network. The developed framework provides a foundation for future design of QGANs with optimal parameter set tailored for complex image generation tasks.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-19"},"PeriodicalIF":0.0,"publicationDate":"2023-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10264175","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"109157789","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}
Pub Date : 2023-09-25DOI: 10.1109/TQE.2023.3319044
Kento Oonishi;Noboru Kunihiro
Shor's algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor's algorithm is essential for evaluating the security of currently used public-key cryptosystems because the integer factoring and discrete logarithm problems are crucial for the security of these cryptosystems. In this article, a new approximate quantum Fourier transform is proposed, and it is applied to Rines and Chuang's implementation. The proposed implementation requires one-third the number of $T$ gates of the original. Moreover, it requires one-fourth of the $T$ -depth of the original. Finally, a $T$ -scheduling method for running the circuit with the smallest KQ (where K is the number of logical qubits and Q is the circuit depth) is presented.
{"title":"Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform","authors":"Kento Oonishi;Noboru Kunihiro","doi":"10.1109/TQE.2023.3319044","DOIUrl":"https://doi.org/10.1109/TQE.2023.3319044","url":null,"abstract":"Shor's algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor's algorithm is essential for evaluating the security of currently used public-key cryptosystems because the integer factoring and discrete logarithm problems are crucial for the security of these cryptosystems. In this article, a new approximate quantum Fourier transform is proposed, and it is applied to Rines and Chuang's implementation. The proposed implementation requires one-third the number of \u0000<inline-formula><tex-math>$T$</tex-math></inline-formula>\u0000 gates of the original. Moreover, it requires one-fourth of the \u0000<inline-formula><tex-math>$T$</tex-math></inline-formula>\u0000-depth of the original. Finally, a \u0000<inline-formula><tex-math>$T$</tex-math></inline-formula>\u0000-scheduling method for running the circuit with the smallest KQ (where K is the number of logical qubits and Q is the circuit depth) is presented.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10262370","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"109157792","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}
Photon number resolving detectors find space in many fields, such as quantum optics, boson sampling, and fluorescence spectroscopy. In particular, the reconstruction of the input photon distribution is essential in quantum communications to detect photon-number-splitting attacks. In this work, we discuss the operation configurations of a photon number resolving detector based on superconducting nanostrips at a wavelength of 1550 nm from a temporal point of view. We set a time binning and acquired the number of recorded pulses per bin by means of a time-to-digital converter. We studied the predictions of two theoretical models and compared them to the experimental data in order to analyze their operation regimes depending on the binwidth and to employ them for the reconstruction of the input photon distribution. We applied this method to a continuous-wave laser source, showing that the former can be used for the characterization of nonpulsed light sources, even with a photon emission rate so low that the dark count rate of a superconducting nanostrip is not negligible.
{"title":"Time Binning Method for Nonpulsed Sources Characterization With a Superconducting Photon Number Resolving Detector","authors":"Pasquale Ercolano;Ciro Bruscino;Daniela Salvoni;Chengjun Zhang;Mikkel Ejrnaes;Jia Huang;Hao Li;Lixing You;Loredana Parlato;Giovanni Piero Pepe","doi":"10.1109/TQE.2023.3316797","DOIUrl":"https://doi.org/10.1109/TQE.2023.3316797","url":null,"abstract":"Photon number resolving detectors find space in many fields, such as quantum optics, boson sampling, and fluorescence spectroscopy. In particular, the reconstruction of the input photon distribution is essential in quantum communications to detect photon-number-splitting attacks. In this work, we discuss the operation configurations of a photon number resolving detector based on superconducting nanostrips at a wavelength of 1550 nm from a temporal point of view. We set a time binning and acquired the number of recorded pulses per bin by means of a time-to-digital converter. We studied the predictions of two theoretical models and compared them to the experimental data in order to analyze their operation regimes depending on the binwidth and to employ them for the reconstruction of the input photon distribution. We applied this method to a continuous-wave laser source, showing that the former can be used for the characterization of nonpulsed light sources, even with a photon emission rate so low that the dark count rate of a superconducting nanostrip is not negligible.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10255308","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"109157794","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}
Pub Date : 2023-09-13DOI: 10.1109/TQE.2023.3314839
Megan C. Giron;Georgios Korpas;Waqas Parvaiz;Prashant Malik;Johannes Aspman
Collateral optimization refers to the systematic allocation of financial assets to satisfy obligations or secure transactions while simultaneously minimizing costs and optimizing the usage of available resources. This involves assessing the number of characteristics, such as the cost of funding and quality of the underlying assets to ascertain the optimal collateral quantity to be posted to cover exposure arising from a given transaction or a set of transactions. One of the common objectives is to minimize the cost of collateral required to mitigate the risk associated with a particular transaction or a portfolio of transactions while ensuring sufficient protection for the involved parties. Often, this results in a large-scale combinatorial optimization problem. In this study, we initially present a mixed-integer linear programming formulation for the collateral optimization problem, followed by a quadratic unconstrained binary optimization (QUBO) formulation in order to pave the way toward approaching the problem in a hybrid-quantum and noisy intermediate-scale quantum-ready way. We conduct local computational small-scale tests using various software development kits and discuss the behavior of our formulations as well as the potential for performance enhancements. We find that while the QUBO-based approaches fail to find the global optima in the small-scale experiments, they are reasonably close suggesting their potential for large instances. We further survey the recent literature that proposes alternative ways to attack combinatorial optimization problems suitable for collateral optimization.
{"title":"Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing (May 2023)","authors":"Megan C. Giron;Georgios Korpas;Waqas Parvaiz;Prashant Malik;Johannes Aspman","doi":"10.1109/TQE.2023.3314839","DOIUrl":"https://doi.org/10.1109/TQE.2023.3314839","url":null,"abstract":"Collateral optimization refers to the systematic allocation of financial assets to satisfy obligations or secure transactions while simultaneously minimizing costs and optimizing the usage of available resources. This involves assessing the number of characteristics, such as the cost of funding and quality of the underlying assets to ascertain the optimal collateral quantity to be posted to cover exposure arising from a given transaction or a set of transactions. One of the common objectives is to minimize the cost of collateral required to mitigate the risk associated with a particular transaction or a portfolio of transactions while ensuring sufficient protection for the involved parties. Often, this results in a large-scale combinatorial optimization problem. In this study, we initially present a mixed-integer linear programming formulation for the collateral optimization problem, followed by a quadratic unconstrained binary optimization (QUBO) formulation in order to pave the way toward approaching the problem in a hybrid-quantum and noisy intermediate-scale quantum-ready way. We conduct local computational small-scale tests using various software development kits and discuss the behavior of our formulations as well as the potential for performance enhancements. We find that while the QUBO-based approaches fail to find the global optima in the small-scale experiments, they are reasonably close suggesting their potential for large instances. We further survey the recent literature that proposes alternative ways to attack combinatorial optimization problems suitable for collateral optimization.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8924785/9998549/10250961.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49981477","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}
Pub Date : 2023-09-05DOI: 10.1109/TQE.2023.3312284
Andrea Marchesin;Bartolomeo Montrucchio;Mariagrazia Graziano;Andrea Boella;Giovanni Mondo
The growth of cities and the resulting increase in vehicular traffic pose significant challenges to the environment and citizens' quality of life. To address these challenges, a new algorithm has been proposed that leverages the quantum annealing paradigm and D-wave's machines to optimize the control of traffic lights in cities. The algorithm considers traffic information collected from a wide urban road network to define activation patterns that holistically reduce congestion. An in-depth analysis of the model's behavior has been conducted by varying its main parameters. Robustness tests have been performed on different traffic scenarios, and a thorough discussion on how to configure D-wave's quantum annealers for optimal performance is presented. Comparative tests show that the proposed model outperforms traditional control techniques in several traffic conditions, effectively containing critical congestion situations, reducing their presence, and preventing their formation. The results obtained put in evidence the state of the art of these quantum machines, their actual capabilities in addressing the problem, and opportunities for future applications.
{"title":"Improving Urban Traffic Mobility via a Versatile Quantum Annealing Model","authors":"Andrea Marchesin;Bartolomeo Montrucchio;Mariagrazia Graziano;Andrea Boella;Giovanni Mondo","doi":"10.1109/TQE.2023.3312284","DOIUrl":"https://doi.org/10.1109/TQE.2023.3312284","url":null,"abstract":"The growth of cities and the resulting increase in vehicular traffic pose significant challenges to the environment and citizens' quality of life. To address these challenges, a new algorithm has been proposed that leverages the quantum annealing paradigm and D-wave's machines to optimize the control of traffic lights in cities. The algorithm considers traffic information collected from a wide urban road network to define activation patterns that holistically reduce congestion. An in-depth analysis of the model's behavior has been conducted by varying its main parameters. Robustness tests have been performed on different traffic scenarios, and a thorough discussion on how to configure D-wave's quantum annealers for optimal performance is presented. Comparative tests show that the proposed model outperforms traditional control techniques in several traffic conditions, effectively containing critical congestion situations, reducing their presence, and preventing their formation. The results obtained put in evidence the state of the art of these quantum machines, their actual capabilities in addressing the problem, and opportunities for future applications.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8924785/9998549/10239465.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49981485","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}
Pub Date : 2023-08-28DOI: 10.1109/TQE.2023.3309590
Go Kato;Mikio Fujiwara;Toyohiro Tsurumaru
The key relay protocol (KRP) plays an important role in improving the performance and the security of quantum key distribution networks. On the other hand, there is also an existing research field called secure network coding (SNC), which has similar goal and structure. In this article, we analyze differences and similarities between KRPs in general and key relay using SNC schemes (KRPs-by-SNC) rigorously. We found, rather surprisingly, that there is a definite gap in security between KRPs in general and KRPs-by-SNC; that is, certain KRPs achieve better security than any SNC schemes on the same graph. We also found that this gap can be closed if we generalize the notion of SNC by adding authenticated public channels; that is, KRPs are equivalent to KRPs-by-SNC schemes augmented with authenticated public channels.
{"title":"Advantage of the Key Relay Protocol Over Secure Network Coding","authors":"Go Kato;Mikio Fujiwara;Toyohiro Tsurumaru","doi":"10.1109/TQE.2023.3309590","DOIUrl":"10.1109/TQE.2023.3309590","url":null,"abstract":"The key relay protocol (KRP) plays an important role in improving the performance and the security of quantum key distribution networks. On the other hand, there is also an existing research field called secure network coding (SNC), which has similar goal and structure. In this article, we analyze differences and similarities between KRPs in general and key relay using SNC schemes (KRPs-by-SNC) rigorously. We found, rather surprisingly, that there is a definite gap in security between KRPs in general and KRPs-by-SNC; that is, certain KRPs achieve better security than any SNC schemes on the same graph. We also found that this gap can be closed if we generalize the notion of SNC by adding authenticated public channels; that is, KRPs are equivalent to KRPs-by-SNC schemes augmented with authenticated public channels.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2023-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10233108","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78132138","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}
Pub Date : 2023-08-15DOI: 10.1109/TQE.2023.3305232
Vincent Russo;Andrea Mari;Nathan Shammah;Ryan LaRose;William J. Zeng
We apply quantum error mitigation (QEM) techniques to a variety of benchmark problems and quantum computers to evaluate the performance of QEM in practice. To do so, we define an empirically motivated, resource-normalized metric of the improvement of error mitigation, which we call the improvement factor, and calculate this metric for each experiment we perform. The experiments we perform consist of zero-noise extrapolation and probabilistic error cancellation applied to two benchmark problems run on IBM, IonQ, and Rigetti quantum computers, as well as noisy quantum computer simulators. Our results show that error mitigation is, on average, more beneficial than no error mitigation—even when normalized by the additional resources used—but also emphasize that the performance of QEM depends on the underlying computer.
{"title":"Testing Platform-Independent Quantum Error Mitigation on Noisy Quantum Computers","authors":"Vincent Russo;Andrea Mari;Nathan Shammah;Ryan LaRose;William J. Zeng","doi":"10.1109/TQE.2023.3305232","DOIUrl":"https://doi.org/10.1109/TQE.2023.3305232","url":null,"abstract":"We apply quantum error mitigation (QEM) techniques to a variety of benchmark problems and quantum computers to evaluate the performance of QEM in practice. To do so, we define an empirically motivated, resource-normalized metric of the improvement of error mitigation, which we call the improvement factor, and calculate this metric for each experiment we perform. The experiments we perform consist of zero-noise extrapolation and probabilistic error cancellation applied to two benchmark problems run on IBM, IonQ, and Rigetti quantum computers, as well as noisy quantum computer simulators. Our results show that error mitigation is, on average, more beneficial than no error mitigation—even when normalized by the additional resources used—but also emphasize that the performance of QEM depends on the underlying computer.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2023-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8924785/9998549/10219054.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49981474","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}
Pub Date : 2023-08-10DOI: 10.1109/TQE.2023.3303935
Davide Ferrari;Stefano Carretta;Michele Amoretti
For most practical applications, quantum algorithms require large resources in terms of qubit number, much larger than those available with current noisy intermediate-scale quantum processors. With the network and communication functionalities provided by the quantum Internet, distributed quantum computing (DQC) is considered as a scalable approach for increasing the number of available qubits for computational tasks. For DQC to be effective and efficient, a quantum compiler must find the best partitioning for the quantum algorithm and then perform smart remote operation scheduling to optimize Einstein–Podolsky–Rosen (EPR) pair consumption. At the same time, the quantum compiler should also find the best local transformation for each partition. In this article, we present a modular quantum compilation framework for DQC that takes into account both network and device constraints and characteristics. We implemented and tested a quantum compiler based on the proposed framework with some circuits of interest, such as the VQE and QFT ones, considering different network topologies, with quantum processors characterized by heavy-hexagon coupling maps. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations and tested the impact of using either only TeleGates or both. The evaluation results show that TeleData operations can have a positive impact on the number of consumed EPR pairs, depending on the characteristic of compiled circuit. Meanwhile, choosing a more connected network topology helps reduce the number of layers dedicated to remote operations.
{"title":"A Modular Quantum Compilation Framework for Distributed Quantum Computing","authors":"Davide Ferrari;Stefano Carretta;Michele Amoretti","doi":"10.1109/TQE.2023.3303935","DOIUrl":"https://doi.org/10.1109/TQE.2023.3303935","url":null,"abstract":"For most practical applications, quantum algorithms require large resources in terms of qubit number, much larger than those available with current noisy intermediate-scale quantum processors. With the network and communication functionalities provided by the quantum Internet, distributed quantum computing (DQC) is considered as a scalable approach for increasing the number of available qubits for computational tasks. For DQC to be effective and efficient, a quantum compiler must find the best partitioning for the quantum algorithm and then perform smart remote operation scheduling to optimize Einstein–Podolsky–Rosen (EPR) pair consumption. At the same time, the quantum compiler should also find the best local transformation for each partition. In this article, we present a modular quantum compilation framework for DQC that takes into account both network and device constraints and characteristics. We implemented and tested a quantum compiler based on the proposed framework with some circuits of interest, such as the VQE and QFT ones, considering different network topologies, with quantum processors characterized by heavy-hexagon coupling maps. We also devised a strategy for remote scheduling that can exploit both TeleGate and TeleData operations and tested the impact of using either only TeleGates or both. The evaluation results show that TeleData operations can have a positive impact on the number of consumed EPR pairs, depending on the characteristic of compiled circuit. Meanwhile, choosing a more connected network topology helps reduce the number of layers dedicated to remote operations.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8924785/9998549/10214316.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49981476","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}
Pub Date : 2023-08-10DOI: 10.1109/TQE.2023.3303989
Nishikanta Mohanty;Bikash K. Behera;Christopher Ferrie
The vehicle routing problem (VRP) is an NP-hard optimization problem that has been an interest of research for decades in science and industry. The objective is to plan routes of vehicles to deliver goods to a fixed number of customers with optimal efficiency. Classical tools and methods provide good approximations to reach the optimal global solution. Quantum computing and quantum machine learning provide a new approach to solving combinatorial optimization of problems faster due to inherent speedups of quantum effects. Many solutions of VRP are offered across different quantum computing platforms using hybrid algorithms, such as quantum approximate optimization algorithm and quadratic unconstrained binary optimization. In this work, we build a basic VRP solver for three and four cities using the variational quantum eigensolver on a fixed ansatz. The work is further extended to evaluate the robustness of the solution in several examples of noisy quantum channels. We find that the performance of the quantum algorithm depends heavily on what noise model is used. In general, noise is detrimental, but not equally so among different noise sources.
{"title":"Analysis of the Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in the Presence of Noisy Channels","authors":"Nishikanta Mohanty;Bikash K. Behera;Christopher Ferrie","doi":"10.1109/TQE.2023.3303989","DOIUrl":"https://doi.org/10.1109/TQE.2023.3303989","url":null,"abstract":"The vehicle routing problem (VRP) is an NP-hard optimization problem that has been an interest of research for decades in science and industry. The objective is to plan routes of vehicles to deliver goods to a fixed number of customers with optimal efficiency. Classical tools and methods provide good approximations to reach the optimal global solution. Quantum computing and quantum machine learning provide a new approach to solving combinatorial optimization of problems faster due to inherent speedups of quantum effects. Many solutions of VRP are offered across different quantum computing platforms using hybrid algorithms, such as quantum approximate optimization algorithm and quadratic unconstrained binary optimization. In this work, we build a basic VRP solver for three and four cities using the variational quantum eigensolver on a fixed ansatz. The work is further extended to evaluate the robustness of the solution in several examples of noisy quantum channels. We find that the performance of the quantum algorithm depends heavily on what noise model is used. In general, noise is detrimental, but not equally so among different noise sources.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"4 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/8924785/9998549/10214310.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49989298","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：