115 research outputs found
Scalable Design and Synthesis of Reversible Circuits
The expectations on circuits are rising with their number of applications, and technologies alternative to CMOS are becoming more important day by day. A promising alternative is reversible computation, a computing paradigm with applications in quantum computation, adiabatic circuits, program inversion, etc. An elaborated design flow is not available to reversible circuit design yet. In this work, two directions are considered: Exploiting the conventional design flow and developing a new flow according to the properties of reversible circuits. Which direction should be taken is not obvious, so we discuss the possible assets and drawbacks of taking either direction. We present ideas which can be exploited and outline open challenges which still have to be addressed. Preliminary results obtained by initial implementations illustrate the way to go. By this we present and discuss two promising and complementary directions for the scalable design and synthesis of reversible circuits
Improved reversible and quantum circuits for Karatsuba-based integer multiplication
Integer arithmetic is the underpinning of many quantum algorithms, with applications ranging from Shor\u27s algorithm over HHL for matrix inversion to Hamiltonian simulation algorithms. A basic objective is to keep the required resources to implement arithmetic as low as possible. This applies in particular to the number of qubits required in the implementation as for the foreseeable future this number is expected to be small. We present a reversible circuit for integer multiplication that is inspired by Karatsuba\u27s recursive method. The main improvement over circuits that have been previously reported in the literature is an asymptotic reduction of the amount of space required from O(n^1.585) to O(n^1.427). This improvement is obtained in exchange for a small constant increase in the number of operations by a factor less than 2 and a small asymptotic increase in depth for the parallel version. The asymptotic improvement are obtained from analyzing pebble games on complete ternary trees
Developing and applying heterogeneous phylogenetic models with XRate
Modeling sequence evolution on phylogenetic trees is a useful technique in
computational biology. Especially powerful are models which take account of the
heterogeneous nature of sequence evolution according to the "grammar" of the
encoded gene features. However, beyond a modest level of model complexity,
manual coding of models becomes prohibitively labor-intensive. We demonstrate,
via a set of case studies, the new built-in model-prototyping capabilities of
XRate (macros and Scheme extensions). These features allow rapid implementation
of phylogenetic models which would have previously been far more
labor-intensive. XRate's new capabilities for lineage-specific models,
ancestral sequence reconstruction, and improved annotation output are also
discussed. XRate's flexible model-specification capabilities and computational
efficiency make it well-suited to developing and prototyping phylogenetic
grammar models. XRate is available as part of the DART software package:
http://biowiki.org/DART .Comment: 34 pages, 3 figures, glossary of XRate model terminolog
The Compilation of Reversible Circuits and a New Optimization Game
The focus of this thesis is reversible circuit compilation.
We will explore the use of pebble games for circuit analysis. The usefulness of this
technique is demonstrated by finding a new space bound for the Karatsuba algorithm and
more generally for any similar algorithm based on recurrence relations. A new pebble game
based on the reversible pebble game which better captures the use of in-place operations is
also presented. We also construct circuit to compute trigonometric functions based on the
CORDIC algorithm and analyze it using this game
Formal Methods in Quantum Circuit Design
The design and compilation of correct, efficient quantum circuits is integral to the future operation of quantum computers. This thesis makes contributions to the problems of optimizing and verifying quantum circuits, with an emphasis on the development of formal models for such purposes. We also present software implementations of these methods, which together form a full stack of tools for the design of optimized, formally verified quantum oracles.
On the optimization side, we study methods for the optimization of Rz and CNOT gates in Clifford+Rz circuits. We develop a general, efficient optimization algorithm called phase folding, which reduces the number of Rz gates without increasing any metrics by computing its phase polynomial. This algorithm can further be combined with synthesis techniques for CNOT-dihedral operators to optimize circuits with respect to particular costs. We then study the optimal synthesis problem for CNOT-dihedral operators from the perspectives of Rz and CNOT gate optimization. In the case of Rz gate optimization, we show that the optimal synthesis problem is polynomial-time equivalent to minimum-distance decoding in certain Reed-Muller codes. For the CNOT optimization problem, we show that the optimal synthesis problem is at least as hard as a combinatorial problem related to Gray codes. In both cases, we develop heuristics for the optimal synthesis problem, which together with phase folding reduces T counts by 42% and CNOT counts by 22% across a suite of real-world benchmarks.
From the perspective of formal verification, we make two contributions. The first is the development of a formal model of quantum circuits with ancillary bits based on the Feynman path integral, along with a concrete verification algorithm. The path integral model, with some syntactic sugar, further doubles as a natural specification language for quantum computations. Our experiments show some practical circuits with up to hundreds of qubits can be efficiently verified. Our second contribution is a formally verified, optimizing compiler for reversible circuits. The compiler compiles a classical, irreversible language to reversible circuits, with a formal, machine-checked proof of correctness written in the proof assistant F*. The compiler is structured as a partial evaluator, allowing verification to be carried out significantly faster than previous results
Computing 256-bit Elliptic Curve Logarithm in 9 Hours with 126133 Cat Qubits
Cat qubits provide appealing building blocks for quantum computing. They
exhibit a tunable noise bias yielding an exponential suppression of bit-flips
with the average photon number and a protection against the remaining phase
errors can be ensured by a simple repetition code. We here quantify the cost of
a repetition code and provide a valuable guidance for the choice of a large
scale architecture using cat qubits by realizing a performance analysis based
on the computation of discrete logarithms on an elliptic curve with Shor's
algorithm. By focusing on a 2D grid of cat qubits with neighboring
connectivity, we propose to implement two-qubit gates via lattice surgery and
Toffoli gates with off-line fault-tolerant preparation of magic states through
projective measurements and subsequent gate teleportations. All-to-all
connectivity between logical qubits is ensured by routing qubits. Assuming a
ratio between single-photon and two-photon losses of and a cycle time
of 500 nanoseconds, we show concretely that such an architecture can compute
-bit elliptic curve logarithm in hours with 126133 cat qubits. We give
the details of the realization of Shor's algorithm so that the proposed
performance analysis can be easily reused to guide the choice of architecture
for others platforms.Comment: 4+34 pages, 32 figures, 5 table
- âŠ