Fault-tolerant, high-level quantum circuits: form, compilation and description
نویسندگان
چکیده
منابع مشابه
Fault Tolerant Planning: Complexity and Compilation
In the context of modeling and reasoning about agent actions, contingent and classical planning can often be respectively seen as adopting “extreme pessimism” and “extreme optimism” about the action outcomes. For many everyday scenarios of human reasoning (and thus for many types of autonomous systems), both these approaches are just too extreme. Following Jensen, Veloso, and Bryant (2004), we ...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملFault-tolerant adder design in quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are an emerging technology and a possible alternative for faster speed, smaller size, and low power consumption than semiconductor transistor based technologies. Previously, adder designs based on conventional designs were examined for implementation with QCA technology. This paper utilizes the QCA characteristics to design a fault-tolerant adder that is more...
متن کاملFault-Tolerant Quantum Computers
Quantum computation is a recently-introduced and novel computing technique which is based on quantum mechanics rather than classical physics. Its starting point is the notion of a quantum bit or “qubit”. Because of the superposition property of quantum states, n qubits can store 2 n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms ...
متن کاملFault-Tolerant Quantum Computation
It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, making long computations impossible. A further...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Science and Technology
سال: 2017
ISSN: 2058-9565
DOI: 10.1088/2058-9565/aa66eb