Related papers: Transversal switching between generic stabilizer c…
We propose a protocol to prepare a high-fidelity magic state on a two-dimensional (2D) color code using a three-dimensional (3D) color code. Our method modifies the known code switching protocol with (i) a recently discovered transversal…
While stabilizer tableaus have proven useful as a descriptive tool for additive quantum codes, they otherwise offer little guidance for concrete constructions or algorithm analysis. We introduce a representation of stabilizer codes as…
In this article we introduce the insertion method for reconstructing the path from its signature, i.e. inverting the signature of a path. For this purpose, we prove that a converging upper bound exists for the difference between the…
In this paper, we consider the problem of robust joint source-channel coding over an additive white Gaussian noise channel. We propose a new scheme which achieves the optimal slope of the signal-to-distortion (SDR) curve (unlike the…
Constrained coding is a fundamental field in coding theory that tackles efficient communication through constrained channels. While channels with fixed constraints have a general optimal solution, there is increasing demand for parametric…
Quantum error correction, which utilizes logical qubits that are encoded as redundant multiple physical qubits to find and correct errors in physical qubits, is indispensable for practical quantum computing. Surface code is considered to be…
In this paper, we focus on the task of optimizing the parameters in Parametrized Quantum Circuits (PQCs). While popular algorithms, such as Simultaneous Perturbation Stochastic Approximation (SPSA), limit the number of circuit-execution to…
We present a proof-of-principle study of variational quantum sensing for estimating a structured linear function of local phase parameters, in which each qubit in a spin-1/2 array accumulates a phase phi_i = alpha_i theta with known weights…
Given the severity of noise in near-term quantum computing, error mitigation is essential to reduce error in quantum-computer-generated expectation values. We introduce RIDA (Random Inverse Depolarizing Approximation), a simple universal…
The variances of matched and sidelobe free mismatched filter estimators are given for arbitrary coherent targets in the case of aperiodic transmission. It is shown that mismatched filtering is often better than matched filtering in terms of…
We consider a distributed source coding system in which several observations are communicated to the decoder using limited transmission rate. The observations must be separately coded. We introduce a robust distributed coding scheme which…
This work focuses on the convergence analysis of adaptive distributed beamforming schemes that can be reformulated as local random search algorithms via a random search framework. Once reformulated as local random search algorithms, it is…
This paper presents a simple periodic parameter-switching method which can find any stable limit cycle that can be numerically approximated in a generalized Duffing system. In this method, the initial value problem of the system is…
Quantum error correction is a crucial technology for fault tolerant quantum computing. On superconducting platforms, hardware defects in large scale quantum processors can disrupt the regular lattice structure of topological codes and…
The discovery of holographic codes established a surprising connection between quantum error correction and the anti-de Sitter-conformal field theory correspondence. Recent technological progress in artificial quantum systems renders the…
We analyze an exchange algorithm for the numerical solution total-variation regularized inverse problems over the space M($\Omega$) of Radon measures on a subset $\Omega$ of R d. Our main result states that under some regularity conditions,…
We introduce an extension of the Difference of Convex Algorithm (DCA) in the form of a randomized block coordinate approach for problems with separable structure. For $n$ coordinate-blocks and $k$ iterations, our main result proves a…
Operator quantum error correction is a recently developed theory that provides a generalized framework for active error correction and passive error avoiding schemes. In this paper, we describe these codes in the stabilizer formalism of…
Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time.…
We investigate the stability of logical information in quantum stabilizer codes subject to coherent unitary errors. Beginning with a logical state, we apply a random unitary error channel and subsequently measure stabilizer checks,…