Related papers: The Golden Ratio Encoder
The beta-encoder was recently proposed as a quantization scheme for analog-to-digital conversion; in contrast to classical binary quantization, in which each analog sample x in [-1,1] is mapped to the first N bits of its base-2 expansion,…
A new class of analog-to-digital (A/D) and digital-to-analog (D/A) converters using a flaky quantiser, called the $\beta$-encoder, has been shown to have exponential bit rate accuracy while possessing a self-correction property for…
In this paper, we introduce two golden ratio algorithms with new stepsize rules for solving pseudomonotone and Lipschitz variational inequalities in finite dimensional Hilbert spaces. The presented stepsize rules allow the resulting…
Software methods introduced for automated design of approximate implementations of arithmetic circuits rely on fast and accurate evaluation of approximate candidate implementations. To accelerate the evaluation of circuit error, we propose…
The paper presents a fully explicit algorithm for monotone variational inequalities. The method uses variable stepsizes that are computed using two previous iterates as an approximation of the local Lipschitz constant without running a…
It is well known that the mutual information between two random variables can be expressed as the difference of two relative entropies that depend on an auxiliary distribution, a relation sometimes referred to as the golden formula. This…
We improve the understanding of the $\textit{golden ratio algorithm}$, which solves monotone variational inequalities (VI) and convex-concave min-max problems via the distinctive feature of adapting the step sizes to the local Lipschitz…
In this paper, we establish the $R$-linear rate of convergence of a golden ratio algorithm for solving an equilibrium problem in a Hilbert space. Several experiments are performed to show the numerical behavior of the algorithm and also to…
We consider the problem of transmission of a sequence of real data produced by a Nyquist sampled band-limited analog source over a band-limited analog channel, which introduces an additive white Gaussian noise. An analog coding scheme is…
It is a well known result that for $\beta\in(1,\frac{1+\sqrt{5}}{2})$ and $x\in(0,\frac{1}{\beta-1})$ there exists uncountably many $(\epsilon_{i})_{i=1}^{\infty}\in {0,1}^{\mathbb{N}}$ such that…
In this paper, we design a new iterative algorithm for solving pseudomonotone equilibrium problems in real Hilbert spaces. The advantage of our algorithm is that it requires only one strongly convex programming problem at each iteration.…
We introduce a hardware-specific, problem-dependent digital-analog quantum algorithm of a counterdiabatic quantum dynamics tailored for optimization problems. Specifically, we focus on trapped-ion architectures, taking advantage from global…
The golden code is a full-rate full-diversity space-time code for two transmit antennas that has a maximal coding gain. Because each codeword conveys four information symbols from an M-ary quadrature-amplitude modulation alphabet, the…
In Analog-to-digital (A/D) conversion, signal decimation has been proven to greatly improve the efficiency of data storage while maintaining high accuracy. When one couples signal decimation with the $\Sigma\Delta$ quantization scheme, the…
Traditional quantum metrology assesses precision using the figures of merit of continuous-valued parameter estimation. Recently, quantum digital estimation was introduced: it evaluates the performance information-theoretically by…
In Analog-to-digital (A/D) conversion, signal decimation has been proven to greatly improve the efficiency of data storage while maintaining high accuracy. When one couples signal decimation with the $\Sigma\Delta$ quantization scheme, the…
In this paper an explicit algorithm is proposed for solving an equilibrium problem whose associated bifunction is pseudomonotone and satisfies a Lipschitz-type condition. Contrary to many algorithms, our algorithm is done without using…
The $\beta$-encoder is an analog circuit that converts an input signal $x \in [0,1]$ into a finite bit stream $\{b_i\}$. The bits $\{b_i\}$ are correlated and therefore are not immediately suitable for random number generation, but they can…
We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\binom{n}{k}$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression of degree…
Quantum circuit cutting has emerged as a promising method for simulating large quantum circuits using a collection of small quantum machines. Running low-qubit "circuit fragments" not only overcomes the size limitation of near-term…