Pub Date : 2024-08-28DOI: 10.1109/TQE.2024.3450852
Kein Yukiyoshi;Taku Mikuriya;Hyeon Seok Rou;Giuseppe Thadeu Freitas de Abreu;Naoki Ishikawa
In this article, we propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in coding theory and wireless communications applications involving optimal codebook design. In turn, GAS is a quantum exhaustive search algorithm that can be used to implement full-fledged maximum-likelihood optimal solutions. In conventional naive formulations, however, it is typical to rely on a binary vector spaces, resulting in search space sizes prohibitive even for GAS. To circumvent this challenge, we instead formulate the search of optimal dispersion problem over Dicke states, an equal superposition of binary vectors with equal Hamming weights, which significantly reduces the search space leading to a simplification of the quantum circuit via the elimination of penalty terms. In addition, we propose a method to replace distance coefficients with their ranks, contributing to the reduction of the number of qubits. Our analysis demonstrates that as a result of the proposed techniques, a reduction in query complexity compared to the conventional GAS using the Hadamard transform is achieved, enhancing the feasibility of the quantum-based solution of the dispersion problem.
在这篇文章中，我们提出了最大和与最大-最小分散问题的新公式，可以通过格罗弗自适应搜索（GAS）量子算法求解，并提供二次加速。分散问题是被归类为 NP-困难的组合优化问题，经常出现在编码理论和涉及最优码本设计的无线通信应用中。而 GAS 是一种量子穷举搜索算法，可用于实现成熟的最大似然最优解。然而，在传统的天真公式中，通常依赖于二进制向量空间，导致搜索空间的大小甚至令 GAS 望而却步。为了规避这一挑战，我们转而在 Dicke 状态（具有相等汉明权重的二进制向量的相等叠加）上搜索最佳分散问题，这大大缩小了搜索空间，通过消除惩罚项简化了量子电路。此外，我们还提出了一种用等级取代距离系数的方法，有助于减少量子比特的数量。我们的分析表明，与使用哈达玛变换的传统 GAS 相比，所提出的技术降低了查询复杂度，增强了基于量子的色散问题解决方案的可行性。
{"title":"Quantum Speedup of the Dispersion and Codebook Design Problems","authors":"Kein Yukiyoshi;Taku Mikuriya;Hyeon Seok Rou;Giuseppe Thadeu Freitas de Abreu;Naoki Ishikawa","doi":"10.1109/TQE.2024.3450852","DOIUrl":"https://doi.org/10.1109/TQE.2024.3450852","url":null,"abstract":"In this article, we propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in coding theory and wireless communications applications involving optimal codebook design. In turn, GAS is a quantum exhaustive search algorithm that can be used to implement full-fledged maximum-likelihood optimal solutions. In conventional naive formulations, however, it is typical to rely on a binary vector spaces, resulting in search space sizes prohibitive even for GAS. To circumvent this challenge, we instead formulate the search of optimal dispersion problem over Dicke states, an equal superposition of binary vectors with equal Hamming weights, which significantly reduces the search space leading to a simplification of the quantum circuit via the elimination of penalty terms. In addition, we propose a method to replace distance coefficients with their ranks, contributing to the reduction of the number of qubits. Our analysis demonstrates that as a result of the proposed techniques, a reduction in query complexity compared to the conventional GAS using the Hadamard transform is achieved, enhancing the feasibility of the quantum-based solution of the dispersion problem.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2024-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10654547","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324300","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-08-23DOI: 10.1109/TQE.2024.3435757
Samudra Dasgupta;Travis S. Humble
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.
{"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}
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 $mathcal {O}(N)$ and $mathcal {O}(N^{2})$ 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.
{"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}
Pub Date : 2024-08-20DOI: 10.1109/TQE.2024.3445967
Fabian Hader;Sarah Fleitmann;Jan Vogelbruch;Lotte Geck;Stefan van Waasen
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.
{"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}
Pub Date : 2024-08-14DOI: 10.1109/TQE.2024.3443660
Jonathan Wurtz;Stefan H. Sack;Sheng-Tao Wang
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 $k$ -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.”
{"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}
Pub Date : 2024-08-09DOI: 10.1109/TQE.2024.3441229
John D. Malcolm;Alexander Roth;Mladjan Radic;Pablo Martín-Ramiro;Jon Oillarburu;Borja Aizpurua;Román Orús;Samuel Mugel
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.
{"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}
Pub Date : 2024-08-07DOI: 10.1109/TQE.2024.3440192
Hany Khalifa;Riku Jäntti;Gheorghe Sorin Paraoanu
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.
{"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}
Pub Date : 2024-08-06DOI: 10.1109/TQE.2024.3439135
Kentaro Tamura;Yohichi Suzuki;Rudy Raymond;Hiroshi C. Watanabe;Yuki Sato;Ruho Kondo;Michihiko Sugawara;Naoki Yamamoto
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.
{"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}
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.
{"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}
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：