Abstract: Solving systems of linear equations is a key subroutine in many quantum algorithms. In the last 15 years, many quantum linear solvers (QLS) have been developed, competing to achieve the best asymptotic worst-case complexity. Most QLS assume fault-tolerant quantum computers, so they cannot yet be benchmarked on real hardware. Because an algorithm with better […]
Abstract: This paper addresses the Bi-Objective Traveling Thief Problem (BI-TTP), a challenging multi-objective optimization problem that requires the simultaneous optimization of travel cost and item profit. Conventional methods for the BI-TTP often face severe scalability issues due to the complex interdependence between routing and packing decisions, as well as the inherent complexity and large problem […]
Abstract: Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes C, D satisfying C⊥⊂C⊂D through the Calderbank-Shor-Steane (CSS) code construction. In this work, we establish connections between quantum synchronizable codes, subsystem codes, and […]
Abstract: Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement […]
Abstract: The Ising machine, as a quantum-inspired computing system, can be used to efficiently solve combinatorial optimization problems. Ongoing studies have positioned it to potentially surpass the performance limitations of traditional computers. However, such Ising machines also suffer from scalability as the solution quality becomes sub-optimal when the problem size increases. In this work, we […]
Abstract: Quantum sensing holds great promise for high-precision magnetic field measurements. However, its performance is significantly limited by noise. The investigation of active quantum error correction to address this noise led to the Hamiltonian-not-in-Lindblad-span (HNLS) condition. This states that the Heisenberg scaling is achievable if and only if the signal Hamiltonian is orthogonal to the […]
Abstract: Quantum key distribution (QKD) can provide secure key material between two parties without relying on assumptions about the computational power of an eavesdropper. QKD is performed over quantum links and quantum networks, systems which are resource-intensive to deploy and maintain. To evaluate and optimize performance prior to, during, and after deployment, accurate simulations with […]
Abstract: Superconducting qubits are pivotal in advancing quantum computing, poised for scale but limited by the complexity and fidelity of their control and readout systems, relying on RF and signal processing infrastructure. This survey serves as a comprehensive and technically grounded review of control and readout architectures tailored for superconducting qubits. Synthesizing insights from device […]
Abstract: Phase-only pattern synthesis is a long-standing and hard to solve problem in antenna engineering. Due to its nonlinear nature, this kind of optimization problem is classically approached with iterative algorithms, where the convergence time depends on the problem topology. Often these heuristic solution routines get stuck in local optima and yield suboptimal results. This […]
Abstract: We propose a quantum rotation diversity (QRD) scheme for optical quantum communication using binary phase-shift-keying displaced squeezed states and homodyne detection over Gamma–Gamma turbulence channels. Consecutive temporal modes are coupled by a passive orthogonal rotation that redistributes the displacement amplitude between slots, yielding a diversity order of two under independent fading and joint maximum-likelihood […]