Multipartite table methods

International audienceA unified view of most previous table-lookup-and-addition methods (bipartite tables, SBTM, STAM, and multipartite methods) is presented. This unified view allows a more accurate computation of the error entailed by these methods, which enables a wider design space exploration, leading to tables smaller than the best previously published ones by up to 50 percent. The synthesis of these multipartite architectures on Virtex FPGAs is also discussed. Compared to other methods involving multipliers, the multipartite approach offers the best speed/area tradeoff for precisions up to 16 bits. A reference implementation is available at www.ens-lyon.fr/LIP/Arenaire/

An efficient hardware logarithm generator with modified quasi-symmetrical approach for digital signal processing

This paper presents a low-error, low-area FPGA-based hardware logarithm generator for digital signal processing systems which require high-speed, real time logarithm operations. The proposed logarithm generator employs the modified quasi-symmetrical approach for an efficient hardware implementation. The error analysis and implementation results are also presented and discussed. The achieved results show that the proposed approach can reduce the approximation error and hardware area compared with traditional methods

Optimized linear, quadratic and cubic interpolators for elementary function hardware implementations

This paper presents a method for designing linear, quadratic and cubic interpolators that compute elementary functions using truncated multipliers, squarers and cubers. Initial coefficient values are obtained using a Chebyshev series approximation. A direct search algorithm is then used to optimize the quantized coefficient values to meet a user-specified error constraint. The algorithm minimizes coefficient lengths to reduce lookup table requirements, maximizes the number of truncated columns to reduce the area, delay and power of the arithmetic units, and minimizes the maximum absolute error of the interpolator output. The method can be used to design interpolators to approximate any function to a user-specified accuracy, up to and beyond 53-bits of precision (e.g., IEEE double precision significand). Linear, quadratic and cubic interpolator designs that approximate reciprocal, square root, reciprocal square root and sine are presented and analyzed. Area, delay and power estimates are given for 16, 24 and 32-bit interpolators that compute the reciprocal function, targeting a 65 nm CMOS technology from IBM. Results indicate the proposed method uses smaller arithmetic units and has reduced lookup table sizes compared to previously proposed methods. The method can be used to optimize coefficients in other systems while accounting for coefficient quantization as well as truncation and rounding effects of multiple arithmetic units.Peer reviewedElectrical and Computer Engineerin

Entanglement generation and self-correcting quantum memories

Building a working quantum computer that is able to perform useful calculations remains a challenge. With this thesis, we are trying to contribute a small piece to this puzzle by addressing three of the many fundamental questions one encounters along the way of reaching that goal. These questions are: (i) What is an easy way to create highly entangled states as a resource for quantum computation? (ii) What can we do to efficiently quantify states of noisy entanglement in systems coupled to the outside world? (iii) How can we protect and store fragile quantum states for arbitrary long times? The first two questions are the subject of part one of this thesis, `Entanglement Measures & Highly Entangled States'. We devise a particular proposal for generating entanglement within a solid-state setup, starting first with the tripartite case and continuing with a generalization to four and more qubits. The main idea there is to realize systems with highly entangled ground states in order for entanglement to be created by merely cooling to low enough temperatures. We have addressed the issue of quantifying entanglement in these systems by numerically calculating mixed-state entanglement measures and maximizing the latter as a function of the external magnetic field strength. The research along these lines has led to the development of the numerical library 'libCreme'. The second part of the thesis, 'Self-Correcting Quantum Memories', addresses the question how to reliably store quantum states long enough to perform useful calculations. Every computer, be it classical or quantum, needs the information it processes to be protected from corruption caused by faulty gates and perturbations from interactions with its environment. However, quantum states are much more susceptible to these adverse effects than classical states, making the manipulation and storage of quantum information a challenging task. Promising candidates for such 'quantum memories' are systems exhibiting topological order, because they are robust against local perturbations, and information encoded in their ground state can only be manipulated in a non-local fashion. We extend the so-called toric code by repulsive long-range interactions between anyons and show that this makes the code stable against thermal fluctuations. Furthermore, we investigate incoherent effects of quenched disorder in the toric code and similar systems