IEEE Transactions on Quantum Engineering最新文献

Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers 混合可满足性求解器的运行时-一致性权衡

IEEE Transactions on Quantum Engineering Pub Date : 2025-04-22 DOI: 10.1109/TQE.2025.3563805

Vahideh Eshaghian;Sören Wilkening;Johan Åberg;David Gross

{"title":"Runtime–Coherence Tradeoffs for Hybrid Satisfiability Solvers","authors":"Vahideh Eshaghian;Sören Wilkening;Johan Åberg;David Gross","doi":"10.1109/TQE.2025.3563805","DOIUrl":"https://doi.org/10.1109/TQE.2025.3563805","url":null,"abstract":"Many search-based quantum algorithms that achieve a theoretical speedup are not practically relevant since they require extraordinarily long coherence times, or lack the parallelizability of their classical counterparts. This raises the question of how to divide computational tasks into a collection of parallelizable subproblems, each of which can be solved by a quantum computer with limited coherence time. Here, we approach this question via hybrid algorithms for the <inline-formula><tex-math>$k$</tex-math></inline-formula>-satisfiability problem (k-SAT). Our analysis is based on Schöning's algorithm, which solves instances of <inline-formula><tex-math>$k$</tex-math></inline-formula>-SAT by performing random walks in the space of potential assignments. The search space of the walk allows for “natural” partitions, where we subject only one part of the partition to a Grover search, while the rest is sampled classically, thus resulting in a hybrid scheme. In this setting, we argue that there exists a simple tradeoff relation between the total runtime and the coherence time, which no such partition-based hybrid scheme can surpass. For several concrete choices of partitions, we explicitly determine the specific runtime coherence time relations and show saturation of the ideal tradeoff. Finally, we present numerical simulations, which suggest additional flexibility in implementing hybrid algorithms with the optimal tradeoff.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-22"},"PeriodicalIF":0.0,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10974582","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144148131","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

Quantum Direct-Sequence Spread-Spectrum CDMA Communication Systems: Mathematical Foundations 量子直接序列扩频CDMA通信系统：数学基础

IEEE Transactions on Quantum Engineering Pub Date : 2025-04-15 DOI: 10.1109/TQE.2025.3560403

Mohammad Amir Dastgheib;Jawad A. Salehi;Mohammad Rezai

{"title":"Quantum Direct-Sequence Spread-Spectrum CDMA Communication Systems: Mathematical Foundations","authors":"Mohammad Amir Dastgheib;Jawad A. Salehi;Mohammad Rezai","doi":"10.1109/TQE.2025.3560403","DOIUrl":"https://doi.org/10.1109/TQE.2025.3560403","url":null,"abstract":"This article describes the fundamental principles and mathematical foundations of quantum direct-sequence spread-spectrum code division multiple-access communication systems. The evolution of quantum signals through the quantum direct-sequence spread-spectrum multiple-access communication system is carefully characterized by a novel approach called the decomposition of creation operators. In this methodology, the creation operator of the transmitted quantum signal is decomposed into the chip-time interval creation operators, each of which is defined over the duration of a chip. These chip-time interval creation operators are the invariant building blocks of the spread-spectrum quantum communication systems. With the aid of the proposed chip-time decomposition approach, we can find closed-form relations for quantum signals at the receiver of such a quantum communication system. Furthermore, this article details the principles of narrowband filtering of quantum signals required at the receiver, a crucial step in designing and analyzing quantum communication systems. We show, that by employing coherent states as the transmitted quantum signals, the interuser interference appears as an additive term in the magnitude of the output coherent (Glauber) state, and the output of the quantum communication system is a pure quantum signal. On the other hand, if the transmitters utilize particle-like quantum signals (Fock states) such as single-photon states, the entanglement effect can arise at the receivers. The important techniques developed in this article are expected to have far-reaching implications for various applications in the exciting field of quantum communications and quantum signal processing.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-40"},"PeriodicalIF":0.0,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10964196","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144072826","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

A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations 量子哈密顿模拟性能基准测试的综合跨模型框架

IEEE Transactions on Quantum Engineering Pub Date : 2025-04-04 DOI: 10.1109/TQE.2025.3558090

Avimita Chatterjee;Sonny Rappaport;Anish Giri;Sonika Johri;Timothy Proctor;David E. Bernal Neira;Pratik Sathe;Thomas Lubinski

{"title":"A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations","authors":"Avimita Chatterjee;Sonny Rappaport;Anish Giri;Sonika Johri;Timothy Proctor;David E. Bernal Neira;Pratik Sathe;Thomas Lubinski","doi":"10.1109/TQE.2025.3558090","DOIUrl":"https://doi.org/10.1109/TQE.2025.3558090","url":null,"abstract":"Quantum Hamiltonian simulation is one of the most promising applications of quantum computing and forms the basis for many quantum algorithms. Benchmarking them is an important gauge of progress in quantum computing technology. We present a methodology and software framework to evaluate various facets of the performance of gate-based quantum computers on Trotterized quantum Hamiltonian evolution. We propose three distinct modes for benchmarking: 1) comparing simulation on a real device to that on a noiseless classical simulator; 2) comparing simulation on a real device with exact diagonalization results; and 3) using scalable mirror circuit techniques to assess hardware performance in scenarios beyond classical simulation methods. We demonstrate this framework on five Hamiltonian models from the HamLib library: the Fermi–Hubbard and Bose–Hubbard models, the transverse-field Ising model, the Heisenberg model, and the Max3SAT problem. Experiments were conducted using Qiskit's Aer simulator, BlueQubit's CPU cluster and GPU simulators, and IBM's quantum hardware. Our framework, extendable to other Hamiltonians, provides comprehensive performance profiles that reveal hardware and algorithmic limitations and measure both fidelity and execution times, identifying crossover points where quantum hardware outperforms CPU/GPU simulators.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-26"},"PeriodicalIF":0.0,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10949677","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143896182","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

Mixed Grover: A Hybrid Version to Improve Grover's Algorithm for Unstructured Database Search 混合Grover：改进Grover算法用于非结构化数据库搜索的混合版本

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-28 DOI: 10.1109/TQE.2025.3555562

Romain Piron;Muhammad Idham Habibie;Claire Goursaud

引用次数: 0

Two-Dimensional Beam Selection by Multiarmed Bandit Algorithm Based on a Quantum Walk 基于量子行走的多臂Bandit算法的二维光束选择

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-26 DOI: 10.1109/TQE.2025.3555145

Maki Arai;Tomoki Yamagami;Takatomo Mihana;Ryoichi Horisaki;Mikio Hasegawa

引用次数: 0

Emulation of Density Matrix Dynamics With Classical Analog Circuits 密度矩阵动力学的经典模拟电路仿真

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-19 DOI: 10.1109/TQE.2025.3552736

Anthony J. Cressman;Rahul Sarpeshkar

{"title":"Emulation of Density Matrix Dynamics With Classical Analog Circuits","authors":"Anthony J. Cressman;Rahul Sarpeshkar","doi":"10.1109/TQE.2025.3552736","DOIUrl":"https://doi.org/10.1109/TQE.2025.3552736","url":null,"abstract":"Analog circuits have emerged as a valuable quantum emulation and simulation platform. Specifically, they have been experimentally shown to excel in emulating coherent state vector dynamics and motifs of quantum circuits, such as the quantum Fourier transform, tensor product superpositions, two-level systems such as Josephson junctions, and nuclear magnetic resonance state dynamics, all on a very large scale integration chip at room temperature (Cressman et al., 2022; Sarpeshkar, 2019a, 2019b, 2019c; Sarpeshkar, 2020). However, the ability to model simple state vectors is insufficient for modeling open quantum systems, i.e., systems with environmental noise. Noisy quantum systems are essential in practical implementations and applications that exploit noise. The density matrix formalism enables us to model such states, including finite reservoir state systems, and all states that can be represented as state vectors. To our knowledge, no one has yet demonstrated the mapping of a density matrix system to classical analog circuit components. We review the procedure for emulating the dynamics of a finite state vector with four essential analog circuit components and extend this procedure to emulate density matrix dynamics. We then simulate these systems as analog circuits in the presence of noise. This protocol opens up exciting possibilities for further research and development in noisy quantum emulation and simulation using analog circuits for arbitrarily large or small systems.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10933553","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143839958","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

Optimized Distribution of Entanglement Graph States in Quantum Networks 量子网络中纠缠图态的优化分布

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-17 DOI: 10.1109/TQE.2025.3552006

Xiaojie Fan;Caitao Zhan;Himanshu Gupta;C. R. Ramakrishnan

{"title":"Optimized Distribution of Entanglement Graph States in Quantum Networks","authors":"Xiaojie Fan;Caitao Zhan;Himanshu Gupta;C. R. Ramakrishnan","doi":"10.1109/TQE.2025.3552006","DOIUrl":"https://doi.org/10.1109/TQE.2025.3552006","url":null,"abstract":"Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-17"},"PeriodicalIF":0.0,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10930585","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848868","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

Observing the Poisson Distribution of a Coherent Microwave Field With a Parametric Photon Detector 用参量光子探测器观察相干微波场的泊松分布

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-11 DOI: 10.1109/TQE.2025.3549485

Jiaming Wang;Kirill Petrovnin;Pertti J. Hakonen;Gheorghe Sorin Paraoanu

{"title":"Observing the Poisson Distribution of a Coherent Microwave Field With a Parametric Photon Detector","authors":"Jiaming Wang;Kirill Petrovnin;Pertti J. Hakonen;Gheorghe Sorin Paraoanu","doi":"10.1109/TQE.2025.3549485","DOIUrl":"https://doi.org/10.1109/TQE.2025.3549485","url":null,"abstract":"Single-photon detectors are essential for implementing optical quantum technologies, such as quantum key distribution, and for enhancing optical imaging systems such as lidar, while also playing a crucial role in studying the statistical properties of light. In this work, we show how the underlying photon statistics can be revealed by using a threshold detector, implemented as a Josephson parametric amplifier operating near a first-order phase transition. We describe the detection protocol, which utilizes a series of pumping pulses followed by the observation of activated switching events. The acquired data are analyzed using two binomial tests, and the results are compared to a theoretical model that takes into account the photon statistics of the microwave field, with additional validation provided by computer simulations. We show that these tests provide conclusive evidence for the Poissonian statistics in the case of a coherent state, in agreement with the experimental data. In addition, this method enables us to distinguish between different statistics of the incoming probe field. Our approach is broadly applicable to standard non-photon-number-resolving detectors, offering a practical pathway to characterize photon statistics in quantum microwave and optical systems.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10919223","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143848798","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

Utilizing Quantum Annealing in Computed Tomography Image Reconstruction 量子退火在计算机断层扫描图像重建中的应用

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-11 DOI: 10.1109/TQE.2025.3549305

Kilian Dremel;Dimitri Prjamkov;Markus Firsching;Mareike Weule;Thomas Lang;Anastasia Papadaki;Stefan Kasperl;Martin Blaimer;Theobald O. J. Fuchs

{"title":"Utilizing Quantum Annealing in Computed Tomography Image Reconstruction","authors":"Kilian Dremel;Dimitri Prjamkov;Markus Firsching;Mareike Weule;Thomas Lang;Anastasia Papadaki;Stefan Kasperl;Martin Blaimer;Theobald O. J. Fuchs","doi":"10.1109/TQE.2025.3549305","DOIUrl":"https://doi.org/10.1109/TQE.2025.3549305","url":null,"abstract":"One of the primary difficulties in computed tomography (CT) is reconstructing cross-sectional images from measured projections of a physical object. There exist several classical methods for this task of generating a digital representation of the object, including filtered backprojection or simultaneous algebraic reconstruction technique. Our research aims to explore the potential of quantum computing in the field of industrial X-ray transmission tomography. Specifically, this work focuses on the application of a method similar to that proposed by Nau et al. (2023) on real CT data to demonstrate the feasibility of quadratic-unconstrained-binary-optimization-based tomographic reconstruction. Starting with simulated phantoms, results with simulated annealing as well as real annealing hardware are shown, leading to the application on measured cone-beam CT data. The results demonstrate that tomographic reconstruction using quantum annealing is feasible for both simulated and real-world applications. Yet, current limitations—involving the maximum processable size and bit depth of voxel values of the images, both correlated with the number of densely connected qubits within the annealing hardware—imply the need of future research to further improve the results. This approach, despite its early stage, has the potential to enable more sophisticated reconstructions, providing an alternative to traditional classical methods.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2025-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10918785","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143809029","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

Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems 求解旅行商问题的两步量子搜索算法

IEEE Transactions on Quantum Engineering Pub Date : 2025-03-06 DOI: 10.1109/TQE.2025.3548706

Rei Sato;Cui Gordon;Kazuhiro Saito;Hideyuki Kawashima;Tetsuro Nikuni;Shohei Watabe

{"title":"Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems","authors":"Rei Sato;Cui Gordon;Kazuhiro Saito;Hideyuki Kawashima;Tetsuro Nikuni;Shohei Watabe","doi":"10.1109/TQE.2025.3548706","DOIUrl":"https://doi.org/10.1109/TQE.2025.3548706","url":null,"abstract":"Quantum search algorithms, such as Grover's algorithm, are anticipated to efficiently solve constrained combinatorial optimization problems. However, applying these algorithms to the traveling salesman problem (TSP) on a quantum circuit presents a significant challenge. Existing quantum search algorithms for the TSP typically assume that an initial state—an equal superposition of all feasible solutions satisfying the problem's constraints—is pre-prepared. The query complexity of preparing this state using brute-force methods scales exponentially with the factorial growth of feasible solutions, creating a significant hurdle in designing quantum circuits for large-scale TSPs. To address this issue, we propose a two-step quantum search (TSQS) algorithm that employs two sets of operators. In the first step, all the feasible solutions are amplified into their equal superposition state. In the second step, the optimal solution state is amplified from this superposition state. The TSQS algorithm demonstrates greater efficiency compared to conventional search algorithms that employ a single oracle operator for finding a solution within the encoded space. Encoded in the higher order unconstrained binary optimization representation, our approach significantly reduces the qubit requirements. This enables efficient initial state preparation through a unified circuit design, offering a quadratic speedup in solving the TSP without prior knowledge of feasible solutions.","PeriodicalId":100644,"journal":{"name":"IEEE Transactions on Quantum Engineering","volume":"6 ","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10915727","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143777948","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