IEEE Transactions on Quantum Engineering最新文献_第10页

Private Product Computation Using Quantum Entanglement 利用量子纠缠计算私有产品

IEEE Transactions on Quantum Engineering Pub Date : 2023-09-27 DOI: 10.1109/TQE.2023.3320052

René Bødker Christensen;Petar Popovski

引用次数: 2

Hybrid Quantum–Classical Generative Adversarial Network for High-Resolution Image Generation 高分辨率图像生成的混合量子经典生成对抗网络

IEEE Transactions on Quantum Engineering Pub Date : 2023-09-26 DOI: 10.1109/TQE.2023.3319319

Shu Lok Tsang;Maxwell T. West;Sarah M. Erfani;Muhammad Usman

{"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}

引用次数: 5

Shor's Algorithm Using Efficient Approximate Quantum Fourier Transform 基于高效近似量子傅里叶变换的Shor算法

IEEE Transactions on Quantum Engineering Pub Date : 2023-09-25 DOI: 10.1109/TQE.2023.3319044

Kento Oonishi;Noboru Kunihiro

引用次数: 0

Time Binning Method for Nonpulsed Sources Characterization With a Superconducting Photon Number Resolving Detector 用超导光子数分辨探测器表征非脉冲源的时间分束方法

IEEE Transactions on Quantum Engineering Pub Date : 2023-09-19 DOI: 10.1109/TQE.2023.3316797

Pasquale Ercolano;Ciro Bruscino;Daniela Salvoni;Chengjun Zhang;Mikkel Ejrnaes;Jia Huang;Hao Li;Lixing You;Loredana Parlato;Giovanni Piero Pepe

{"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}

引用次数: 0

Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing (May 2023) 接近NISQ和量子启发计算的附带优化(2023年5月)

IEEE Transactions on Quantum Engineering Pub Date : 2023-09-13 DOI: 10.1109/TQE.2023.3314839

Megan C. Giron;Georgios Korpas;Waqas Parvaiz;Prashant Malik;Johannes Aspman

{"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}

引用次数: 1

Improving Urban Traffic Mobility via a Versatile Quantum Annealing Model 利用通用量子退火模型改善城市交通机动性

IEEE Transactions on Quantum Engineering Pub Date : 2023-09-05 DOI: 10.1109/TQE.2023.3312284

Andrea Marchesin;Bartolomeo Montrucchio;Mariagrazia Graziano;Andrea Boella;Giovanni Mondo

{"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}

引用次数: 0

Advantage of the Key Relay Protocol Over Secure Network Coding 密钥中继协议相对于安全网络编码的优势

IEEE Transactions on Quantum Engineering Pub Date : 2023-08-28 DOI: 10.1109/TQE.2023.3309590

Go Kato;Mikio Fujiwara;Toyohiro Tsurumaru

引用次数: 0

Testing Platform-Independent Quantum Error Mitigation on Noisy Quantum Computers 噪声量子计算机上与平台无关的量子误差缓解测试

IEEE Transactions on Quantum Engineering Pub Date : 2023-08-15 DOI: 10.1109/TQE.2023.3305232

Vincent Russo;Andrea Mari;Nathan Shammah;Ryan LaRose;William J. Zeng

引用次数: 13

A Modular Quantum Compilation Framework for Distributed Quantum Computing 面向分布式量子计算的模块化量子编译框架

IEEE Transactions on Quantum Engineering Pub Date : 2023-08-10 DOI: 10.1109/TQE.2023.3303935

Davide Ferrari;Stefano Carretta;Michele Amoretti

{"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}

引用次数: 3

Analysis of the Vehicle Routing Problem Solved via Hybrid Quantum Algorithms in the Presence of Noisy Channels 噪声信道下混合量子算法求解车辆路径问题的分析

IEEE Transactions on Quantum Engineering Pub Date : 2023-08-10 DOI: 10.1109/TQE.2023.3303989

Nishikanta Mohanty;Bikash K. Behera;Christopher Ferrie

{"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}

引用次数: 6