There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Intermolecular And Surface Forces

http://user.it.uu.se/~jarst116/slides/week4.pdf

Graph-Based Algorithms for Boolean Function Manipulation

A practical quantum computer must not merely store information, but also process it. To prevent errors introduced by noise from multiplying and spreading, a fault-tolerant computational architecture is required. Current experiments are taking the first steps toward noise-resilient logical qubits. But to convert these quantum devices from memories to processors, it is necessary to specify how a universal set of gates is performed on them. The leading proposals for doing so, such as magic-state distillation and colour-code techniques, have high resource demands. Alternative schemes, such as those that use high-dimensional quantum codes in a modular architecture, have potential benefits, but need to be explored further.

/pdf/roads-towards-fault-tolerant-universal-quantum-computation-4c57b0upnl.pdf

Roads towards fault-tolerant universal quantum computation

Optimization for structural crashworthiness and energy absorption has become an important topic of research attributable to its proven benefits to public safety and social economy. This paper provides a comprehensive review of the important studies on design optimization for structural crashworthiness and energy absorption. First, the design criteria used in crashworthiness and energy absorption are reviewed and the surrogate modeling to evaluate these criteria is discussed. Second, multiobjective optimization, optimization under uncertainties and topology optimization are reviewed from concepts, algorithms to applications in relation to crashworthiness. Third, the crashworthy structures are summarized, from generically novel structural configurations to industrial applications. Finally, some conclusions and recommendations are provided to enable academia and industry to become more aware of the available capabilities and recent developments in design optimization for structural crashworthiness and energy absorption.

On design optimization for structural crashworthiness and its state of the art

Reversible logic has applications in various research areas, including signal processing, cryptography and quantum computation. In this article, direct NCT-based synthesis of a given k-cycle in a cycle-based synthesis scenario is examined. To this end, a set of seven building blocks is proposed that reveals the potential of direct synthesis of a given permutation to reduce both quantum cost and average runtime. To synthesize a given large cycle, we propose a decomposition algorithm to extract the suggested building blocks from the input specification. Then, a synthesis method is introduced that uses the building blocks and the decomposition algorithm. Finally, a hybrid synthesis framework is suggested that uses the proposed cycle-based synthesis method in conjunction with one of the recent NCT-based synthesis approaches which is based on Reed-Muller (RM) spectra.The time complexity and the effectiveness of the proposed synthesis approach are analyzed in detail. Our analyses show that the proposed hybrid framework leads to a better quantum cost in the worst-case scenario compared to the previously presented methods. The proposed framework always converges and typically synthesizes a given specification very fast compared to the available synthesis algorithms. Besides, the quantum costs of benchmark functions are improved about 20p on average (55p in the best case).

Reversible circuit synthesis using a cycle-based approach

In this paper, a new non-search based synthesis algorithm for reversible circuits is proposed. Compared with the widely used search-based methods, our algorithm is guaranteed to produce a result and can lead to a solution with much fewer steps. To evaluate the proposed method, several circuits taken from the literature are used. The experimental results corroborate the expected findings.

A novel synthesis algorithm for reversible circuits

A library-based synthesis methodology for reversible logic

Using an atomic force microscope we performed measurements of the Casimir force between a gold- coated (Au) microsphere and doped silicon carbide (SiC) samples. The last of these is a promising material for devices operating under severe environments. The roughness of the interacting surfaces was measured to obtain information for the minimum separation distance upon contact. Ellipsometry data for both systems were used to extract optical properties needed for the calculation of the Casimir force via the Lifshitz theory and for comparison to the experiment. Special attention is devoted to the separation of the electrostatic contribution to the measured total force. Our measurements demonstrate large contact potential ${\mathrm{V}}_{0}\phantom{\rule{0.16em}{0ex}}(\ensuremath{\approx}0.67\phantom{\rule{0.16em}{0ex}}\mathrm{V})$, and a relatively small density of charges trapped in SiC. Knowledge of both Casimir and electrostatic forces between interacting materials is not only important from the fundamental point of view, but also for device applications involving actuating components at separations of less than 200 nm where surface forces play dominant role.

Casimir force measurements from silicon carbide surfaces

In this paper, the behavior of substitution-based reversible circuit synthesis methods is studied. We analyze one of the most recent search-based synthesis algorithms to improve its quality by adding some new non-trivial substitutions. Furthermore, it is shown that the order of factor substitution affects the depth of search tree significantly. In addition, we consider the number of terms in positive polarity Reed-Muller (PPRM) expansions during factor substitution to show that some local increases in the number of terms may lead to better final synthesis results. Besides, the behavior of depth-first search (DFS) and breadth-first search (BFS) synthesis algorithms are investigated. It is demonstrated that BFS has more effects on the quality of results and sometimes leads to shorter runtime. Based on these properties, a new hybrid DFS/BFS synthesis algorithm is proposed. Our experiments show the efficiency of this algorithm

https://www.computer.org/csdl/pds/api/csdl/proceedings/download-article/12OmNqJq4wu/pdf

Mehdi Sedighi

Papers

Reversible circuit synthesis using a cycle-based approach

A novel synthesis algorithm for reversible circuits

A library-based synthesis methodology for reversible logic

Casimir force measurements from silicon carbide surfaces

On the Behavior of Substitution-based Reversible Circuit Synthesis Algorithms: Investigation and Improvement