相关论文: Optimal Equivariant Matchings on the 6-Cube with a…
Optimizing a connection through a quantum repeater network requires careful attention to the photon propagation direction of the individual links, the arrangement of those links into a path, the error management mechanism chosen, and the…
We present a fully non-perturbative computation of the mass of the b-quark in the quenched approximation. Our strategy starts from the matching of HQET to QCD in a finite volume and finally relates the quark mass to the spin averaged mass…
Given a simplicial complex with weights on its simplices, and a nontrivial cycle on it, we are interested in finding the cycle with minimal weight which is homologous to the given one. Assuming that the homology is defined with integer…
The aim of this paper is to endow the well-known family of hypercubic quantization hashing methods with theoretical guarantees. In hypercubic quantization, applying a suitable (random or learned) rotation after dimensionality reduction has…
Consistent hashing is fundamental to distributed systems, but ring-based schemes can exhibit high peak-to-average load ratios unless they use many virtual nodes, while multi-probe methods improve balance at the cost of scattered memory…
Improving the structure and analysis in \cite{elm0}, we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an $O(\log \log{n})$ in \cite{elm0}) and the same amortized bounds for all other operations.…
We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of $N$ spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent,…
We present a closed-form solution to Wahba's problem in the quaternion domain for the special case of two vector observations. Existing approaches, including Davenport's $q$-method, QUEST, Horn's method, and ESOQ algorithms, recover the…
In purely repulsive, $C_{4v}$-symmetric Hubbard clusters a correlation effect produces an effective two-body attraction and pairing; the key ingredient is the availability of W=0 pairs, that is, two-body solutions of appropriate symmetry.…
Given an undirected weighted graph $G$ and an integer $k$, Exact-Weight Perfect Matching (EWPM) is the problem of finding a perfect matching of weight exactly $k$ in $G$. In this paper, we study EWPM and its variants. The EWPM problem is…
This paper introduces weighted-BMP, a variant of the Bandwidth Minimization Problem (BMP), with a significant application in optimizing quantum emulation. Weighted-BMP optimizes particles ordering to reduce the emulation costs, by designing…
We generalize the Brouwer-Zimmermann algorithm, which is the most efficient general algorithm for computing the minimum distance of a random linear code, to the case of generalized Hamming weights. We also adapt this algorithm to compute…
Binary Hashing is widely used for effective approximate nearest neighbors search. Even though various binary hashing methods have been proposed, very few methods are feasible for extremely high-dimensional features often used in visual…
We describe an algorithm to find maximal exact matches (MEMs) among HiFi reads with homopolymer errors. The main novelty in our work is that we resort to run-length compression to help deal with errors. Our method receives as input a…
We have recently developed a canonical transformation of the Hubbard and related models, valid for systems of arbitrary size and for the full plane; this is particularly suited to study hole pairing. In this work we show that exact…
We demonstrate the importance of symmetries in Variational Quantum Eigensolver (VQE) algorithms to prepare the ground or specific low-lying states of quantum Hamiltonians. We examine two spin problems, one with random all-to-all couplings…
In this paper, we give a quadratic Goldreich-Levin algorithm that is close to optimal in the following ways. Given a bounded function $f$ on the Boolean hypercube $\mathbb{F}_2^n$ and any $\varepsilon>0$, the algorithm returns a quadratic…
Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data. Quantum kernels are able to capture relationships in the data that are not…
Maintaining the pair similarity relationship among originally high-dimensional data into a low-dimensional binary space is a popular strategy to learn binary codes. One simiple and intutive method is to utilize two identical code matrices…
We present evidence that crystalline Sr_2Cu(PO_4)_2 is a nearly perfect one-dimensional (1D) spin-1/2 anti-ferromagnetic Heisenberg model (AHM) chain compound with nearest neighbor only exchange. We undertake a broad theoretical study of…