scholarly journals Quantum Inductive Learning and Quantum Logic Synthesis

2000 ◽  
Author(s):  
Martin Lukac
Keyword(s):  
Quantum Logic ◽  
Inductive Learning ◽  
Logic Synthesis ◽  
Quantum Logic Synthesis

scholarly journals Quantum-Logic Synthesis of Hermitian Gates

2016 ◽  
Vol 12 (4) ◽  
pp. 1-15 ◽  
Author(s):  
Mona Arabzadeh ◽  
Mahboobeh Houshmand ◽  
Mehdi Sedighi ◽  
Morteza Saheb Zamani
Keyword(s):  
Quantum Logic ◽  
Logic Synthesis ◽  
Quantum Logic Synthesis

FTQLS: Fault-Tolerant Quantum Logic Synthesis

2014 ◽  
Vol 22 (6) ◽  
pp. 1350-1363 ◽  
Author(s):  
Chia-Chun Lin ◽  
Amlan Chakrabarti ◽  
Niraj K. Jha
Keyword(s):  
Quantum Logic ◽  
Fault Tolerant ◽  
Logic Synthesis ◽  
Quantum Logic Synthesis

scholarly journals Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis

2020 ◽  
pp. 213-229
Author(s):  
Jiaqing Jiang ◽  
Xiaoming Sun ◽  
Shang-Hua Teng ◽  
Bujiao Wu ◽  
Kewen Wu ◽  
...  
Keyword(s):  
Quantum Logic ◽  
Logic Synthesis ◽  
Trade Off ◽  
Quantum Logic Synthesis ◽  
Optimal Space

scholarly journals Block-based quantum-logic synthesis

2011 ◽  
Vol 11 (3&4) ◽  
pp. 262-277
Author(s):  
Mehdi Saeedi ◽  
Mona Arabzadeh ◽  
Morteza Saheb Zamani ◽  
Mehdi Sedighi
Keyword(s):  
Quantum Logic ◽  
Nearest Neighbor ◽  
Synthesis Method ◽  
Logic Synthesis ◽  
Quantum Circuit ◽  
Basic Block ◽  
Synthesis Methods ◽  
Quantum Logic Synthesis ◽  
Block Based ◽  
Arbitrary Quantum

In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of $l$ is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of $\frac{5}{3}$ if the nearest neighbor interaction is applied.

scholarly journals Inductive learning of quantum behaviors

2007 ◽  
Vol 20 (3) ◽  
pp. 561-586 ◽  
Author(s):  
Martin Lukac ◽  
Marek Perkowski
Keyword(s):  
Inductive Learning ◽  
Logic Synthesis ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Not Given ◽  
Single Output ◽  
New Concepts ◽  
Inductive Machine Learning ◽  
Automated Methods ◽  
Synthesis Approach

In this paper studied are new concepts of robotic behaviors - deterministic and quantum probabilistic. In contrast to classical circuits, the quantum circuit can realize both of these behaviors. When applied to a robot, a quantum circuit controller realizes what we call quantum robot behaviors. We use automated methods to synthesize quantum behaviors (circuits) from the examples (examples are cares of the quantum truth table). The don't knows (minterms not given as examples) are then converted not only to deterministic cares as in the classical learning, but also to output values generated with various probabilities. The Occam Razor principle, fundamental to inductive learning, is satisfied in this approach by seeking circuits of reduced complexity. This is illustrated by the synthesis of single output quantum circuits, as we extended the logic synthesis approach to Inductive Machine Learning for the case of learning quantum circuits from behavioral examples.

Transfer of Interleaving Benefits in the Inductive Learning of Categories

2011 ◽  
Author(s):  
Monica S. Birnbaum ◽  
Robert A. Bjork ◽  
Elizabeth Ligon Bjork
Keyword(s):  
Inductive Learning
Sign in / Sign up

Export Citation Format

Share Document