On circuit decomposition of planar Eulerian graphs

The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.

Download Full-text

Two-connected orientations of Eulerian graphs

Journal of Graph Theory ◽

10.1002/jgt.20158 ◽

2006 ◽

Vol 52 (3) ◽

pp. 230-242 ◽

Cited By ~ 8

Author(s):

Alex R. Berg ◽

Tibor Jordán

Keyword(s):

Eulerian Graphs

Download Full-text

Modal circuit decomposition of lossy multiconductor transmission lines

IEEE Transactions on Microwave Theory and Techniques ◽

10.1109/22.508637 ◽

1996 ◽

Vol 44 (7) ◽

pp. 1046-1056 ◽

Cited By ~ 10

Author(s):

M. AbuShaaban ◽

S.O. Scanlan

Keyword(s):

Transmission Lines ◽

Multiconductor Transmission Lines ◽

Circuit Decomposition

Download Full-text

Traversing Graphs

The Fascinating World of Graph Theory ◽

10.23943/princeton/9780691175638.003.0005 ◽

2017 ◽

Author(s):

Arthur Benjamin ◽

Gary Chartrand ◽

Ping Zhang

Keyword(s):

Chinese Postman Problem ◽

Round Trip ◽

Eulerian Graphs ◽

Bridge Problem ◽

Chinese Postman ◽

Leonhard Euler ◽

The City ◽

East Prussia

This chapter considers Eulerian graphs, a class of graphs named for the Swiss mathematician Leonhard Euler. It begins with a discussion of the the Königsberg Bridge Problem and its connection to Euler, who presented the first solution of the problem in a 1735 paper. Euler showed that it was impossible to stroll through the city of Königsberg, the capital of German East Prussia, and cross each bridge exactly once. He also mentioned in his paper a problem whose solution uses the geometry of position to which Gottfried Leibniz had referred. The chapter concludes with another problem, the Chinese Postman Problem, which deals with minimizing the length of a round-trip that a letter carrier might take.

Download Full-text

Research on Intelligent Fault Diagnosis Technique of Complex Equipment

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.945-949.1098 ◽

2014 ◽

Vol 945-949 ◽

pp. 1098-1101

Author(s):

Rui Zhu ◽

Ming Ji Huang ◽

Guo Bao Ding ◽

Shuai Jia

Keyword(s):

Fault Diagnosis ◽

Decision Tree ◽

Intelligent Fault Diagnosis ◽

Intelligent Diagnosis ◽

Complex Equipment ◽

Circuit Decomposition ◽

Diagnosis Technique

Aiming at the actual demand of complex equipment fault diagnosis, this paper made the fault intelligent diagnosis technology of a certain type of equipment as research object, analyzed the characteristics of equipment and its faults, presented four strategy to solve the problem: Circuit-decomposition, the decision tree, confirm key component using FMECA and establish model by PSPICE.And proving it by actual circuit.

Download Full-text

Subsemi-Eulerian graphs

International Journal of Mathematics and Mathematical Sciences ◽

10.1155/s0161171282000520 ◽

1982 ◽

Vol 5 (3) ◽

pp. 553-564 ◽

Cited By ~ 2

Author(s):

Charles Suffel ◽

Ralph Tindell ◽

Cynthia Hoffman ◽

Manachem Mandell

Keyword(s):

Eulerian Graphs ◽

Related Notion ◽

Minimum Number ◽

Eulerian Graph

A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian.In this paper, we consider the related notion of a subsemi-eulerian graph, i.e. a graph which is spanned by a supergraph having an open trail containing all of its lines. The subsemi-eulerian graphs are characterized and formulas for the minimum number of required additional lines are given. Interrelationships between the two problems are stressed as well.

Download Full-text