Related papers: Energy, Latency, and Reliability Tradeoffs in Codi…
Surface codes exploit topological protection to increase error resilience in quantum computing devices and can in principle be implemented in existing hardware. They are one of the most promising candidates for active error correction, not…
We ask how much energy is required to weakly simulate an $n$-qubit quantum circuit (i.e., produce samples from its output distribution) by a unitary circuit in a hybrid qubit-oscillator model. The latter consists of a certain number of…
The log-normal type of turbulence energy spectral function, derived from the maximum entropy principle, is shown to be parameterizable in terms of root turbulence variables including the Reynolds number. The spectral function is first…
A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…
The computational complexity of optimum decoding for an orthogonal space-time block code G satisfying the orthogonality property that the Hermitian transpose of G multiplied by G is equal to a constant c times the sum of the squared symbols…
A scheme to achieve dense quantum coding for the quadrature amplitudes of the electromagnetic field is presented. The protocol utilizes shared entanglement provided by nondegenerate parametric down conversion in the limit of large gain to…
In order to build a large scale quantum computer, one must be able to correct errors extremely fast. We design a fast decoding algorithm for topological codes to correct for Pauli errors and erasure and combination of both errors and…
To date, a great deal of attention has focused on characterizing the performance of quantum error correcting codes via their thresholds, the maximum correctable physical error rate for a given noise model and decoding strategy. Practical…
Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…
Fault tolerance is a prerequisite for scalable quantum computing. Architectures based on 2D topological codes are effective for near-term implementations of fault tolerance. To obtain high performance with these architectures, we require a…
In this paper, we combine communication-theoretic laws with known, practically verified results from circuit theory. As a result, we obtain closed-form theoretical expressions linking fundamental system design and environment parameters…
Time-symmetric integration schemes share with symplectic schemes the property that their energy errors show a much better behavior than is the case for generic integration schemes. Allowing adaptive time steps typically leads to a loss of…
In large scale distributed linear transform problems, coded computation plays an important role to effectively deal with "stragglers" (distributed computations that may get delayed due to few slow or faulty processors). We propose a coded…
To enable fault tolerance on millions of qubits in real time, scalable decoding is necessary, which motivates this paper. Existing decoding algorithms (decoders), such as clustering, matching, belief propagation (BP), and neural networks,…
Software for computation of maximum likelihood estimates in linear structural equation models typically employs general techniques from non-linear optimization, such as quasi-Newton methods. In practice, careful tuning of initial values is…
Tensors are a fundamental operation in distributed computing, \emph{e.g.,} machine learning, that are commonly distributed into multiple parallel tasks for large datasets. Stragglers and other failures can severely impact the overall…
In this paper, we present a bit stream feature based energy model that accurately estimates the energy required to decode a given HEVC-coded bit stream. Therefore, we take a model from literature and extend it by explicitly modeling the…
\emph{Resistive memories}, such as \emph{phase change memories} and \emph{resistive random access memories} have attracted significant attention in recent years due to their better scalability, speed, rewritability, and yet non-volatility.…
Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error…
We develop and analyze a fault-tolerant quantum algorithm for computing $n$-th order response properties necessary for analysis of non-linear spectroscopies of molecular and condensed phase systems. We use a semi-classical description in…