On Efficient Universal Quantum Circuits (システム数理と応用)

概要

論文の詳細を見る
The universal circuit has been studied in the literatures as a programmable quantum circuit. This paper shows an optimal universal quantum circuit for a family of quantum circuits with bounded size.
一般社団法人電子情報通信学会の論文
2011-11-10

著者

Ueno Shuichi
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
Ueno Shuichi
東工大
Yamada Tomoki
Department Of Applied Chemistry Faculty Of Science And Engineering Kinki University
Tayu Satoshi
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
Tayu Satoshi
Department Of Communication And Integrated Systems Tokyo Institute Of Technology
Ueno Shuichi
Department Of Biological Science Faculty Of Science Yamaguchi University

関連論文

Inhibition of Helicobacter pylori Motility by (+)-Syringaresinol from Unripe Japanese Apricot(Medicinal Chemistry)
A Note on Two Problems of Nano-PLA Design
A Note on Two Problems of Nano-PLA Design
A Note on Two Problems of Nano-PLA Design
A-1-28 A Note on a Problem of Nano-PLA Design
On the Complexity of Fault Testing for Reversible Circuits
A-1-26 On the Complexity of Fault Testing for Reversible Circuits
A-1-8 Bandwidth of Convex Bipartite Graphs
A-1-8 Characterizations of Two-Directional Orthogonal Ray Graphs
Orthogonal ray graphs and nano-PLA design (コンカレント工学)
Orthogonal ray graphs and nano-PLA design (回路とシステム)
On orthogonal ray graphs (アルゴリズム)
On Orthogonal Ray Graphs with Applications to NanoPLA Design : Extended Abstract
On Orthogonal Ray Graphs with Applications to NanoPLA Design : Extended Abstract
On Orthogonal Ray Graphs with Applications to NanoPLA Design : Extended Abstract
On the permutation routing in all-optical caterpillar networks (回路とシステム)
On the permutation routing in all-optical caterpillar networks (コンカレント工学)
On the Complexity of Three-Dimensional Orthogonal Face Routing
On the complexity of three-dimensional orthogonal face routing (回路とシステム)
A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems(Algorithms and Data Structures)
On the Three-Dimensional Orthogonal Drawing of Series-Parallel Graphs
A-1-27 On the Three-Dimensional Layout of Butterfly Networks
On the Orthogonal Drawing of Outerplanar Graphs(Graphs and Networks)
A-1-31 A Note on Sparse Networks Tolerating Random Faults for Cycles(A-1. 回路とシステム, 基礎・境界)
On the Orthogonal Drawing of Series-Parallel Graphs
On the Three-Dimensional Channel Routing
Genetic polymorphisms of serotonin and dopamine transporters in mental disorders
Minimal Forbidden Minors for the Family of Graphs with Proper-Path-Width at Most Two
Universal Graphs for Graphs with Bounded Path-Width
On the Proper-Path-Decomposition of Trees
A Linear Time Algorithm for Constructing Proper-Path-Decomposition of Width Two
A-1-25 On Efficient Universal Quantum Circuits
Universal test sets for reversible circuits (コンカレント工学)
Universal test sets for reversible circuits (回路とシステム)
A-1-14 Fault Testing for Linear Reversible Circuits
On Fault Testing for Reversible Circuits
On the fault testing for reversible circuits (アルゴリズム)
A Note on the Implementation of de Bruijn Networks by the Optical Transpose Interconnection System(Graphs and Networks)
AS-1-2 Lower Bounds for the Height of Three-Dimensional Channel Routing
On Two Problems of Nano-PLA Design
On the energy-aware mapping for NoCs (回路とシステム)
A-1-21 A Note on the Three-Dimensional Single-Active-Layer Routing
A-1-7 Universal Test Sets for Reversible Circuits
A-1-30 On the Three-Dimensional Single-Active-Layer Routing with Dual Channels
A-1-13 Universal Reversible Circuits
A-1-7 On the Complexity of Three-Dimensional Orthogonal Face Routing
On the three-dimensional orthogonal drawing of outerplanar graphs (extended abstract) (アルゴリズム)
On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs : Extended Abstract
On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs : Extended Abstract
On the Three-Dimensional Orthogonal Drawing of Outerplanar Graphs : Extended Abstract
On the three-dimensional single-active-layer routing (回路とシステム)
An Efficient Quantum Addition Circuit : Extended Abstract
An Efficient Quantum Addition Circuit : Extended Abstract
An Efficient Quantum Addition Circuit : Extended Abstract
On the three-dimensional single-active-layer routing (コンカレント工学)
A-1-32 A Note on Fault Testing for Reversible Circuits
Efficient Embeddings of Binary Trees with Bounded Proper Pathwidth into Paths and Grids
The Complexity of Three-Dimensional Channel Routing
AS-1-3 Three-Dimensional Channel Routing is in NP
A-1-30 A Note on the Three-Dimensional Channel Routing(A-1. 回路とシステム, 基礎・境界)
The Complexity of Three-Dimensional Channel Routing
A-1-20 On the Quantum Query Complexity of All-Pairs Shortest Paths
The Complexity of Three-Dimensional Channel Routing
AS-1-4 On the Three-Dimensional Layout of Hypercubes
AS-1-1 The Complexity of Fault Testing for Reversible Circuits
A-1-14 A Note on the Maximum Balanced Biclique Problem
A-1-13 A Note on the Subtree Isomorphism Problem
On Efficient Universal Quantum Circuits (回路とシステム)
On Efficient Universal Quantum Circuits (システム数理と応用)
On the Complexity of Energy-Aware Mapping for NoCs (信号処理)
On the Complexity of Energy-Aware Mapping for NoCs (回路とシステム)
On the Complexity of Energy-Aware Mapping for NoCs (通信方式)
On Minimum Feedback Vertex Sets in Graphs (システム数理と応用)
On Minimum Feedback Vertex Sets in Graphs (信号処理)
On Minimum Feedback Vertex Sets in Graphs (VLSI設計技術)
On Minimum Feedback Vertex Sets in Graphs (回路とシステム)
A-1-35 Minimum Feedback Vertex Sets in Permutation Bigraphs
A-1-34 On the Complexity of Energy-Aware Mapping for NoCs
On Efficient Universal Quantum Circuits (回路とシステム)
On Efficient Universal Quantum Circuits (システム数理と応用)
On Efficient Universal Quantum Circuits
On Efficient Universal Quantum Circuits
On the Complexity of Energy-Aware Mapping for NoCs
On the Complexity of Energy-Aware Mapping for NoCs
On the Complexity of Energy-Aware Mapping for NoCs (信号処理)
A-1-8 A Note on Two-Directional Orthogonal Ray Graphs
A-1-7 A Note on the Cutwidth of Trees
A-1-6 A Note on the Energy-Aware Mapping for NoCs
On the Complexity of Fault Testing for Reversible Circuits
A-1-9 The Complexity of the Densest κ-Subgraph Problem for Chordal Bipartite Graphs
A-1-10 Characterizations of Orthogonal Ray Trees
On Minimum Feedback Vertex Sets in Graphs
On Minimum Feedback Vertex Sets in Graphs
On Minimum Feedback Vertex Sets in Graphs
A Note on the Energy-Aware Mapping for NoCs
A Note on the Energy-Aware Mapping for NoCs
On Minimum Feedback Vertex Sets in Bipartite Graphs and Degree-Constraint Graphs
On Minimum Feedback Vertex Sets in Graphs (信号処理)
On Unit Grid Intersection Graphs
On Unit Grid Intersection Graphs

On Efficient Universal Quantum Circuits (システム数理と応用)

スポンサーリンク

概要

著者

関連論文

スポンサーリンク