Related papers: Exact nuclear pairing solution for large-scale con…

Nuclear pairing correlations are known to play an important role in various single-particle and collective aspects of nuclear structure. After the first idea by A. Bohr, B. Mottelson and D. Pines on similarity of nuclear pairing to electron…

We present EDIpack, an exact diagonalization package to solve generic quantum impurity problems. The algorithm includes a generalization of the look-up method introduced in [Lin, Gubernatis Comput. Phys., 7 (4) (1993), 400] and enables a…

We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…

We present a systematic hierarchy of approximations for {\it local} exact-decoupling of four-component quantum chemical Hamiltonians based on the Dirac equation. Our ansatz reaches beyond the trivial local approximation that is based on a…

Pariser-Parr-Pople (P-P-P) model Hamiltonian has been used extensively over the years to perform calculations of electronic structure and optical properties of $\pi$-conjugated systems successfully. In spite of tremendous successes of…

We propose a description of pairing properties in finite systems within the canonical and microcanonical ensembles. The approach is derived by solving the BCS and self-consistent quasiparticle random-phase approximation with the…

Nuclear quantum phenomena beyond the Born-Oppenheimer approximation are known to play an important role in a growing number of chemical and biological processes. While there exists no unique consensus on a rigorous and efficient…

The Exact Circular Pattern Matching (ECPM) problem consists of reporting every occurrence of a rotation of a pattern $P$ in a text $T$. In many real-world applications, specifically in computational biology, circular rotations are of…

This work aims to study and explore the use of Gene Expression Programming (GEP) in solving the on-line Bin-Packing problem. The main idea is to show how GEP can automatically find acceptable heuristic rules to solve the problem efficiently…

Exceptional points (EPs) are degeneracies of non-Hermitian operators where, in addition to the eigenvalues, corresponding eigenmodes become degenerate. Classical and quantum photonic systems with EPs have attracted tremendous attention due…

Different choices of quantum error-correcting codes can reduce the demands on the physical hardware needed to build a quantum computer. To achieve the full potential of a code, we must develop practical decoding algorithms that can correct…

We investigate exact solutions for isothermal shock problems in different one-dimensional geometries. These solutions are given as analytical expressions if possible, or are computed using standard numerical methods for solving ordinary…

Due to the ability to provide superior error-correction performance, the successive cancellation list (SCL) algorithm is widely regarded as one of the most promising decoding algorithms for polar codes with short-to-moderate code lengths.…

The study of approximate matching in the Massively Parallel Computations (MPC) model has recently seen a burst of breakthroughs. Despite this progress, however, we still have a far more limited understanding of maximal matching which is one…

An equation of state (EOS) for uniform asymmetric nuclear matter (ANM) is constructed at zero and finite temperatures by the variational method starting from the nuclear Hamiltonian that is composed of the Argonne v18 and Urbana IX…

Superconducting quantum processor units (QPUs) are incapable of producing massive datasets for quantum error correction (QEC) because of hardware limitations. Thus, QEC decoders heavily depend on synthetic data from qubit error models.…

Molecular computing promises massive parallelization to explore solution spaces, but so far practical implementations remain limited due to off-target binding and exponential proliferation of competing structures. Here, we investigate the…

Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code; a prototypical quantum low-density parity-check code that underlies many of the…

We study a class of weakly identifiable location-scale mixture models for which the maximum likelihood estimates based on $n$ i.i.d. samples are known to have lower accuracy than the classical $n^{- \frac{1}{2}}$ error. We investigate…

Many geometric estimation problems take the form of synchronization over the special Euclidean group: estimate the values of a set of poses given noisy measurements of a subset of their pairwise relative transforms. This problem is…