Related papers: Efficient Magic State Cultivation on $\mathbb{RP}^…
Remote state preparation (RSP) is the act of preparing a quantum state at a remote location without actually transmitting the state itself. Using at most two classical bits and a single shared maximally entangled state, one can in theory…
High-fidelity logical magic states are a critical resource for fault-tolerant quantum computation, enabling non-Clifford logical operations through state injection. However, benchmarking these states presents significant challenges: one…
Topological color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Neither a two-dimensional nor a three-dimensional topology, however, can provide a universal gate set $\{$H, T, CNOT$\}$, with the…
To simulate the real- and imaginary-time evolution of a many-electron system on a quantum computer based on the first-quantized formalism, we need to encode molecular orbitals (MOs) into qubit states for typical initial-state preparation.…
State-constrained signal codes directly encode modulation signals using signal processing filters, the coefficients of which are constrained over the rings of formal power series. Although the performance of signal codes is defined by these…
The minimum spanning tree (MST) construction is a classical problem in Distributed Computing for creating a globally minimized structure distributedly. Self-stabilization is versatile technique for forward recovery that permits to handle…
SMC$^2$ is an efficient algorithm for sequential estimation and state inference of state-space models. It generates $N_{\theta}$ parameter particles $\theta^{m}$, and, for each $\theta^{m}$, it runs a particle filter of size $N_{x}$ (i.e.…
Stochastic computing (SC) is an emerging computing technique which offers higher computational density, and lower power over binary-encoded (BE) computation. Unlike BE computation, SC encodes values as probabilistic bitstreams which makes…
The quantum simulation of real molecules and materials is one of the most highly anticipated applications of quantum computing. Algorithms for simulating electronic structure using a first-quantized plane wave representation are especially…
In this paper, a new method is proposed to obtain full-diversity, rate-2 (rate of 2 complex symbols per channel use) space-time block codes (STBCs) that are full-rate for multiple input, double output (MIDO) systems. Using this method,…
Magic states are the resource that allows quantum computers to attain an advantage over classical computers. This resource consists in the deviation from a property called stabilizerness which in turn implies that stabilizer circuits can be…
The concrete efficiency of secure computation has been the focus of many recent works. In this work, we present concretely-efficient protocols for secure $3$-party computation (3PC) over a ring of integers modulo $2^{\ell}$ tolerating one…
State Space Models (SSMs) have emerged as a compelling alternative to attention models for long-range vision tasks, offering input-dependent recurrence with linear complexity. However, most efficient SSM variants reduce computation cost by…
Human spatiotemporal behavior simulation is critical for urban planning research, yet traditional rule-based and statistical approaches suffer from high computational costs, limited generalizability, and poor scalability. While large…
Accurate mathematical reasoning with Large Language Models (LLMs) is crucial in revolutionizing domains that heavily rely on such reasoning. However, LLMs often encounter difficulties in certain aspects of mathematical reasoning, leading to…
We construct quantum codes that support transversal $CCZ$ gates over qudits of arbitrary prime power dimension $q$ (including $q=2$) such that the code dimension and distance grow linearly in the block length. The only previously known…
We construct rotated logical states by applying rotation operators to stabilizer states, extending the logical basis and modifying stabilizer generators. Rotation operators affect the effective code distance $d_R$, which decays…
In fault-tolerant quantum computation, the preparation of logical states is a ubiquitous subroutine, yet significant challenges persist even for the simplest states required. In the present work, we present a unitary, scalable,…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
In recent years, surface codes have become a leading method for quantum error correction in theoretical large scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural…