本文计算了三能级(E3>E2>E1)量子变频器输出的相干部分与非相干部分的线型。分别对光频波之间、光频波与微波间以及微波间的变频作了讨论。三能级量子变频器有两类工作方式。在方式Ⅰ中,泵频率～1/?(E2—E1),输入讯号频率～1/?(E3—E2),输出讯号频率～1/?(E3—E1)。在方式Ⅱ中,泵频率～1/?(E3—E2),输入讯号频率～1/?(E2—E1),输出讯号频率～1/?(E3—E1)。本文计算表明对于光频波段的变频,工作方式Ⅱ是比较优越的。本文计算了三能级(E3>E2>E1)量子变频器输出的相干部分与非相干部分的线型。分别对光频波之间、光频波与微波间以及微波间的变频作了讨论。三能级量子变频器有两类工作方式。在方式Ⅰ中,泵频率～1/?(E2—E1),输入讯号频率～1/?(E3—E2),输出讯号频率～1/?(E3—E1)。在方式Ⅱ中,泵频率～1/?(E3—E2),输入讯号频率～1/?(E2—E1),输出讯号频率～1/?(E3—E1)。本文计算表明对于光频波段的变频,工作方式Ⅱ是比较优越的。

Acta Physica SinicaJan 1, 19640 citations

1a-E1-9 縮退電子液体の動的相関(III) 1粒子グリーン関数の自己無撞着解(統計力学・物性基礎論)

愛一郎中野, 節夫一丸

年会講演予稿集Mar 18, 19880 citations

A Polynomial Time Bounded-error Quantum Algorithm for Boolean Satisfiability

Ahmed Younes, Jonathan E. Rowe

The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The proposed algorithm runs in $O(m^2)$ for an E3-CNF Boolean formula with $m$ clauses and in the worst case runs in $O(n^6)$ for an E3-CNF Boolean formula with $n$ inputs. The proposed algorithm maximizes the set of satisfied clauses using a novel iterative partial negation and partial measurement technique. The algorithm is shown to achieve an arbitrary high probability of success of $1-ε$ for small $ε>0$ using a polynomial resources. In addition to solving the MAX-E3-SAT problem, the proposed algorithm can also be used to decide if an E3-CNF Boolean formula is satisfiable or not, which is an NP-complete problem, based on the maximum number of satisfied clauses.The aim of the paper is to answer a long-standing open problem on the relationship between NP and BQP. The paper shows that BQP contains NP by proposing a BQP quantum algorithm for the MAX-E3-SAT problem which is a fundamental NP-hard problem. Given an E3-CNF Boolean formula, the aim of the MAX-E3-SAT problem is to find the variable assignment that maximizes the number of satisfied clauses. The proposed algorithm runs in $O(m^2)$ for an E3-CNF Boolean formula with $m$ clauses and in the worst case runs in $O(n^6)$ for an E3-CNF Boolean formula with $n$ inputs. The proposed algorithm maximizes the set of satisfied clauses using a novel iterative partial negation and partial measurement technique. The algorithm is shown to achieve an arbitrary high probability of success of $1-ε$ for small $ε>0$ using a polynomial resources. In addition to solving the MAX-E3-SAT problem, the proposed algorithm can also be used to decide if an E3-CNF Boolean formula is satisfiable or not, which is an NP-complete problem, based on the maximum number of satisfied clauses.

arXiv:1507.05061Jul 16, 20154 citations

量子論50年の回顧-(2)素粒子論-

昌一坂田

Feb 1, 19520 citations

3a-E1-10 2次元ハバード模型のランジュベンシミュレーション(統計力学・物性基礎論)

和夫斉藤, 彗高田, 彰宇川

年会講演予稿集Mar 18, 19880 citations

O(m^2)

for an E3-CNF Boolean formula with

m

clauses and in the worst case runs in

O(n^6)

for an E3-CNF Boolean formula with

n

inputs. The proposed algorithm maximizes the set of satisfied clauses using a novel iterative partial negation and partial measurement technique. The algorithm is shown to achieve an arbitrary high probability of success of

1-ε

for small

ε>0

using a polynomial resources. In addition to solving the MAX-E3-SAT problem, the proposed algorithm can also be used to decide if an E3-CNF Boolean formula is satisfiable or not, which is an NP-complete problem, based on the maximum number of satisfied clauses.