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: 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: The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables. Its solution is a fundamental step in the electronic design automation (EDA) tool chains commonly used for digital circuit design. In fact, the library-mapping step of an […]
Abstract: Radio frequency pulses are preponderant for the control of quantum bits and the execution of operations in quantum computers. The ability to fine-tune key pulse parameters, such as time-dependent amplitude, phase, and frequency, is essential to achieve maximal gate fidelity and mitigate errors. As systems increase in scale, a larger proportion of the control […]
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 […]
We assess the convergence of the Carleman linearization of advection–diffusion–reaction (ADR) equations with a logistic nonlinearity. It is shown that five Carleman iterates provide a satisfactory approximation of the original ADR across a broad range of parameters and strength of nonlinearity. To assess the feasibility of a quantum algorithm based on this linearization, we analyze […]