Quantum Programming With Mixed States

被引：1

作者：

Zuliani, Paolo ^{[1
]}

机构：

[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08544 USA

来源：

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2007年 / 170卷

关键词：

Quantum programming; mixed state; probabilistic computation; quantum circuit;

D O I：

10.1016/j.entcs.2006.12.017

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we offer a programming approach to quantum computation using mixed states. Mixed-state quantum systems generalise standard (pure) quantum systems by allowing the state of the system to be a probabilistic distribution of pure states. We build on previous work by Aharonov et al. and generalise their results from quantum circuits to probabilistic (and quantum) programs.

引用

页码：185 / 199

页数：15

共 9 条

[1] LOGICAL REVERSIBILITY OF COMPUTATION [J].

BENNETT, CH .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1973, 17 (06) :525-532

[2]

DIJKSTRA EW, 1975, COMMUN ACM, V18, P453, DOI 10.1145/390016.808417

[3]

KRAUS K, 1983, LECT NOTES PHYS, V190, P1

[4]

Morgan C., 1999, South African Computer Journal, P14

[5]

Nielsen M.A., 2002, QUANTUM COMPUTATION

[6]

Peres A, 1998, QUANTUM THEORY CONCE

[7]

Sanders JW, 2000, LECT NOTES COMPUT SC, V1837, P80

[8] A SINGLE QUANTUM CANNOT BE CLONED [J].

WOOTTERS, WK ;

ZUREK, WH .

NATURE, 1982, 299 (5886) :802-803

[9] Logical reversibility [J].

Zuliani, P .

IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 2001, 45 (06) :807-818

← 1 →