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

Modeling and Experimental Validation of the Intrinsic SNR in Spin Qubit Gate-Based Readout and Its Impacts on Readout Electronics 基于自旋质子栅极读出的固有信噪比的建模和实验验证及其对读出电子器件的影响

IEEE Transactions on Quantum Engineering Pub Date : 2024-04-05 DOI: 10.1109/TQE.2024.3385673

Bagas Prabowo;Jurgen Dijkema;Xiao Xue;Fabio Sebastiano;Lieven M. K. Vandersypen;Masoud Babaie

{"title":"Modeling and Experimental Validation of the Intrinsic SNR in Spin Qubit Gate-Based Readout and Its Impacts on Readout Electronics","authors":"Bagas Prabowo;Jurgen Dijkema;Xiao Xue;Fabio Sebastiano;Lieven M. K. Vandersypen;Masoud Babaie","doi":"10.1109/TQE.2024.3385673","DOIUrl":"https://doi.org/10.1109/TQE.2024.3385673","url":null,"abstract":"In semiconductor spin quantum bits (qubits), the radio-frequency (RF) gate-based readout is a promising solution for future large-scale integration, as it allows for a fast, frequency-multiplexed readout architecture, enabling multiple qubits to be read out simultaneously. This article introduces a theoretical framework to evaluate the effect of various parameters, such as the readout probe power, readout chain's noise performance, and integration time on the intrinsic readout signal-to-noise ratio, and thus readout fidelity of RF gate-based readout systems. By analyzing the underlying physics of spin qubits during readout, this work proposes a qubit readout model that takes into account the qubit's quantum mechanical properties, providing a way to evaluate the tradeoffs among the aforementioned parameters. The validity of the proposed model is evaluated by comparing the simulation and experimental results. The proposed analytical approach, the developed model, and the experimental results enable designers to optimize the entire readout chain effectively, thus leading to a faster, lower power readout system with integrated cryogenic electronics.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10493854","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140844433","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Simulating Quantum Field Theories on Gate-Based Quantum Computers 在门式量子计算机上模拟量子场理论

IEEE Transactions on Quantum Engineering Pub Date : 2024-04-04 DOI: 10.1109/TQE.2024.3385372

Gayathree M. Vinod;Anil Shaji

{"title":"Simulating Quantum Field Theories on Gate-Based Quantum Computers","authors":"Gayathree M. Vinod;Anil Shaji","doi":"10.1109/TQE.2024.3385372","DOIUrl":"https://doi.org/10.1109/TQE.2024.3385372","url":null,"abstract":"We implement a simulation of a quantum field theory in 1+1 space–time dimensions on a gate-based quantum computer using the light-front formulation of the theory. The nonperturbative simulation of the Yukawa model field theory is verified on IBM's simulator and is also demonstrated on a small-scale IBM circuit-based quantum processor, on the cloud, using IBM Qiskit. The light-front formulation allows for controlling the resource requirement and complexity of the computation with commensurate tradeoffs in accuracy and detail by modulating a single parameter, namely, the harmonic resolution. Qubit operators for the Bosonic excitations were also created and were used along with the Fermionic ones already available, to simulate the theory involving all of these particles. With the restriction on the number of logical qubits available on the existent gate-based noisy intermediate-scale quantum (NISQ) devices, the Trotterization approximation is also used. We show that experimentally relevant quantities, such as cross sections for various processes and survival probabilities of various states, can be computed. We also explore the inaccuracies introduced by the bounds on achievable harmonic resolution and Trotter steps placed by the limited number of qubits and circuit depth supported by present-day NISQ devices.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10491310","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140902539","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Incentivizing Demand-Side Response Through Discount Scheduling Using Hybrid Quantum Optimization 利用混合量子优化通过折扣调度激励需求方响应

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-30 DOI: 10.1109/TQE.2024.3407236

David Bucher;Jonas Nüßlein;Corey O'Meara;Ivan Angelov;Benedikt Wimmer;Kumar Ghosh;Giorgio Cortiana;Claudia Linnhoff-Popien

{"title":"Incentivizing Demand-Side Response Through Discount Scheduling Using Hybrid Quantum Optimization","authors":"David Bucher;Jonas Nüßlein;Corey O'Meara;Ivan Angelov;Benedikt Wimmer;Kumar Ghosh;Giorgio Cortiana;Claudia Linnhoff-Popien","doi":"10.1109/TQE.2024.3407236","DOIUrl":"https://doi.org/10.1109/TQE.2024.3407236","url":null,"abstract":"Demand-side response (DSR) is a strategy that enables consumers to actively participate in managing electricity demand. It aims to alleviate strain on the grid during high demand and promote a more balanced and efficient use of (renewable) electricity resources. We implement DSR through discount scheduling, which involves offering discrete price incentives to consumers to adjust their electricity consumption patterns to times when their local energy mix consists of more renewable energy. Since we tailor the discounts to individual customers' consumption, the discount scheduling problem (DSP) becomes a large combinatorial optimization task. Consequently, we adopt a hybrid quantum computing approach, using D-Wave's Leap Hybrid Cloud. We benchmark Leap against Gurobi, a classical mixed-integer optimizer, in terms of solution quality at fixed runtime and fairness in terms of discount allocation. Furthermore, we propose a large-scale decomposition algorithm/heuristic for the DSP, applied with either quantum or classical computers running the subroutines, which significantly reduces the problem size while maintaining solution quality. Using synthetic data generated from real-world data, we observe that the classical decomposition method obtains the best overall solution quality for problem sizes up to 3200 consumers; however, the hybrid quantum approach provides more evenly distributed discounts across consumers.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2024-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10542394","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141435333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mitigating Barren Plateaus of Variational Quantum Eigensolvers 缓解变分量子求解器的贫瘠高原

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-29 DOI: 10.1109/TQE.2024.3383050

Xia Liu;Geng Liu;Hao-Kai Zhang;Jiaxin Huang;Xin Wang

引用次数: 0

Scalable Full-Stack Benchmarks for Quantum Computers 量子计算机的可扩展全栈基准

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-23 DOI: 10.1109/TQE.2024.3404502

Jordan Hines;Timothy Proctor

引用次数: 0

Trellis Decoding for Qudit Stabilizer Codes and Its Application to Qubit Topological Codes Qudit 稳定器编码的 Trellis 解码及其在 Qubit 拓扑编码中的应用

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-16 DOI: 10.1109/TQE.2024.3401857

Eric Sabo;Arun B. Aloshious;Kenneth R. Brown

{"title":"Trellis Decoding for Qudit Stabilizer Codes and Its Application to Qubit Topological Codes","authors":"Eric Sabo;Arun B. Aloshious;Kenneth R. Brown","doi":"10.1109/TQE.2024.3401857","DOIUrl":"https://doi.org/10.1109/TQE.2024.3401857","url":null,"abstract":"Trellis decoders are a general decoding technique first applied to qubit-based quantum error correction codes by Ollivier and Tillich in 2006. Here, we improve the scalability and practicality of their theory, show that it has strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The resulting formalism is valid for any prime-dimensional quantum system. The modified decoder works for any stabilizer code \u0000<inline-formula><tex-math>$S$</tex-math></inline-formula>\u0000 and separates into two parts: 1) a one-time offline computation that builds a compact graphical representation of the normalizer of the code, \u0000<inline-formula><tex-math>$mathcal {S}^{perp}$</tex-math></inline-formula>\u0000 and 2) a quick, parallel, online query of the resulting vertices using the Viterbi algorithm. We show the utility of trellis decoding by applying it to four high-density length-20 stabilizer codes for depolarizing noise and the well-studied Steane, rotated surface, and 4.8.8/6.6.6 color codes for \u0000<inline-formula><tex-math>$Z$</tex-math></inline-formula>\u0000 only noise. Numerical simulations demonstrate a 20% improvement in the code-capacity threshold for color codes with boundaries by avoiding the mapping from color codes to surface codes. We identify trellis edge number as a key metric of difficulty of decoding, allowing us to quantify the advantage of single-axis (\u0000<inline-formula><tex-math>$X$</tex-math></inline-formula>\u0000 or \u0000<inline-formula><tex-math>$Z$</tex-math></inline-formula>\u0000) decoding for Calderbank–Steane–Shor codes and block decoding for concatenated codes.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-30"},"PeriodicalIF":0.0,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10531666","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141439505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis 利用远距离纠缠的力量进行克利福德电路合成

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-16 DOI: 10.1109/TQE.2024.3402085

Willers Yang;Patrick Rall

{"title":"Harnessing the Power of Long-Range Entanglement for Clifford Circuit Synthesis","authors":"Willers Yang;Patrick Rall","doi":"10.1109/TQE.2024.3402085","DOIUrl":"https://doi.org/10.1109/TQE.2024.3402085","url":null,"abstract":"In superconducting architectures, limited connectivity remains a significant challenge for the synthesis and compilation of quantum circuits. We consider models of entanglement-assisted computation where long-range operations are achieved through injections of large Greenberger–Horne–Zeilinger (GHZ) states. These are prepared using ancillary qubits acting as an “entanglement bus,” unlocking global operation primitives such as multiqubit Pauli rotations and fan-out gates. We derive bounds on the circuit size for several well-studied problems, such as CZ circuit, CX circuit, and Clifford circuit synthesis. In particular, in an architecture using one such entanglement bus, we give a synthesis scheme for arbitrary Clifford operations requiring at most \u0000<inline-formula><tex-math>$2n+1$</tex-math></inline-formula>\u0000 layers of entangled state injections, which can be computed classically in \u0000<inline-formula><tex-math>$O(n^{3})$</tex-math></inline-formula>\u0000 time. In a square-lattice architecture with two entanglement buses, we show that a graph state can be synthesized using at most \u0000<inline-formula><tex-math>$lceil frac{1}{2}nrceil +1$</tex-math></inline-formula>\u0000 layers of GHZ state injections, and Clifford operations require only \u0000<inline-formula><tex-math>$lceil frac{3}{2} n rceil + O(sqrt{n})$</tex-math></inline-formula>\u0000 layers of GHZ state injections.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10531653","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141448003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems 约束组合优化问题的后处理变量调度量子算法

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-13 DOI: 10.1109/TQE.2024.3376721

Tatsuhiko Shirai;Nozomu Togawa

{"title":"Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems","authors":"Tatsuhiko Shirai;Nozomu Togawa","doi":"10.1109/TQE.2024.3376721","DOIUrl":"https://doi.org/10.1109/TQE.2024.3376721","url":null,"abstract":"In this article, we propose a postprocessing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-based quantum device. Variational methods are used to find an optimal schedule function that leads to high-quality solutions in a short amount of time. Postprocessing techniques convert the output solutions of the quantum devices to satisfy the constraints of the COPs. The pVSQA combines the variational methods and the postprocessing technique. We obtain a sufficient condition for constrained COPs to apply the pVSQA based on a greedy postprocessing algorithm. We apply the proposed method to two constrained NP-hard COPs: the graph partitioning problem and the quadratic knapsack problem. The pVSQA on a simulator shows that a small number of variational parameters is sufficient to achieve a (near-) optimal performance within a predetermined operation time. Then, building upon the simulator results, we implement the pVSQA on a quantum annealer and a gate-based quantum device. The experimental results demonstrate the effectiveness of our proposed method.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10472069","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140546499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Reliable Quantum Communications Based on Asymmetry in Distillation and Coding 基于蒸馏和编码不对称的可靠量子通信

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-10 DOI: 10.1109/TQE.2024.3399609

Lorenzo Valentini;René Bødker Christensen;Petar Popovski;Marco Chiani

{"title":"Reliable Quantum Communications Based on Asymmetry in Distillation and Coding","authors":"Lorenzo Valentini;René Bødker Christensen;Petar Popovski;Marco Chiani","doi":"10.1109/TQE.2024.3399609","DOIUrl":"https://doi.org/10.1109/TQE.2024.3399609","url":null,"abstract":"The reliable provision of entangled qubits is an essential precondition in a variety of schemes for distributed quantum computing. This is challenged by multiple nuisances, such as errors during the transmission over quantum links, but also due to degradation of the entanglement over time due to decoherence. The latter can be seen as a constraint on the latency of the quantum protocol, which brings the problem of quantum protocol design into the context of latency–reliability constraints. We address the problem through hybrid schemes that combine: indirect transmission based on teleportation and distillation, and direct transmission, based on quantum error correction (QEC). The intuition is that, at present, the quantum hardware offers low fidelity, which demands distillation; on the other hand, low latency can be obtained by QEC techniques. It is shown that, in the proposed framework, the distillation protocol gives rise to asymmetries that can be exploited by asymmetric quantum error correcting code, which sets the basis for unique hybrid distillation and coding design. Our results show that ad hoc asymmetric codes give, compared with conventional QEC, a performance boost and codeword size reduction both in a single-link and in a quantum network scenario.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-13"},"PeriodicalIF":0.0,"publicationDate":"2024-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10528897","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141181950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Testing and Debugging Quantum Circuits 测试和调试量子电路

IEEE Transactions on Quantum Engineering Pub Date : 2024-03-08 DOI: 10.1109/TQE.2024.3374879

Sara Ayman Metwalli;Rodney Van Meter

{"title":"Testing and Debugging Quantum Circuits","authors":"Sara Ayman Metwalli;Rodney Van Meter","doi":"10.1109/TQE.2024.3374879","DOIUrl":"https://doi.org/10.1109/TQE.2024.3374879","url":null,"abstract":"This article introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: amplitude–permutation, phase-modulation, and amplitude–redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For amplitude–permutation circuits, we propose techniques to correct amplitude–permutations mimicking classical operations. In phase-modulation circuits, our proposed strategy targets the precise calibration of phase alterations essential for quantum computations. The most complex amplitude–redistribution circuits demand advanced methods to adjust probability amplitudes. This research bridges a vital gap in current methodologies and lays the groundwork for future advancements in quantum circuit debugging. Our contributions are twofold: we present a comprehensive unit testing tool (Cirquo) and debugging approaches tailored to the unique demands of quantum computing, and we provide empirical evidence of its effectiveness in optimizing quantum circuit performance. This work is a crucial step toward realizing robust quantum computing systems and their applications in various domains.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"5 ","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2024-03-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10463159","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140550145","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0