Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Inspired by NatureUsing Reed-Muller Expansions in the Synthesis and Optimization of Boolean Quantum Circuits

Inspired by Nature: Using Reed-Muller Expansions in the Synthesis and Optimization of Boolean... [There have been efforts to find an automatic way to create efficient Boolean quantum circuits, because of their wide range of applications. This chapter shows how to build efficient Boolean quantum circuits. A direct synthesis method can be used to implement any Boolean function as a quantum circuit using its truth table, where the generated circuits are more efficient than ones generated using methods proposed by others. The chapter shows, using another method, that there is a direct correspondence between Boolean quantum operations and the classical Reed-Muller expansions. This relation makes it possible for the problem of synthesis and optimization of Boolean quantum circuits to be tackled within the domain of Reed-Muller logic under manufacturing constraints, for example, the interaction between qubits of the system.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Inspired by NatureUsing Reed-Muller Expansions in the Synthesis and Optimization of Boolean Quantum Circuits

Part of the Emergence, Complexity and Computation Book Series (volume 28)
Editors: Stepney, Susan; Adamatzky, Andrew
Inspired by Nature — Oct 27, 2017

Loading next page...
 
/lp/springer-journals/inspired-by-nature-using-reed-muller-expansions-in-the-synthesis-and-VkOIbkEHSI
Publisher
Springer International Publishing
Copyright
© Springer International Publishing AG 2018
ISBN
978-3-319-67996-9
Pages
113 –141
DOI
10.1007/978-3-319-67997-6_5
Publisher site
See Chapter on Publisher Site

Abstract

[There have been efforts to find an automatic way to create efficient Boolean quantum circuits, because of their wide range of applications. This chapter shows how to build efficient Boolean quantum circuits. A direct synthesis method can be used to implement any Boolean function as a quantum circuit using its truth table, where the generated circuits are more efficient than ones generated using methods proposed by others. The chapter shows, using another method, that there is a direct correspondence between Boolean quantum operations and the classical Reed-Muller expansions. This relation makes it possible for the problem of synthesis and optimization of Boolean quantum circuits to be tackled within the domain of Reed-Muller logic under manufacturing constraints, for example, the interaction between qubits of the system.]

Published: Oct 27, 2017

There are no references for this article.