Pub Date : 2025-02-11DOI: 10.1109/TQE.2025.3541123
Amar Abane;Michael Cubeddu;Van Sy Mai;Abdella Battou
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, and hybrid routing.
{"title":"Entanglement Routing in Quantum Networks: A Comprehensive Survey","authors":"Amar Abane;Michael Cubeddu;Van Sy Mai;Abdella Battou","doi":"10.1109/TQE.2025.3541123","DOIUrl":"https://doi.org/10.1109/TQE.2025.3541123","url":null,"abstract":"Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, and hybrid routing.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-39"},"PeriodicalIF":0.0,"publicationDate":"2025-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10882978","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143570564","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 : 2025-02-05DOI: 10.1109/TQE.2025.3538934
Mark A. Webster;Dan E. Browne
Quantum error correction and the use of quantum error correction codes are likely to be essential for the realization of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes that are tailored for a particular error model may have much better performance. In this work, we present a novel evolutionary algorithm that searches for an optimal stabilizer code for a given error model, number of physical qubits, and number of encoded qubits. We demonstrate an efficient representation of stabilizer codes as binary strings, which allows for random generation of valid stabilizer codes as well as mutation and crossing of codes. Our algorithm finds stabilizer codes whose distance closely matches the best-known-distance codes of Grassl (2007) for $n leq 20$ physical qubits. We perform a search for optimal distance Calderbank–Steane–Shor codes and compare their distance to the best known codes. Finally, we show that the algorithm can be used to optimize stabilizer codes for biased error models, demonstrating a significant improvement in the undetectable error rate for $[[12,1]]_{2}$ codes versus the best-known-distance code with the same parameters. As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.
{"title":"Engineering Quantum Error Correction Codes Using Evolutionary Algorithms","authors":"Mark A. Webster;Dan E. Browne","doi":"10.1109/TQE.2025.3538934","DOIUrl":"https://doi.org/10.1109/TQE.2025.3538934","url":null,"abstract":"Quantum error correction and the use of quantum error correction codes are likely to be essential for the realization of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes that are tailored for a particular error model may have much better performance. In this work, we present a novel evolutionary algorithm that searches for an optimal stabilizer code for a given error model, number of physical qubits, and number of encoded qubits. We demonstrate an efficient representation of stabilizer codes as binary strings, which allows for random generation of valid stabilizer codes as well as mutation and crossing of codes. Our algorithm finds stabilizer codes whose distance closely matches the best-known-distance codes of Grassl (2007) for <inline-formula><tex-math>$n leq 20$</tex-math></inline-formula> physical qubits. We perform a search for optimal distance Calderbank–Steane–Shor codes and compare their distance to the best known codes. Finally, we show that the algorithm can be used to optimize stabilizer codes for biased error models, demonstrating a significant improvement in the undetectable error rate for <inline-formula><tex-math>$[[12,1]]_{2}$</tex-math></inline-formula> codes versus the best-known-distance code with the same parameters. As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10874169","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143564005","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 : 2025-01-29DOI: 10.1109/TQE.2025.3535823
Alessio Di Santo;Walter Tiberti;Dajana Cassioli
Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all the $n$ players calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset of $t$ players, out of the entire set on $n$ players, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.
{"title":"Security and Fairness in Multiparty Quantum Secret Sharing Protocol","authors":"Alessio Di Santo;Walter Tiberti;Dajana Cassioli","doi":"10.1109/TQE.2025.3535823","DOIUrl":"https://doi.org/10.1109/TQE.2025.3535823","url":null,"abstract":"Quantum secret sharing (QSS) is a cryptographic protocol that leverages quantum mechanics to distribute a secret among multiple parties. With respect to the classical counterpart, in QSS, the secret is encoded into quantum states and shared by a dealer such that only an authorized subsets of participants, i.e., the players, can reconstruct it. Several state-of-the-art studies aim to transpose classical secret sharing into the quantum realm, while maintaining their reliance on traditional network topologies (e.g., star, ring, and fully connected), and require that all the <inline-formula><tex-math>$n$</tex-math></inline-formula> players calculate the secret. These studies exploit the Greenberger–Horne–Zeilinger state, which is a type of maximally entangled quantum state involving three or more qubits. However, none of these works account for redundancy, enhanced security/privacy features, or authentication mechanisms able to fingerprint players. To address these gaps, in this article, we introduce a new concept of QSS, which leans on a generic distributed quantum network, based on a threshold scheme, where all the players collaborate also to the routing of quantum information among them. The dealer, by exploiting a custom flexible weighting system, takes advantage of a newly defined quantum Dijkstra algorithm to select the most suitable subset of <inline-formula><tex-math>$t$</tex-math></inline-formula> players, out of the entire set on <inline-formula><tex-math>$n$</tex-math></inline-formula> players, to involve in the computation. To fingerprint and authenticate users, CRYSTAL-Kyber primitives are adopted, while also protecting each player’s privacy by hiding their identities. We show the effectiveness and performance of the proposed protocol by testing it against the main classical and quantum attacks, thereby improving the state-of-the-art security measures.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2025-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10857623","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143521454","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 : 2025-01-28DOI: 10.1109/TQE.2025.3535319
{"title":"2024 Index IEEE Transactions on Quantum Engineering Vol. 5","authors":"","doi":"10.1109/TQE.2025.3535319","DOIUrl":"https://doi.org/10.1109/TQE.2025.3535319","url":null,"abstract":"","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10856694","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106065","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 : 2025-01-20DOI: 10.1109/TQE.2025.3532017
Niclas Schillo;Andreas Sturm
The role of differential equations (DEs) in science and engineering is of paramount importance, as they provide the mathematical framework for a multitude of natural phenomena. Since quantum computers promise significant advantages over classical computers, quantum algorithms for the solution of DEs have received a lot of attention. Particularly interesting are algorithms that offer advantages in the current noisy intermediate-scale quantum (NISQ) era, characterized by small and error-prone systems. We consider a framework of variational quantum algorithms, quantum circuit learning (QCL), in conjunction with derivation methods, in particular the parameter shift rule, to solve DEs. As these algorithms were specifically designed for NISQ computers, we analyze their applicability on NISQ devices by implementing QCL on an IBM quantum computer. Our analysis of QCL without the parameter shift rule shows that we can successfully learn different functions with three-qubit circuits. However, the hardware errors accumulate with increasing number of qubits, and thus, only a fraction of the qubits available on the current quantum systems can be effectively used. We further show that it is possible to determine derivatives of the learned functions using the parameter shift rule on the IBM hardware. The parameter shift rule results in higher errors, which limits its execution to low-order derivatives. Despite these limitations, we solve a first-order DE on the IBM quantum computer. We further explore the advantages of using multiple qubits in QCL by learning different functions simultaneously and demonstrate the solution of a coupled DE on a simulator.
{"title":"Variational Quantum Algorithms for Differential Equations on a Noisy Quantum Computer","authors":"Niclas Schillo;Andreas Sturm","doi":"10.1109/TQE.2025.3532017","DOIUrl":"https://doi.org/10.1109/TQE.2025.3532017","url":null,"abstract":"The role of differential equations (DEs) in science and engineering is of paramount importance, as they provide the mathematical framework for a multitude of natural phenomena. Since quantum computers promise significant advantages over classical computers, quantum algorithms for the solution of DEs have received a lot of attention. Particularly interesting are algorithms that offer advantages in the current noisy intermediate-scale quantum (NISQ) era, characterized by small and error-prone systems. We consider a framework of variational quantum algorithms, quantum circuit learning (QCL), in conjunction with derivation methods, in particular the parameter shift rule, to solve DEs. As these algorithms were specifically designed for NISQ computers, we analyze their applicability on NISQ devices by implementing QCL on an IBM quantum computer. Our analysis of QCL without the parameter shift rule shows that we can successfully learn different functions with three-qubit circuits. However, the hardware errors accumulate with increasing number of qubits, and thus, only a fraction of the qubits available on the current quantum systems can be effectively used. We further show that it is possible to determine derivatives of the learned functions using the parameter shift rule on the IBM hardware. The parameter shift rule results in higher errors, which limits its execution to low-order derivatives. Despite these limitations, we solve a first-order DE on the IBM quantum computer. We further explore the advantages of using multiple qubits in QCL by learning different functions simultaneously and demonstrate the solution of a coupled DE on a simulator.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10848114","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143455234","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 : 2025-01-17DOI: 10.1109/TQE.2025.3530939
Ryutaroh Matsumoto
In some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the ramp quantum secret sharing schemes with the highest coding rate. This article proposes procedures to distribute some shares before a secret is given in those schemes. The new procedures enhance the applicability of the secret sharing schemes to wider scenarios as some participants can be unavailable when the dealer obtains the quantum secret. Then, it is proved that our new encoding procedures retain the correspondences between quantum secrets and quantum shares in the original schemes, which ensures that the highest coding rates of the original schemes are also retained.
{"title":"Advance Sharing Procedures for the Ramp Quantum Secret Sharing Schemes With the Highest Coding Rate","authors":"Ryutaroh Matsumoto","doi":"10.1109/TQE.2025.3530939","DOIUrl":"https://doi.org/10.1109/TQE.2025.3530939","url":null,"abstract":"In some quantum secret sharing schemes, it is known that some shares can be distributed to participants before a secret is given to the dealer. However, it is unclear whether some shares can be distributed before a secret is given in the ramp quantum secret sharing schemes with the highest coding rate. This article proposes procedures to distribute some shares before a secret is given in those schemes. The new procedures enhance the applicability of the secret sharing schemes to wider scenarios as some participants can be unavailable when the dealer obtains the quantum secret. Then, it is proved that our new encoding procedures retain the correspondences between quantum secrets and quantum shares in the original schemes, which ensures that the highest coding rates of the original schemes are also retained.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10844313","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143106173","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 : 2025-01-15DOI: 10.1109/TQE.2025.3529868
Chou-Wei Kiang;Jean-Fu Kiang
Nitrogen-vacancy (NV) ensembles are viable magnetometers to be implemented on nanosatellites for monitoring geomagnetic fluctuations, which are credible precursors for predicting earthquakes at short notice. In this work, a Haar wavelet-based quantum sensing method is proposed to reconstruct the time-varying waveform of geomagnetic fluctuations in the very low frequency band. To collect different frequency components of fluctuations waveform at once, we propose a schematic to employ multiple NV ensembles (NVEs), with each controlled by an independent microwave source. Berry sequences are applied on one set of NVEs to extract the scaling coefficients from accumulated geometric phases to reconstruct near-dc components of a waveform. Spin-echo sequences are applied to another set of NVEs to extract the Haar wavelet coefficients from the dynamic phases to reconstruct high-frequency components. The efficacy of the proposed sensing protocol implemented on multiple NVEs is validated by reconstructing a waveform of geomagnetic fluctuations from a DEMETER satellite dataset through simulations. Each NVE is assumed to contain $N = 10^{8}$ uncorrelated NV centers. The application of a Berry sequence to each NVE can achieve the maximum detectable magnetic field of over $460 mu$T, resolving the issues of phase ambiguity and hyperfine-induced detuning if conventional Ramsey sequence were applied. The feasibility of the proposed simulation scenario considering spin-bath noise within an NVE is justified by simulations. The effects of wavelet scales, Rabi frequency in Berry sequence, and number of NV centers in each NVE are analyzed. The proposed NVE quantum sensors operated with the proposed sensing protocol can be installed on nanosatellites to monitor global geomagnetic fluctuations, with sub-$mu$s temporal resolution in the near future.
{"title":"Wavelet-Based Quantum Sensing of Geomagnetic Fluctuations With Multiple NV Ensembles","authors":"Chou-Wei Kiang;Jean-Fu Kiang","doi":"10.1109/TQE.2025.3529868","DOIUrl":"https://doi.org/10.1109/TQE.2025.3529868","url":null,"abstract":"Nitrogen-vacancy (NV) ensembles are viable magnetometers to be implemented on nanosatellites for monitoring geomagnetic fluctuations, which are credible precursors for predicting earthquakes at short notice. In this work, a Haar wavelet-based quantum sensing method is proposed to reconstruct the time-varying waveform of geomagnetic fluctuations in the very low frequency band. To collect different frequency components of fluctuations waveform at once, we propose a schematic to employ multiple NV ensembles (NVEs), with each controlled by an independent microwave source. Berry sequences are applied on one set of NVEs to extract the scaling coefficients from accumulated geometric phases to reconstruct near-dc components of a waveform. Spin-echo sequences are applied to another set of NVEs to extract the Haar wavelet coefficients from the dynamic phases to reconstruct high-frequency components. The efficacy of the proposed sensing protocol implemented on multiple NVEs is validated by reconstructing a waveform of geomagnetic fluctuations from a DEMETER satellite dataset through simulations. Each NVE is assumed to contain <inline-formula><tex-math>$N = 10^{8}$</tex-math></inline-formula> uncorrelated NV centers. The application of a Berry sequence to each NVE can achieve the maximum detectable magnetic field of over <inline-formula><tex-math>$460 mu$</tex-math></inline-formula>T, resolving the issues of phase ambiguity and hyperfine-induced detuning if conventional Ramsey sequence were applied. The feasibility of the proposed simulation scenario considering spin-bath noise within an NVE is justified by simulations. The effects of wavelet scales, Rabi frequency in Berry sequence, and number of NV centers in each NVE are analyzed. The proposed NVE quantum sensors operated with the proposed sensing protocol can be installed on nanosatellites to monitor global geomagnetic fluctuations, with sub-<inline-formula><tex-math>$mu$</tex-math></inline-formula>s temporal resolution in the near future.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10842356","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480798","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 : 2025-01-10DOI: 10.1109/TQE.2025.3528238
Kristian S. Jensen;Lorenzo Valentini;René B. Christensen;Marco Chiani;Petar Popovski
In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyze this both in an ideal setting with no decoherence and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the NetSquid framework. We compare the simulation results with the theoretical values.
{"title":"Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement","authors":"Kristian S. Jensen;Lorenzo Valentini;René B. Christensen;Marco Chiani;Petar Popovski","doi":"10.1109/TQE.2025.3528238","DOIUrl":"https://doi.org/10.1109/TQE.2025.3528238","url":null,"abstract":"In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyze this both in an ideal setting with no decoherence and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the NetSquid framework. We compare the simulation results with the theoretical values.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10836906","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184116","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 : 2025-01-08DOI: 10.1109/TQE.2025.3527399
Sanjiang Li;Xiangzhen Zhou;Yuan Feng
Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit transformation (QCT) algorithms have been proposed. To enable faithful evaluation of state-of-the-art QCT algorithms, this article introduces qubit mapping benchmark with known near-optimality (QKNOB), a novel benchmark construction method for QCT. QKNOB circuits have built-in transformations with near-optimal (close to the theoretical optimum) swap count and depth overhead. QKNOB provides general and unbiased evaluation of QCT algorithms. Using QKNOB, we demonstrate that SABRE, the default Qiskit compiler, consistently achieves the best performance on the 53-qubit IBM Q Rochester and Google Sycamore devices for both swap count and depth objectives. Our results also reveal significant performance gaps relative to the near-optimal transformation costs of QKNOB. Our construction algorithm and benchmarks are open-source.
{"title":"Benchmarking Quantum Circuit Transformation With QKNOB Circuits","authors":"Sanjiang Li;Xiangzhen Zhou;Yuan Feng","doi":"10.1109/TQE.2025.3527399","DOIUrl":"https://doi.org/10.1109/TQE.2025.3527399","url":null,"abstract":"Current superconducting quantum devices impose strict connectivity constraints on quantum circuit execution, necessitating circuit transformation before executing quantum circuits on physical hardware. Numerous quantum circuit transformation (QCT) algorithms have been proposed. To enable faithful evaluation of state-of-the-art QCT algorithms, this article introduces qubit mapping benchmark with known near-optimality (QKNOB), a novel benchmark construction method for QCT. <monospace>QKNOB</monospace> circuits have built-in transformations with near-optimal (close to the theoretical optimum) <sc>swap</small> count and depth overhead. <monospace>QKNOB</monospace> provides general and unbiased evaluation of QCT algorithms. Using <monospace>QKNOB</monospace>, we demonstrate that <monospace>SABRE</monospace>, the default Qiskit compiler, consistently achieves the best performance on the 53-qubit IBM Q Rochester and Google Sycamore devices for both <sc>swap</small> count and depth objectives. Our results also reveal significant performance gaps relative to the near-optimal transformation costs of <monospace>QKNOB</monospace>. Our construction algorithm and benchmarks are open-source.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2025-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10833714","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184115","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 : 2024-12-30DOI: 10.1109/TQE.2024.3523889
Sounak Kar;Stephanie Wehner
Network utility maximization (NUM) addresses the problem of allocating resources fairly within a network and explores the ways to achieve optimal allocation in real-world networks. Although extensively studied in classical networks, NUM is an emerging area of research in the context of quantum networks. In this work, we consider the quantum network utility maximization (QNUM) problem in a static setting, where a user's utility takes into account the assigned quantum quality (fidelity) via a generic entanglement measure, as well as the corresponding rate of entanglement generation. Under certain assumptions, we demonstrate that the QNUM problem can be formulated as an optimization problem with the rate allocation vector as the only decision variable. Using a change-of-variable technique known in the field of geometric programming, we then establish sufficient conditions under which this formulation can be reduced to a convex problem: a class of optimization problems that can be solved efficiently and with certainty even in high dimensions. We further show that this technique preserves convexity, enabling us to formulate convex QNUM problems in networks where some routes have certain entanglement measures that do not readily admit convex formulation while others do. This allows us to compute the optimal resource allocation in networks where heterogeneous applications run over different routes.
{"title":"Convexification of the Quantum Network Utility Maximization Problem","authors":"Sounak Kar;Stephanie Wehner","doi":"10.1109/TQE.2024.3523889","DOIUrl":"https://doi.org/10.1109/TQE.2024.3523889","url":null,"abstract":"Network utility maximization (NUM) addresses the problem of allocating resources fairly within a network and explores the ways to achieve optimal allocation in real-world networks. Although extensively studied in classical networks, NUM is an emerging area of research in the context of quantum networks. In this work, we consider the quantum network utility maximization (QNUM) problem in a static setting, where a user's utility takes into account the assigned quantum quality (fidelity) via a generic entanglement measure, as well as the corresponding rate of entanglement generation. Under certain assumptions, we demonstrate that the QNUM problem can be formulated as an optimization problem with the rate allocation vector as the only decision variable. Using a change-of-variable technique known in the field of geometric programming, we then establish sufficient conditions under which this formulation can be reduced to a convex problem: a class of optimization problems that can be solved efficiently and with certainty even in high dimensions. We further show that this technique preserves convexity, enabling us to formulate convex QNUM problems in networks where some routes have certain entanglement measures that do not readily admit convex formulation while others do. This allows us to compute the optimal resource allocation in networks where heterogeneous applications run over different routes.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10818525","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143496464","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
扫码关注我们
求助内容：
应助结果提醒方式：