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}
Cryogenic quantum computers play a leading role in demonstrating quantum advantage. Given the severe constraints on the cooling capacity in cryogenic environments, thermal design is crucial for the scalability of these computers. The sources of heat dissipation include passive inflow via intertemperature wires and the power consumption of components located in the cryostat, such as wire amplifiers and quantum–classical interfaces. Thus, a critical challenge is to reduce the number of wires by reducing the required intertemperature bandwidth while maintaining minimal additional power consumption in the cryostat. One solution to address this challenge is near-data processing using ultralow-power computational logic within the cryostat. Based on the workload analysis and domain-specific system design focused on variational quantum algorithms (VQAs), we propose the cryogenic counter-based coprocessor for VQAs (C3-VQA) to enhance the design scalability of cryogenic quantum computers under the thermal constraint. The C3-VQA utilizes single-flux-quantum logic, which is an ultralow-power superconducting digital circuit that operates at the 4 K environment. The C3-VQA precomputes a part of the expectation value calculations for VQAs and buffers intermediate values using simple bit operation units and counters in the cryostat, thereby reducing the required intertemperature bandwidth with small additional power consumption. Consequently, the C3-VQA reduces the number of wires, leading to a reduction in the total heat dissipation in the cryostat. Our evaluation shows that the C3-VQA reduces the total heat dissipation at the 4 K stage by 30% and 81% under sequential-shot and parallel-shot execution scenarios, respectively. Furthermore, a case study in quantum chemistry shows that the C3-VQA reduces total heat dissipation by 87% with a 10 000-qubit system.
{"title":"C3-VQA: Cryogenic Counter-Based Coprocessor for Variational Quantum Algorithms","authors":"Yosuke Ueno;Satoshi Imamura;Yuna Tomida;Teruo Tanimoto;Masamitsu Tanaka;Yutaka Tabuchi;Koji Inoue;Hiroshi Nakamura","doi":"10.1109/TQE.2024.3521442","DOIUrl":"https://doi.org/10.1109/TQE.2024.3521442","url":null,"abstract":"Cryogenic quantum computers play a leading role in demonstrating quantum advantage. Given the severe constraints on the cooling capacity in cryogenic environments, thermal design is crucial for the scalability of these computers. The sources of heat dissipation include passive inflow via intertemperature wires and the power consumption of components located in the cryostat, such as wire amplifiers and quantum–classical interfaces. Thus, a critical challenge is to reduce the number of wires by reducing the required intertemperature bandwidth while maintaining minimal additional power consumption in the cryostat. One solution to address this challenge is near-data processing using ultralow-power computational logic within the cryostat. Based on the workload analysis and domain-specific system design focused on variational quantum algorithms (VQAs), we propose the cryogenic counter-based coprocessor for VQAs (C3-VQA) to enhance the design scalability of cryogenic quantum computers under the thermal constraint. The C3-VQA utilizes single-flux-quantum logic, which is an ultralow-power superconducting digital circuit that operates at the 4 K environment. The C3-VQA precomputes a part of the expectation value calculations for VQAs and buffers intermediate values using simple bit operation units and counters in the cryostat, thereby reducing the required intertemperature bandwidth with small additional power consumption. Consequently, the C3-VQA reduces the number of wires, leading to a reduction in the total heat dissipation in the cryostat. Our evaluation shows that the C3-VQA reduces the total heat dissipation at the 4 K stage by 30% and 81% under sequential-shot and parallel-shot execution scenarios, respectively. Furthermore, a case study in quantum chemistry shows that the C3-VQA reduces total heat dissipation by 87% with a 10 000-qubit system.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10812867","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142993763","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-20DOI: 10.1109/TQE.2024.3520805
João Barbosa;Jack C. Brennan;Alessandro Casaburi;M. D. Hutchings;Alex Kirichenko;Oleg Mukhanov;Martin Weides
One of the most important and topical challenges of quantum circuits is their scalability. Rapid single flux quantum (RSFQ) technology is at the forefront of replacing current standard CMOS-based control architectures for a number of applications, including quantum computing and quantum sensor arrays. By condensing the control and readout to single-flux-quantum-based on-chip devices that are directly connected to the quantum systems, it is possible to minimize the total system overhead, improving scalability and integration. In this article, we present a novel RSFQ device that generates multitone digital signals, based on complex pulse train sequences using a circular shift register (CSR) and a comb filter stage. We show that the frequency spectrum of the pulse trains is dependent on a preloaded pattern on the CSR, as well as on the delay line of the comb filter stage. By carefully selecting both the pattern and delay, the desired tones can be isolated and amplified as required. Finally, we propose architectures where this device can be implemented to control and read out arrays of quantum devices, such as qubits and single-photon detectors.
{"title":"RSFQ All-Digital Programmable Multitone Generator for Quantum Applications","authors":"João Barbosa;Jack C. Brennan;Alessandro Casaburi;M. D. Hutchings;Alex Kirichenko;Oleg Mukhanov;Martin Weides","doi":"10.1109/TQE.2024.3520805","DOIUrl":"https://doi.org/10.1109/TQE.2024.3520805","url":null,"abstract":"One of the most important and topical challenges of quantum circuits is their scalability. Rapid single flux quantum (RSFQ) technology is at the forefront of replacing current standard CMOS-based control architectures for a number of applications, including quantum computing and quantum sensor arrays. By condensing the control and readout to single-flux-quantum-based on-chip devices that are directly connected to the quantum systems, it is possible to minimize the total system overhead, improving scalability and integration. In this article, we present a novel RSFQ device that generates multitone digital signals, based on complex pulse train sequences using a circular shift register (CSR) and a comb filter stage. We show that the frequency spectrum of the pulse trains is dependent on a preloaded pattern on the CSR, as well as on the delay line of the comb filter stage. By carefully selecting both the pattern and delay, the desired tones can be isolated and amplified as required. Finally, we propose architectures where this device can be implemented to control and read out arrays of quantum devices, such as qubits and single-photon detectors.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-11"},"PeriodicalIF":0.0,"publicationDate":"2024-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10811769","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142975731","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}
Complementary metal–oxide–semiconductor (CMOS)-based computing promises drastic improvement in performance at extremely low temperatures (e.g., 77 K, 10 K). The field of extremely low temperature CMOS-environment-based computing holds the promise of delivering remarkable enhancements in both performance and power consumption. Static random access memory (SRAM) plays a major role in determining the performance and efficiency of any processor due to its superior performance and density. This work aims to reveal how extremely low temperature operations profoundly impact the existing well-known tradeoffs in SRAM-based memory arrays. To accomplish this, first, we measure and model the 5 nm fin field-effect transistors characteristics over a wide temperature range from 300 K down to 10 K. Next, we develop a framework to perform simulations on the SRAM array by varying the number of rows and columns for examining the influence of leakage current ($I$leak) and parasitic effects of bit line (BL) and word line (WL) on the size and performance of the SRAM array under extremely low temperatures. For a comprehensive analysis, we further investigated the maximum attainable array size, extending our study down to 10 K, utilizing three distinct cell types. With the help of SRAM array simulations, we reveal that the maximum array size at extremely low temperatures is limited by WL parasitics instead of $I$leak, and the performance of the SRAM is governed by BL and WL parasitics. In addition, we elucidate the influence of transistor threshold voltage ($V$TH) engineering on the optimization of the SRAM array at extremely low temperature environments.
{"title":"Novel Trade-offs in 5 nm FinFET SRAM Arrays at Extremely Low Temperatures","authors":"Shivendra Singh Parihar;Girish Pahwa;Baker Mohammad;Yogesh Singh Chauhan;Hussam Amrouch","doi":"10.1109/TQE.2024.3512367","DOIUrl":"https://doi.org/10.1109/TQE.2024.3512367","url":null,"abstract":"Complementary metal–oxide–semiconductor (CMOS)-based computing promises drastic improvement in performance at extremely low temperatures (e.g., 77 K, 10 K). The field of extremely low temperature CMOS-environment-based computing holds the promise of delivering remarkable enhancements in both performance and power consumption. Static random access memory (SRAM) plays a major role in determining the performance and efficiency of any processor due to its superior performance and density. This work aims to reveal how extremely low temperature operations profoundly impact the existing well-known tradeoffs in SRAM-based memory arrays. To accomplish this, first, we measure and model the 5 nm fin field-effect transistors characteristics over a wide temperature range from 300 K down to 10 K. Next, we develop a framework to perform simulations on the SRAM array by varying the number of rows and columns for examining the influence of leakage current (<inline-formula><tex-math>$I$</tex-math></inline-formula><sub>leak</sub>) and parasitic effects of bit line (BL) and word line (WL) on the size and performance of the SRAM array under extremely low temperatures. For a comprehensive analysis, we further investigated the maximum attainable array size, extending our study down to 10 K, utilizing three distinct cell types. With the help of SRAM array simulations, we reveal that the maximum array size at extremely low temperatures is limited by WL parasitics instead of <inline-formula><tex-math>$I$</tex-math></inline-formula><sub>leak</sub>, and the performance of the SRAM is governed by BL and WL parasitics. In addition, we elucidate the influence of transistor threshold voltage (<inline-formula><tex-math>$V$</tex-math></inline-formula><sub>TH</sub>) engineering on the optimization of the SRAM array at extremely low temperature environments.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10778409","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142975730","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-04DOI: 10.1109/TQE.2024.3511419
Yigal Ilin;Itai Arad
In recent years, variational quantum algorithms have gained significant attention due to their adaptability and efficiency on near-term quantum hardware. They have shown potential in a variety of tasks, including linear algebra, search problems, Gibbs, and ground state preparation. Nevertheless, the presence of noise in current day quantum hardware severely limits their performance. In this work, we introduce dissipative variational quantum algorithms (D-VQAs) by incorporating dissipative operations, such as qubit RESET and stochastic gates, as an intrinsic part of a variational quantum circuit. We argue that such dissipative variational algorithms possess some natural resilience to dissipative noise. We demonstrate how such algorithms can prepare Gibbs states over a wide range of quantum many-body Hamiltonians and temperatures, while significantly reducing errors due to both coherent and noncoherent noise. An additional advantage of our approach is that no ancilla qubits are need. Our results highlight the potential of D-VQAs to enhance the robustness and accuracy of variational quantum computations on noisy intermediate-scale quantum (NISQ) devices.
{"title":"Dissipative Variational Quantum Algorithms for Gibbs State Preparation","authors":"Yigal Ilin;Itai Arad","doi":"10.1109/TQE.2024.3511419","DOIUrl":"https://doi.org/10.1109/TQE.2024.3511419","url":null,"abstract":"In recent years, variational quantum algorithms have gained significant attention due to their adaptability and efficiency on near-term quantum hardware. They have shown potential in a variety of tasks, including linear algebra, search problems, Gibbs, and ground state preparation. Nevertheless, the presence of noise in current day quantum hardware severely limits their performance. In this work, we introduce dissipative variational quantum algorithms (D-VQAs) by incorporating dissipative operations, such as qubit RESET and stochastic gates, as an intrinsic part of a variational quantum circuit. We argue that such dissipative variational algorithms possess some natural resilience to dissipative noise. We demonstrate how such algorithms can prepare Gibbs states over a wide range of quantum many-body Hamiltonians and temperatures, while significantly reducing errors due to both coherent and noncoherent noise. An additional advantage of our approach is that no ancilla qubits are need. Our results highlight the potential of D-VQAs to enhance the robustness and accuracy of variational quantum computations on noisy intermediate-scale quantum (NISQ) devices.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2024-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10777530","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142905740","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-11-28DOI: 10.1109/TQE.2024.3509019
Ilora Maity;Junaid ur Rehman;Symeon Chatzinotas
Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.
{"title":"TAQNet: Traffic-Aware Minimum-Cost Quantum Communication Network Planning","authors":"Ilora Maity;Junaid ur Rehman;Symeon Chatzinotas","doi":"10.1109/TQE.2024.3509019","DOIUrl":"https://doi.org/10.1109/TQE.2024.3509019","url":null,"abstract":"Quantum key distribution (QKD) provides a secure method to exchange encrypted information between two parties in a quantum communication infrastructure (QCI). The primary challenge in deploying a QCI is the cost of using optical fibers and trusted repeater nodes (TRNs). Practical systems combine quantum and classical channels on the same fiber to reduce the cost of fibers dedicated to QKD. In such a system with quantum-classical coexistence, the optimal distribution of QKD requests with minimal deployment cost and power usage on the multiplexed links is challenging due to the diverse key rate demands of the requests, number of classical and quantum channels, guard band spacing between classical and quantum channels, and secret key rate of the quantum channels that decreases with distance. To address these challenges, in this work, we propose a Steiner tree-based approach for constructing a QCI that connects all quantum nodes with minimum TRNs. In addition, we propose a genetic algorithm-based solution to optimally distribute the end-to-end QKD requests over the QCI. We also determine feasible optical bypass routes to reduce the overall energy consumption in the network further. The proposed approach reduces the QCI deployment cost by 19.42% compared to the benchmark MST-Baseline. Also, on average, TAQNet with optical bypass achieves 4.69 kbit per Joule more energy efficiency compared to the nonbypass approach.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10771724","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142859137","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
扫码关注我们
求助内容：
应助结果提醒方式：