Quantum Circuit Simplification and Level Compaction
نویسندگان
چکیده
منابع مشابه
Quantum Circuit Simpli£cation and Level Compaction
Quantum circuits are time dependent diagrams describing the process of quantum computation. Every (quantum) algorithm must be mapped into a quantum circuit to be able to run it on a quantum hardware. Optimal synthesis of quantum circuits is intractable and heuristic methods must be employed, resulting in non-optimal circuit speci£cations. In this paper, we consider the use of local optimization...
متن کاملQuantum Circuit Simplification Using Templates
The synthesis of quantum circuits is a complex problem even for circuits with a small number of lines. At present, optimal synthesis is intractable and heuristic methods must be employed. In this paper, we consider the use of templates to simplify a quantum circuit initially found by other means. The templates tool presented here is a general approach to reversible and quantum circuit simplific...
متن کاملCircuit/Device Modeling at the Quantum Level
Quantum mechanical (QM) effects, which manifest when the device dimensions are comparable to the de Brogile wavelength, are becoming common physical phenomena in the current micro-/nano-meter technology era. While most novel devices take advantage of QM effects to achieve fast switching speed, miniature size, and extremely small power consumption, the mainstream CMOS devices (with the exception...
متن کاملFast Algorithms for Static Compaction of Sequential Circuit Test Vectors
Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states, and some states are frequently re-visited throughout the application of a test set. Subse-quences that start and end on the same states may be removed if necessary and suucient conditions are met for...
متن کاملFast Static Compaction Algorithms for Sequential Circuit Test Vectors
ÐTwo fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states and some states are frequently revisited throughout the application of a test set. Subsequences that start and end on the same states may be removed if necessary and if sufficient conditions are met ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 2008
ISSN: 0278-0070,1937-4151
DOI: 10.1109/tcad.2007.911334