相关论文: Renormalization Group Approach To Error-Correcting…
We propose a new concept upon the renormalization group (RG) procedure for an interacting many-electron correlated system in the framework of natural orbitals, and formulate an algorithm for this RG approach. To demonstrate its…
A simple backreaction problem in quantum mechanics, the full quantum anharmonic oscillator, and quantum parametric resonance are studied using Renormalization Group techniques for global asymptotic analysis. In this short note this…
A method of ``blocking'' triangulations that rests on the self-similarity feature of dynamically triangulated random manifolds is proposed. The method is used to define the renormalization group for random geometries. As an illustration,…
Recently a framework for assisted quantum error correction was proposed in which a specific type of error is allowed to occur on auxiliary qubits, which is in contrast to standard entanglement assistance that requires noiseless auxiliary…
This study investigates the problem of learning linear block codes optimized for Belief-Propagation decoders significantly improving performance compared to the state-of-the-art. Our previous research is extended with an enhanced system…
The renormalization group (RG) is known to provide information about radiative corrections beyond the order in perturbation theory to which one has calculated explicitly. We first demonstrate the effect of the renormalization scheme used on…
The renormalization group is extended to cases where several heavy particles are decoupled at the same time. This involves large logarithms which are scale-invariant and so cannot be eliminated by a change of renormalization scheme. A set…
We study the block-coordinate forward-backward algorithm in which the blocks are updated in a random and possibly parallel manner, according to arbitrary probabilities. The algorithm allows different stepsizes along the block-coordinates to…
Parity declustering allows faster reconstruction of a disk array when some disk fails. Moreover, it guarantees uniform reconstruction workload on all surviving disks. It has been shown that parity declustering for one-failure tolerant array…
Approximately 10 years ago, the method of renormalization-group symmetries entered the field of boundary value problems of classical mathematical physics, stemming from the concepts of functional self-similarity and of the Bogoliubov…
A so-called Renormalization Group (RG) analysis is performed in order to shed some light on why the density of prime numbers in $\Bbb N^*$ decreases like the single power of the inverse neperian logarithm.
The stabilization of a quantum computer by repeated error correction can be reduced almost entirely to repeated preparation of blocks of qubits in quantum codeword states. These are multi-particle entangled states with a high degree of…
Matrix models of 2D quantum gravity are either exactly solvable for matter of central charge $ c\leq 1, $ or not understood. It would be useful to devise an approximate scheme which would be reasonable for the known cases and could be…
Entity Resolution, also called record linkage or deduplication, refers to the process of identifying and merging duplicate versions of the same entity into a unified representation. The standard practice is to use a Rule based or Machine…
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…
An algorithm of the tensor renormalization group is proposed based on a randomized algorithm for singular value decomposition. Our algorithm is applicable to a broad range of two-dimensional classical models. In the case of a square…
Linear programming (LP) decoding approximates maximum-likelihood (ML) decoding of a linear block code by relaxing the equivalent ML integer programming (IP) problem into a more easily solved LP problem. The LP problem is defined by a set of…
Traditionally, quantization is designed to minimize the reconstruction error of a data source. When considering downstream classification tasks, other measures of distortion can be of interest; such as the 0-1 classification loss.…
Much progress has been made on decoding algorithms for error-correcting codes in the last decade. In this article, we give an introduction to some fundamental results on iterative, message-passing algorithms for low-density parity check…
Parity check matrices (PCMs) are used to define linear error correcting codes and ensure reliable information transmission over noisy channels. The set of codewords of such a code is the null space of this binary matrix. We consider the…