Related papers: Linear combination of unitaries with exponential c…
We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially…
We present a general, systematic, and efficient method for decomposing any given exponential operator of bosonic mode operators, describing an arbitrary multi-mode Hamiltonian evolution, into a set of universal unitary gates. Although our…
A linear-programming decoder for \emph{nonbinary} expander codes is presented. It is shown that the proposed decoder has the maximum-likelihood certificate properties. It is also shown that this decoder corrects any pattern of errors of a…
Fourier multiplier analysis is developed for nonlocal peridynamic-type Laplace operators, which are defined for scalar fields in $\mathbb{R}^n$. The Fourier multipliers are given through an integral representation. We show that the integral…
Coupled tensor decomposition reveals the joint data structure by incorporating priori knowledge that come from the latent coupled factors. The tensor ring (TR) decomposition is invariant under the permutation of tensors with different mode…
We study symmetric tensor decompositions, i.e., decompositions of the form $T = \sum_{i=1}^r u_i^{\otimes 3}$ where $T$ is a symmetric tensor of order 3 and $u_i \in \mathbb{C}^n$.In order to obtain efficient decomposition algorithms, it is…
Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…
Quantum error correction is widely believed to be essential for large-scale quantum computation, but the required qubit overhead remains a central challenge. Quantum low-density parity-check codes can substantially reduce this overhead…
We investigate a family of fault-tolerant quantum error correction schemes based on the concatenation of small error detection or error correction codes with the three-dimensional cluster state. We propose fault-tolerant state preparation…
We establish the improved uniform error bounds on a Lawson-type exponential integrator Fourier pseudospectral (LEI-FP) method for the long-time dynamics of sine-Gordon equation where the amplitude of the initial data is $O(\varepsilon)$…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
In our recent publication [1] we presented an exponential series approximation suitable for highly accurate computation of the complex error function in a rapid algorithm. In this Short Communication we describe how a simplified…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
Fast decoders that achieve strong error suppression are essential for fault-tolerant quantum computation (FTQC) from both practical and theoretical perspectives. The union-find (UF) decoder for the surface code is widely regarded as a…
Many-body fermionic systems can be simulated in a hardware-efficient manner using a fermionic quantum processor. Neutral atoms trapped in optical potentials can realize such processors, where non-local fermionic statistics are guaranteed at…
Neural operators improve conventional neural networks by expanding their capabilities of functional mappings between different function spaces to solve partial differential equations (PDEs). One of the most notable methods is the Fourier…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
A class of two-bit bit flipping algorithms for decoding low-density parity-check codes over the binary symmetric channel was proposed in [1]. Initial results showed that decoders which employ a group of these algorithms operating in…
In this article, we present an $O(N \log N)$ rapidly convergent algorithm for the numerical approximation of the convolution integral with radially symmetric weakly singular kernels and compactly supported densities. To achieve the reduced…
We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds on the optimal fidelity of approximate quantum error…