{"title":"Improving Probabilistic Error Cancellation in the Presence of Nonstationary Noise","authors":"Samudra Dasgupta;Travis S. Humble","doi":"10.1109/TQE.2024.3435757","DOIUrl":"https://doi.org/10.1109/TQE.2024.3435757","url":null,"abstract":"In this article, we investigate the stability of probabilistic error cancellation (PEC) outcomes in the presence of nonstationary noise, which is an obstacle to achieving accurate observable estimates. Leveraging Bayesian methods, we design a strategy to enhance PEC stability and accuracy. Our experiments using a five-qubit implementation of the Bernstein–Vazirani algorithm and conducted on the ibm_kolkata device reveal a 42% improvement in accuracy and a 60% enhancement in stability compared to nonadaptive PEC. These results underscore the importance of adaptive estimation processes to effectively address nonstationary noise, vital for advancing PEC utility.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10645687","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142117896","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":"Quantum Circuit for Imputation of Missing Data","authors":"Claudio Sanavio;Simone Tibaldi;Edoardo Tignone;Elisa Ercolessi","doi":"10.1109/TQE.2024.3447875","DOIUrl":"https://doi.org/10.1109/TQE.2024.3447875","url":null,"abstract":"The imputation of missing data is a common procedure in data analysis that consists in predicting missing values of incomplete data points. In this work, we analyze a variational quantum circuit for the imputation of missing data. We construct variational quantum circuits with gates complexity \u0000<inline-formula><tex-math>$mathcal {O}(N)$</tex-math></inline-formula>\u0000 and \u0000<inline-formula><tex-math>$mathcal {O}(N^{2})$</tex-math></inline-formula>\u0000 that return the last missing bit of a binary string for a specific distribution. We train and test the performance of the algorithms on a series of datasets finding good convergence of the results. Finally, we test the circuit for generalization to unseen data. For simple systems, we are able to describe the circuit analytically, making it possible to skip the tedious and unresolved problem of training the circuit with repetitive measurements. We find beforehand the optimal values of the parameters and make use of them to construct an optimal circuit suited to the generation of truly random data.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10643709","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142368559","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}
Fabian Hader;Sarah Fleitmann;Jan Vogelbruch;Lotte Geck;Stefan van Waasen
{"title":"Simulation of Charge Stability Diagrams for Automated Tuning Solutions (SimCATS)","authors":"Fabian Hader;Sarah Fleitmann;Jan Vogelbruch;Lotte Geck;Stefan van Waasen","doi":"10.1109/TQE.2024.3445967","DOIUrl":"https://doi.org/10.1109/TQE.2024.3445967","url":null,"abstract":"Quantum dots (QDs) must be tuned precisely to provide a suitable basis for quantum computation. A scalable platform for quantum computing can only be achieved by fully automating the tuning process. One crucial step is to trap the appropriate number of electrons in the QDs, typically accomplished by analyzing charge stability diagrams (CSDs). Training and testing automation algorithms require large amounts of data, which can be either measured and manually labeled in an experiment or simulated. This article introduces a new approach to the realistic simulation of such measurements. Our flexible framework enables the simulation of ideal CSD data complemented with appropriate sensor responses and distortions. We suggest using this simulation to benchmark published algorithms. Also, we encourage the extension by custom models and parameter sets to drive the development of robust technology-independent algorithms.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10640289","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142165056","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":"Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms","authors":"Jonathan Wurtz;Stefan H. Sack;Sheng-Tao Wang","doi":"10.1109/TQE.2024.3443660","DOIUrl":"https://doi.org/10.1109/TQE.2024.3443660","url":null,"abstract":"Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quantum circuits, adiabatic protocols, and quantum annealing. These solutions typically have several challenges: 1) there is little to no performance gain over classical methods; 2) not all constraints and objectives may be efficiently encoded in the quantum ansatz; and 3) the solution domain of the objective function may not be the same as the bit strings of measurement outcomes. This work presents “nonnative hybrid algorithms”: a framework to overcome these challenges by integrating quantum and classical resources with a hybrid approach. By designing nonnative quantum variational anosatzes that inherit some but not all problem structure, measurement outcomes from the quantum computer can act as a resource to be used by classical routines to indirectly compute optimal solutions, partially overcoming the challenges of contemporary quantum optimization approaches. These methods are demonstrated using a publicly available neutral-atom quantum computer on two simple problems of Max \u0000<inline-formula><tex-math>$k$</tex-math></inline-formula>\u0000-Cut and maximum independent set. We find improvements in solution quality when comparing the hybrid algorithm to its “no quantum” version, a demonstration of a “comparative advantage.”","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10636813","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447172","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}
John D. Malcolm;Alexander Roth;Mladjan Radic;Pablo Martín-Ramiro;Jon Oillarburu;Borja Aizpurua;Román Orús;Samuel Mugel
{"title":"Multidisk Clutch Optimization Using Quantum Annealing","authors":"John D. Malcolm;Alexander Roth;Mladjan Radic;Pablo Martín-Ramiro;Jon Oillarburu;Borja Aizpurua;Román Orús;Samuel Mugel","doi":"10.1109/TQE.2024.3441229","DOIUrl":"https://doi.org/10.1109/TQE.2024.3441229","url":null,"abstract":"In this article, we apply a quantum optimization algorithm to solve a combinatorial problem with significant practical relevance occurring in clutch manufacturing. It is demonstrated how quantum optimization can play a role in real industrial applications in the manufacturing sector. Using the quantum annealer provided by D-Wave Systems, we analyze the performance of the quantum and quantum–classical hybrid solvers and compare them to deterministic- and random-algorithm classical benchmark solvers. The continued evolution of the quantum technology, indicating an expectation for even greater relevance in the future, is discussed, and the revolutionary potential it could have in the manufacturing sector is highlighted.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10632778","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230840","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":"Fault-Tolerant One-Way Noiseless Amplification for Microwave Bosonic Quantum Information Processing","authors":"Hany Khalifa;Riku Jäntti;Gheorghe Sorin Paraoanu","doi":"10.1109/TQE.2024.3440192","DOIUrl":"https://doi.org/10.1109/TQE.2024.3440192","url":null,"abstract":"Microwave quantum information networks require reliable transmission of single-photon propagating modes over lossy channels. In this article, we propose a microwave noiseless linear amplifier (NLA) suitable to circumvent the losses incurred by a flying photon undergoing an amplitude damping channel (ADC). The proposed model is constructed by engineering a simple 1-D four-node cluster state. Contrary to conventional NLAs based on quantum scissors (QS), single-photon amplification is realized without the need for photon number resolving detectors. Entanglement between nodes comprising the device's cluster is achieved by means of a controlled phase gate. Furthermore, photon measurements are implemented by quantum nondemolition detectors, which are currently available as a part of the circuit quantum electrodynamics toolbox. We analyze the performance of our device practically by considering detection inefficiency and dark count probability. We further examine the potential usage of our device in low-power quantum sensing applications and remote secret key generation (SKG). Specifically, we demonstrate the device's ability to prepare loss-free resources offline, and its capacity to overcome the repeaterless bound of SKG. We compare the performance of our device against a QS-NLA for the aforementioned applications, and highlight explicitly the operating conditions under which our device can outperform a QS-NLA. The proposed device is also suitable for applications in the optical domain.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10629178","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142143741","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}
Kentaro Tamura;Yohichi Suzuki;Rudy Raymond;Hiroshi C. Watanabe;Yuki Sato;Ruho Kondo;Michihiko Sugawara;Naoki Yamamoto
{"title":"Noise Robustness of Quantum Relaxation for Combinatorial Optimization","authors":"Kentaro Tamura;Yohichi Suzuki;Rudy Raymond;Hiroshi C. Watanabe;Yuki Sato;Ruho Kondo;Michihiko Sugawara;Naoki Yamamoto","doi":"10.1109/TQE.2024.3439135","DOIUrl":"https://doi.org/10.1109/TQE.2024.3439135","url":null,"abstract":"Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple variables per qubit using quantum random-access code (QRAC). Reducing the number of qubits will alleviate physical noise (typically, decoherence), and as a result, the quality of the binary solution of QRAO may be robust against noise, which is, however, unknown. In this article, we numerically demonstrate that the mean approximation ratio of the (3, 1)-QRAC Hamiltonian, i.e., the Hamiltonian utilizing the encoding of three bits into one qubit by QRAC, is less affected by noise compared with the conventional Ising Hamiltonian used in the quantum annealer and the quantum approximate optimization algorithm. Based on this observation, we discuss a plausible mechanism behind the robustness of QRAO under depolarizing noise. Finally, we assess the number of shots required to estimate the values of binary variables correctly under depolarizing noise and show that the (3, 1)-QRAC Hamiltonian requires less shots to achieve the same accuracy compared with the Ising Hamiltonian.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2024-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10623712","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142117786","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":"Resource Placement for Rate and Fidelity Maximization in Quantum Networks","authors":"Shahrooz Pouryousef;Hassan Shapourian;Alireza Shabani;Ramana Kompella;Don Towsley","doi":"10.1109/TQE.2024.3432390","DOIUrl":"https://doi.org/10.1109/TQE.2024.3432390","url":null,"abstract":"Existing classical optical network infrastructure cannot be immediately used for quantum network applications due to photon loss. The first step toward enabling quantum networks is the integration of quantum repeaters into optical networks. However, the expenses and intrinsic noise inherent in quantum hardware underscore the need for an efficient deployment strategy that optimizes the placement of quantum repeaters and memories. In this article, we present a comprehensive framework for network planning, aiming to efficiently distribute quantum repeaters across existing infrastructure, with the objective of maximizing quantum network utility within an entanglement distribution network. We apply our framework to several cases including a preliminary illustration of a dumbbell network topology and real-world cases of the SURFnet and ESnet. We explore the effect of quantum memory multiplexing within quantum repeaters, as well as the influence of memory coherence time on quantum network utility. We further examine the effects of different fairness assumptions on network planning, uncovering their impacts on real-time network performance.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10607917","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142045247","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":"Superconducting Nanostrip Photon-Number-Resolving Detector as an Unbiased Random Number Generator","authors":"Pasquale Ercolano;Mikkel Ejrnaes;Ciro Bruscino;Syed Muhammad Junaid Bukhari;Daniela Salvoni;Chengjun Zhang;Jia Huang;Hao Li;Lixing You;Loredana Parlato;Giovanni Piero Pepe","doi":"10.1109/TQE.2024.3432070","DOIUrl":"https://doi.org/10.1109/TQE.2024.3432070","url":null,"abstract":"Detectors capable of resolving the number of photons are essential in many applications, ranging from classic photonics to quantum optics and quantum communication. In particular, photon-number-resolving detectors based on arrays of superconducting nanostrips can offer a high detection efficiency, a low dark count rate, and a recovery time of a few nanoseconds. In this work, we use a detector of this kind for the unbiased generation of random numbers by following two different methods based on the detection of photons. In the former, we exploit the property that the light is equally distributed on each strip of the entire detector, whereas in the latter, we exploit the fact that, for a high average number of photons, the parity of the Poisson distribution of the number of photons emitted by the laser tends to be zero. In addition, since these two methods are independent, it is possible to use them at the same time.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10606064","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141993932","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}
Daniel Hothem;Kevin Young;Tommie Catanach;Timothy Proctor
{"title":"Learning a Quantum Computer's Capability","authors":"Daniel Hothem;Kevin Young;Tommie Catanach;Timothy Proctor","doi":"10.1109/TQE.2024.3430215","DOIUrl":"https://doi.org/10.1109/TQE.2024.3430215","url":null,"abstract":"Accurately predicting a quantum computer's capability—which circuits it can run and how well it can run them—is a foundational goal of quantum characterization and benchmarking. As modern quantum computers become increasingly hard to simulate, we must develop accurate and scalable predictive capability models to help researchers and stakeholders decide which quantum computers to build and use. In this work, we propose a hardware-agnostic method to efficiently construct scalable predictive models of a quantum computer's capability for almost any class of circuits and demonstrate our method using convolutional neural networks (CNNs). Our CNN-based approach works by efficiently representing a circuit as a 3-D tensor and then using a CNN to predict its success rate. Our CNN capability models obtain approximately a 1% average absolute prediction error when modeling processors experiencing both Markovian and non-Markovian stochastic Pauli errors. We also apply our CNNs to model the capabilities of cloud-access quantum computing systems, obtaining moderate prediction accuracy (average absolute error around 2–5%), and we highlight the challenges to building better neural network capability models.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-26"},"PeriodicalIF":0.0,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10603420","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142090791","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}