Towards a High Level Quantum Programming Language
|
|
|
- Kory Walters
- 5 years ago
- Views:
Transcription
1 MGS Xmas 04 p.1/?? Towards a High Level Quantum Programming Language Thorsten Altenkirch University of Nottingham based on joint work with Jonathan Grattage and discussions with V.P. Belavkin supported by EPSRC grant GR/S30818/01
2 Background MGS Xmas 04 p.2/??
3 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits.
4 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits. Feynman: Can we exploit this fact to perform computations more efficiently?
5 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits. Feynman: Can we exploit this fact to perform computations more efficiently? Shor: Factorisation in quantum polynomial time.
6 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits. Feynman: Can we exploit this fact to perform computations more efficiently? Shor: Factorisation in quantum polynomial time. Grover: Blind search in
7 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits. Feynman: Can we exploit this fact to perform computations more efficiently? Shor: Factorisation in quantum polynomial time. Grover: Blind search in Can we build a quantum computer?
8 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits. Feynman: Can we exploit this fact to perform computations more efficiently? Shor: Factorisation in quantum polynomial time. Grover: Blind search in Can we build a quantum computer? yes We can run quantum algorithms.
9 MGS Xmas 04 p.2/?? Background Simulation of quantum systems is expensive: Exponential time to simulate polynomial circuits. Feynman: Can we exploit this fact to perform computations more efficiently? Shor: Factorisation in quantum polynomial time. Grover: Blind search in Can we build a quantum computer? yes We can run quantum algorithms. no Nature is classical after all!
10 The quantum software crisis MGS Xmas 04 p.3/??
11 MGS Xmas 04 p.3/?? The quantum software crisis Quantum algorithms are usually presented using the circuit model.
12 MGS Xmas 04 p.3/?? The quantum software crisis Quantum algorithms are usually presented using the circuit model. Nielsen and Chuang, p.7, Coming up with good quantum algorithms is hard.
13 MGS Xmas 04 p.3/?? The quantum software crisis Quantum algorithms are usually presented using the circuit model. Nielsen and Chuang, p.7, Coming up with good quantum algorithms is hard. Richard Josza, QPL 2004: We need to develop quantum thinking!
14 QML MGS Xmas 04 p.4/??
15 MGS Xmas 04 p.4/?? QML QML: a first-order functional language for quantum computations on finite types.
16 MGS Xmas 04 p.4/?? QML QML: a first-order functional language for quantum computations on finite types. Design based on semantic analogy: Finite classical computations Finite quantum computations
17 MGS Xmas 04 p.4/?? QML QML: a first-order functional language for quantum computations on finite types. Design based on semantic analogy: Finite classical computations Finite quantum computations Quantum control and quantum data.
18 MGS Xmas 04 p.4/?? QML QML: a first-order functional language for quantum computations on finite types. Design based on semantic analogy: Finite classical computations Finite quantum computations Quantum control and quantum data. Contraction is interpreted as sharing not cloning.
19 MGS Xmas 04 p.4/?? QML QML: a first-order functional language for quantum computations on finite types. Design based on semantic analogy: Finite classical computations Finite quantum computations Quantum control and quantum data. Contraction is interpreted as sharing not cloning. Control of decoherence, hence no implicit weakening.
20 MGS Xmas 04 p.4/?? QML QML: a first-order functional language for quantum computations on finite types. Design based on semantic analogy: Finite classical computations Finite quantum computations Quantum control and quantum data. Contraction is interpreted as sharing not cloning. Control of decoherence, hence no implicit weakening. Compiler under construction (Jonathan)
21 Example: Hadamard operation MGS Xmas 04 p.5/??
22 MGS Xmas 04 p.5/?? Example: Hadamard operation Matrix
23 MGS Xmas 04 p.5/?? Example: Hadamard operation Matrix QML * " &(') % $#!" * " &(') #!" +,
24 -./ 4.- A5 4 > > D CB 9U S X 9U > E S X 9 > 9 S X 4 M 9U > > S X 4 M 9 > > Z U4 B Deutsch algorithm =<?> 8:9 ; S OQPR M N F JLKM GIH E=F D CB 4 T ; OQPR M > F T ; 5 OQPR M > F OQPR M F WV N JLKM GIH E=F 5 JLKM > GIH F OQPR M N F JLKM GIH F WV 8:Y 9 5 D CB J KM > GIH 8:Y 9 F OQPR M F OQPR N F J KM G H F E WV T ; J KM G H F OQPR F WV N J KM G H E=F 8:Y 9 [ < MGS Xmas 04 p.6/??
25 MGS Xmas 04 p.7/?? Overview 1. Finite classical computation 2. Finite quantum computation 3. QML 4. Conclusions and further work
26 MGS Xmas 04 p.8/?? 1. Finite classical computation 1. Finite classical computation 2. Finite quantum computation 3. QML 4. Conclusions and further work
27 Classical computations on finite types MGS Xmas 04 p.9/??
28 MGS Xmas 04 p.9/?? Classical computations on finite types Quantum mechanics is time-reversible...
29 MGS Xmas 04 p.9/?? Classical computations on finite types Quantum mechanics is time-reversible hence quantum computation is based on reversible operations.
30 MGS Xmas 04 p.9/?? Classical computations on finite types Quantum mechanics is time-reversible hence quantum computation is based on reversible operations. However: Newtonian mechanics, Maxwellian electrodynamics are also time-reversible...
31 MGS Xmas 04 p.9/?? Classical computations on finite types Quantum mechanics is time-reversible hence quantum computation is based on reversible operations. However: Newtonian mechanics, Maxwellian electrodynamics are also time-reversible hence classical computation should be based on reversible operations.
32 Classical computation ( ) MGS Xmas 04 p.10/??
33 _ ` \ ^ ] a MGS Xmas 04 p.10/?? Classical computation ( ) Given finite sets (input) and (output):
34 _ c ` \ e ^ f ] a e MGS Xmas 04 p.10/?? Classical computation ( ) Given finite sets (input) and (output): a finite set of initial heaps, an initial heap bdc a finite set of garbage states, a bijection,,
35 Composing computations MGS Xmas 04 p.11/??
36 h g g ] h h g MGS Xmas 04 p.11/?? Composing computations h g
37 Extensional equality MGS Xmas 04 p.12/??
38 e ci k g $ i j MGS Xmas 04 p.12/?? Extensional equality A classical computation induces a function U by % j b j e lnm ut oqpsr U
39 e ci k g $ i j MGS Xmas 04 p.12/?? Extensional equality A classical computation induces a function U by % j b j e lnm ut oqpsr U We say that two computations are extensionally equivalent, if they give rise to the same function.
40 $ $ % i v $ % v i % MGS Xmas 04 p.13/?? Extensional equality... Theorem: U U U
41 $ $ % i v $ % v i % MGS Xmas 04 p.13/?? Extensional equality... Theorem: U U U Hence, classical computations upto extensional equality give rise to the category.
42 $ $ % i v c $ % v i % MGS Xmas 04 p.13/?? Extensional equality... Theorem: U U U Hence, classical computations upto extensional equality give rise to the category. Theorem: Any function on finite sets jcan be realized by a computation.
43 $ $ % i v c $ % v i % MGS Xmas 04 p.13/?? Extensional equality... Theorem: U U U Hence, classical computations upto extensional equality give rise to the category. Theorem: Any function on finite sets jcan be realized by a computation. Translation for Category Theoreticians: U is full and faithful.
44 % $ c j % $ { j MGS Xmas 04 p.14/?? : Example function wyx wzx
45 % $ c j % $ { j MGS Xmas 04 p.14/?? ^} ~ : Example function wyx wzx computation
46 $ % $ j j % MGS Xmas 04 p.15/?? Example : function c
47 % $ j % $ j ƒ % $ c ƒ j j % $ % $ ƒ % $ % $ ƒ MGS Xmas 04 p.15/?? Example : function c computation $ % j j j j
48 MGS Xmas 04 p.16/?? 2. Finite quantum computation 1. Finite classical computation 2. Finite quantum computation 3. QML basics 4. Compiling QML 5. Conclusions and further work
49 Pure quantum values MGS Xmas 04 p.17/??
50 # # cˆ # MGS Xmas 04 p.17/?? Pure quantum values A pure quantum value over a finite set given by with unit norm: c is # ˆ # #
51 # # cˆ # MGS Xmas 04 p.17/?? Pure quantum values A pure quantum value over a finite set given by with unit norm: c is # ˆ # # is monadic, giving rise to the category of (finite dimensional) vector spaces.
52 $ $ $ š # Vector spaces as a monad Š Œ c Ž Ž +, Ž Ž % c % % $ %?œ Ž š MGS Xmas 04 p.18/??
53 Reversible quantum operations MGS Xmas 04 p.19/??
54 MGS Xmas 04 p.19/?? Reversible quantum operations Reversible operations on pure quantum values are given by unitary operators.
55 MGS Xmas 04 p.19/?? Reversible quantum operations Reversible operations on pure quantum values are given by unitary operators. On finite dimensional vector spaces: unitary = norm preserving linear iso.
56 ž Ÿ % % MGS Xmas 04 p.19/?? Reversible quantum operations Reversible operations on pure quantum values are given by unitary operators. On finite dimensional vector spaces: unitary = norm preserving linear iso. The inverse is given by the adjoint: $ žc $ ž
57 Quantum computations ( ) MGS Xmas 04 p.20/??
58 _ ` \ ^ ] a MGS Xmas 04 p.20/?? Quantum computations ( ) Given finite sets (input) and (output):
59 _ ` \ c ^ ] a Quantum computations ( ) Given finite sets (input) and (output): a finite set, the base of the space of initial heaps, a heap initialisation vector b c a finite set, the base of the space of garbage states, a unitary operator, unitary. MGS Xmas 04 p.20/??
60 Composing quantum computations MGS Xmas 04 p.21/??
61 h g g ] h h g MGS Xmas 04 p.21/?? Composing quantum computations h g
62 Extensional equality? MGS Xmas 04 p.22/??
63 MGS Xmas 04 p.22/?? Extensional equality?... is a bit more subtle.
64 c e MGS Xmas 04 p.22/?? Extensional equality?... is a bit more subtle. There is no (sensible) operator on vector spaces replacing. wx
65 c e MGS Xmas 04 p.22/?? Extensional equality?... is a bit more subtle. There is no (sensible) operator on vector spaces replacing. wx Indeed: Forgetting part of a pure state results in a mixed state.
66 Density operators MGS Xmas 04 p.23/??
67 c MGS Xmas 04 p.23/?? Density operators Mixed states are represented by density operators (positive operators with unit trace).
68 c MGS Xmas 04 p.23/?? Density operators Mixed states are represented by density operators (positive operators with unit trace). is interpreted as the system is in the pure state with probability.
69 Superoperators MGS Xmas 04 p.24/??
70 MGS Xmas 04 p.24/?? Superoperators Morphisms on mixed states are completely positive linear operators on the space of density operators, called superoperators.
71 MGS Xmas 04 p.24/?? Superoperators Morphisms on mixed states are completely positive linear operators on the space of density operators, called superoperators. Every unitary operator superoperator. gives rise to a
72 r c MGS Xmas 04 p.24/?? Superoperators Morphisms on mixed states are completely positive linear operators on the space of density operators, called superoperators. Every unitary operator superoperator. There is an operator gives rise to a & ' super called partial trace.
73 Extensional equality MGS Xmas 04 p.25/??
74 p «g ci ci MGS Xmas 04 p.25/?? Extensional equality A quantum computation rise to a superoperator U super gives k z ª t U
75 p «g ci ci MGS Xmas 04 p.25/?? Extensional equality A quantum computation rise to a superoperator U super gives k z ª t U We say that two computations are extensionally equivalent, if they give rise to the same superoperator.
76 $ $ % i v $ % v i % MGS Xmas 04 p.26/?? Extensional equality... Theorem: U U U
77 $ $ % i v $ % v i % MGS Xmas 04 p.26/?? Extensional equality... Theorem: U U U Hence, quantum computations upto extensional equality give rise to the category.
78 $ $ % i v $ % v c i % MGS Xmas 04 p.26/?? Extensional equality... Theorem: U U U Hence, quantum computations upto extensional equality give rise to the category. Theorem: Every superoperator super (on finite Hilbert spaces) comes from a quantum computation.
79 $ $ % i v $ % v c i % MGS Xmas 04 p.26/?? Extensional equality... Theorem: U U U Hence, quantum computations upto extensional equality give rise to the category. Theorem: Every superoperator super (on finite Hilbert spaces) comes from a quantum computation. (U is full and faithful).
80 Classical vs quantum MGS Xmas 04 p.27/??
81 MGS Xmas 04 p.27/?? Classical vs quantum classical ( ) quantum ( )
82 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets ) quantum ( )
83 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets ) quantum ( finite dimensional Hilbert spaces )
84 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections ) quantum ( finite dimensional Hilbert spaces )
85 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections ) quantum ( finite dimensional Hilbert spaces unitary operators )
86 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections cartesian product ( ) quantum ( finite dimensional Hilbert spaces unitary operators ) )
87 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections cartesian product ( ) quantum ( finite dimensional Hilbert spaces unitary operators ) tensor product ( ) )
88 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections cartesian product ( functions ) quantum ( finite dimensional Hilbert spaces unitary operators ) tensor product ( ) )
89 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections cartesian product ( functions ) quantum ( finite dimensional Hilbert spaces unitary operators ) tensor product ( ) superoperators )
90 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections cartesian product ( functions projections ) quantum ( finite dimensional Hilbert spaces unitary operators ) tensor product ( ) superoperators )
91 MGS Xmas 04 p.27/?? Classical vs quantum classical ( finite sets bijections cartesian product ( functions projections ) quantum ( finite dimensional Hilbert spaces unitary operators ) tensor product ( ) superoperators partial trace )
92 MGS Xmas 04 p.28/??, classically v wsx
93 MGS Xmas 04 p.28/??, classically v wsx ^} ~ ^±
94 ² MGS Xmas 04 p.28/??, classically v wsx ^} ~ ^±
95 MGS Xmas 04 p.29/??, quantum ^ ~ ^³
96 # # MGS Xmas 04 p.29/??, quantum ^ ~ ^³ * x µ x µ input:
97 # # # # MGS Xmas 04 p.29/??, quantum ^ ~ ^³ * x µ x µ input: * x * x output:
98 # # # # MGS Xmas 04 p.29/??, quantum ^ ~ ^³ * x µ x µ input: * x * x output: Decoherence!
99 Control of decoherence MGS Xmas 04 p.30/??
100 MGS Xmas 04 p.30/?? Control of decoherence QML is based on strict linear logic
101 ƒ MGS Xmas 04 p.30/?? Control of decoherence QML is based on strict linear logic Contraction is implicit and realized by.
102 ƒ MGS Xmas 04 p.30/?? Control of decoherence QML is based on strict linear logic Contraction is implicit and realized by Weakening is explicit and leads to decoherence..
103 MGS Xmas 04 p.31/?? 3. QML 1. Finite classical computation 2. Finite quantum computation 3. QML 4. Conclusions and further work
104 QML overview MGS Xmas 04 p.32/??
105 # # MGS Xmas 04 p.32/?? QML overview Types
106 # # # % $ { j # % À QML overview Types Terms ¹ # + # % $# % $# + j º» ' # º¼» * { º» ' # º» (¾,½ # * { º» ' # º» (¾,½ # * % #$Á $ # MGS Xmas 04 p.32/??
107 ,½ MGS Xmas 04 p.33/?? * * Qbits % $ º¼» " & ') % $ º¼» '!" +, º» ' # º»,½ +, º» ' # º»
108 QML overview... MGS Xmas 04 p.34/??
109 Â Â MGS Xmas 04 p.34/?? QML overview... Typing judgements ÃÄ ÃÄ programs strict programs
110 Æ Æ Å Â Å Æ Æ Å Â Å QML overview... Typing judgements programs strict programs ÃÄ Â ÃÄ Â Semantics Ä Ã Â ÃÄ Â Æ c Å Ä Æ c Å Ä MGS Xmas 04 p.34/??
111 j & " Â Ä Ë Ê MGS Xmas 04 p.35/?? ÃÄ Â ÃÇ ÃÉÈ Ç ÌÎÍ The let-rule
112 j & " Â Ä Ë Ê Â Ö Õ Ö Ù Ø Ü Û r Ú Ú Ú MGS Xmas 04 p.35/?? ÃÄ Â ÃÇ ÃÉÈ Ç ÌÎÍ The let-rule Ô ÏÑÐÓÒ
113 on contexts MGS Xmas 04 p.36/??
114 % j j Ý c if % j dom MGS Xmas 04 p.36/?? on contexts  $  j  $  j
115 j Ý c Â Â Ù Ø r dom MGS Xmas 04 p.36/?? on contexts % j  $  j if % j  $  j Ô ÏÑÐÓÒ
116 Another source of decoherence MGS Xmas 04 p.37/??
117 MGS Xmas 04 p.37/?? Another source of decoherence mentions Ž Ž " &(') +, " & ') Ž
118 MGS Xmas 04 p.37/?? Another source of decoherence mentions Ž Ž " &(') +, " & ') Ž but doesn t use it.
119 Ž Ž Ž MGS Xmas 04 p.37/?? Another source of decoherence mentions " &(') +, & ') " but doesn t use it. Hence, it has to measure it!
120 -elim MGS Xmas 04 p.38/??
121 ë é â ë ì å â û ú ë é â äæå ã ßáàâ Þ ßê â ã ç è ßáíâ ç è ñòôó îðï í ì ý ÿ ê üþý ÿ à ùø MGS Xmas 04 p.38/?? -elim ßáö ç Þnõ
122 ë é â ë ì å â û ú ë é â ç ë $ äæå ã ßáàâ Þ ßê â ã ç è ßáíâ ç è ñòôó îðï í ì ý ÿ ê üþý ÿ à ùø!#" $& MGS Xmas 04 p.38/?? -elim ßáö ç Þnõ Þõ %
123 -elim decoherence-free MGS Xmas 04 p.39/??
124 ë é â ê ë ì å â û ú à ( ùø ë é â -elim decoherence-free ä å ã ß' àâ Þ ß(ê â ã ç è ) í ß( íâ ç è ( ñòôó ï ä+* í ì ý ÿ ê üþý ÿ ' ß ö ç Þõ MGS Xmas 04 p.39/??
125 ë é â ê ë ì å â û ú à ( ùø ë é â ç ë 0 -elim decoherence-free ä å ã ß' àâ Þ ß(ê â ã ç è ) í ß( íâ ç è ( ñòôó ï ä+* í ì ý ÿ ê üþý ÿ ' ß ö ç Þõ Þõ 1 -, 2 2 /.. $3. -, % MGS Xmas 04 p.39/??
126 5 4 MGS Xmas 04 p.40/??
127 : : A O KMLNJ PHQ G GO KML J N MGS Xmas 04 p.40/?? >? > ;=< FHGI E CB ;@ 5 4
128 : : A W W 5 4 >? > ;=< O KMLNJ PHQ G GO KML J N FHGI E CB ;@ This program has a type error, because. STV R SUTV R MGS Xmas 04 p.40/??
129 : : A W W A 5 4 >? > ;=< O KMLNJ PHQ G GO KML J N FHGI E CB ;@ This program has a type error, because. STV R SUTV R >? > : 6< YX O KMLNJ PHQ G GO ]H^ Z\[ J FHGI E CB 6 YX MGS Xmas 04 p.40/??
130 : : A W W A W 5 4 >? > ;=< O KMLNJ PHQ G GO KML J N FHGI E CB ;@ This program has a type error, because. STV R SUTV R >? > : 6< YX O KMLNJ PHQ G GO ]H^ Z\[ J FHGI E CB 6 YX This program typechecks, because. SUTV R W amb _` R MGS Xmas 04 p.40/??
131 MGS Xmas 04 p.41/?? 4. QML 1. Finite classical computation 2. Finite quantum computation 3. QML 4. Conclusions and further work
132 Conclusions MGS Xmas 04 p.42/??
133 Conclusions Our semantic ideas proved useful when designing a quantum programming language, analogous concepts are modelled by the same syntactic constructs. MGS Xmas 04 p.42/??
134 MGS Xmas 04 p.42/?? Conclusions Our semantic ideas proved useful when designing a quantum programming language, analogous concepts are modelled by the same syntactic constructs. Our analysis also highlights the differences between classical and quantum programming.
135 MGS Xmas 04 p.42/?? Conclusions Our semantic ideas proved useful when designing a quantum programming language, analogous concepts are modelled by the same syntactic constructs. Our analysis also highlights the differences between classical and quantum programming. Quantum programming introduces the problem of control of decoherence, which we address by making forgetting variables explicit and by having different if-then-else constructs.
136 Further work MGS Xmas 04 p.43/??
137 MGS Xmas 04 p.43/?? Further work We have to analyze more quantum programs to evaluate the practical usefulness of our approach.
138 MGS Xmas 04 p.43/?? Further work We have to analyze more quantum programs to evaluate the practical usefulness of our approach. Are we able to come up with completely new algorithms using QML?
139 MGS Xmas 04 p.43/?? Further work We have to analyze more quantum programs to evaluate the practical usefulness of our approach. Are we able to come up with completely new algorithms using QML? How to deal with higher order programs?
140 MGS Xmas 04 p.43/?? Further work We have to analyze more quantum programs to evaluate the practical usefulness of our approach. Are we able to come up with completely new algorithms using QML? How to deal with higher order programs? How to deal with infinite datatypes?
141 MGS Xmas 04 p.43/?? Further work We have to analyze more quantum programs to evaluate the practical usefulness of our approach. Are we able to come up with completely new algorithms using QML? How to deal with higher order programs? How to deal with infinite datatypes? Investigate the similarities/differences between FCC and FQC from a categorical point of view.
142 MGS Xmas 04 p.44/?? The end Thank you for your attention. Draft paper: quant-ph/ from arxiv.org
A Functional Quantum Programming Language
A Functional Quantum Programming Language Thorsten Altenkirch University of Nottingham based on joint work with Jonathan Grattage and discussions with V.P. Belavkin supported by EPSRC grant GR/S30818/01
Towards a High Level Quantum Programming Language
Towards a High Level Quantum Programming Language Thorsten Altenkirch University of Nottingham based on joint work with Jonathan Grattage and discussions with V.P. Belavkin Towards ahigh LevelQuantum Programming
A functional quantum programming language
A functional quantum programming language Thorsten Altenkirch and Jonathan Grattage School of Computer Science and IT, Nottingham University email: {txa,jjg}@cs.nott.ac.uk Abstract. We introduce the language
arxiv:quant-ph/ v5 19 Apr 2005
A functional quantum programming language arxiv:quant-ph/0409065v5 19 Apr 2005 Thorsten Altenkirch and Jonathan Grattage School of Computer Science and IT, Nottingham University email: {txa,jjg}@cs.nott.ac.uk
! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
Framework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
Quantum Effects. Juliana K. Vizzotto 1 Thorsten Altenkirch 2. Amr Sabry January Yale CS Colloquium Page 1
Quantum Effects Juliana K. Vizzotto 1 Thorsten Altenkirch 2 Amr Sabry 3 1 Federal University of Rio Grande do Sul 2 The University of Nottingham 3 Indiana University 2 January 25 Yale CS Colloquium Page
Optimal Control of PDEs
Optimal Control of PDEs Suzanne Lenhart University of Tennessee, Knoville Department of Mathematics Lecture1 p.1/36 Outline 1. Idea of diffusion PDE 2. Motivating Eample 3. Big picture of optimal control
Redoing the Foundations of Decision Theory
Redoing the Foundations of Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Redoing the Foundations of Decision Theory p. 1/21 Decision Making:
LA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
An Example file... log.txt
# ' ' Start of fie & %$ " 1 - : 5? ;., B - ( * * B - ( * * F I / 0. )- +, * ( ) 8 8 7 /. 6 )- +, 5 5 3 2( 7 7 +, 6 6 9( 3 5( ) 7-0 +, => - +< ( ) )- +, 7 / +, 5 9 (. 6 )- 0 * D>. C )- +, (A :, C 0 )- +,
An Introduction to Optimal Control Applied to Disease Models
An Introduction to Optimal Control Applied to Disease Models Suzanne Lenhart University of Tennessee, Knoxville Departments of Mathematics Lecture1 p.1/37 Example Number of cancer cells at time (exponential
Vectors. Teaching Learning Point. Ç, where OP. l m n
Vectors 9 Teaching Learning Point l A quantity that has magnitude as well as direction is called is called a vector. l A directed line segment represents a vector and is denoted y AB Å or a Æ. l Position
Principal Secretary to Government Haryana, Town & Country Planning Department, Haryana, Chandigarh.
1 From To Principal Secretary to Government Haryana, Town & Country Planning Department, Haryana, Chandigarh. The Director General, Town & Country Planning Department, Haryana, Chandigarh. Memo No. Misc-2339
F O R SOCI AL WORK RESE ARCH
7 TH EUROPE AN CONFERENCE F O R SOCI AL WORK RESE ARCH C h a l l e n g e s i n s o c i a l w o r k r e s e a r c h c o n f l i c t s, b a r r i e r s a n d p o s s i b i l i t i e s i n r e l a t i o n
" #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y
" #$ +. 0. + 4 6 4 : + 4 ; 6 4 < = =@ = = =@ = =@ " #$ P UTS W U X [ZY \ Z _ `a \ dfe ih j mlk n p q sr t u s q e ps s t x q s y i_z { U U z W } y ~ y x t i e l US T { d ƒ ƒ ƒ j s q e uˆ ps i ˆ p q y h
AN IDENTIFICATION ALGORITHM FOR ARMAX SYSTEMS
AN IDENTIFICATION ALGORITHM FOR ARMAX SYSTEMS First the X, then the AR, finally the MA Jan C. Willems, K.U. Leuven Workshop on Observation and Estimation Ben Gurion University, July 3, 2004 p./2 Joint
Quantum Computing. Thorsten Altenkirch
Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the
A functional quantum programming language. by Jonathan James Grattage, BSc (Hons)
A functional quantum programming language by Jonathan James Grattage, BSc (Hons) Thesis submitted to The University of Nottingham for the degree of Doctor of Philosophy, September 2006 Abstract This thesis
Manifold Regularization
Manifold Regularization Vikas Sindhwani Department of Computer Science University of Chicago Joint Work with Mikhail Belkin and Partha Niyogi TTI-C Talk September 14, 24 p.1 The Problem of Learning is
ETIKA V PROFESII PSYCHOLÓGA
P r a ž s k á v y s o k á š k o l a p s y c h o s o c i á l n í c h s t u d i í ETIKA V PROFESII PSYCHOLÓGA N a t á l i a S l o b o d n í k o v á v e d ú c i p r á c e : P h D r. M a r t i n S t r o u
QUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS
International Workshop Quarkonium Working Group QUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS ALBERTO POLLERI TU München and ECT* Trento CERN - November 2002 Outline What do we know for sure?
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 REDCLIFF MUNICIPAL PLANNING COMMISSION FOR COMMENT/DISCUSSION DATE: TOPIC: April 27 th, 2018 Bylaw 1860/2018, proposed amendments to the Land Use Bylaw regarding cannabis
OC330C. Wiring Diagram. Recommended PKH- P35 / P50 GALH PKA- RP35 / RP50. Remarks (Drawing No.) No. Parts No. Parts Name Specifications
G G " # $ % & " ' ( ) $ * " # $ % & " ( + ) $ * " # C % " ' ( ) $ * C " # C % " ( + ) $ * C D ; E @ F @ 9 = H I J ; @ = : @ A > B ; : K 9 L 9 M N O D K P D N O Q P D R S > T ; U V > = : W X Y J > E ; Z
4.3 Laplace Transform in Linear System Analysis
4.3 Laplace Transform in Linear System Analysis The main goal in analysis of any dynamic system is to find its response to a given input. The system response in general has two components: zero-state response
A Beamforming Method for Blind Calibration of Time-Interleaved A/D Converters
A Beamforming Method for Blind Calibration of Time-nterleaved A/D Converters Bernard C. Levy University of California, Davis Joint wor with Steve Huang September 30, 200 Outline 1 Motivation Problem Formulation
Quantum data and control made easier
QPL 006 Preliminary Version Quantum data and control made easier Michael Lampis 1, Kyriakos G. Ginis 3 Nikolaos S. Papaspyrou 4 School of Electrical and Computer Engineering National Technical University
Planning for Reactive Behaviors in Hide and Seek
University of Pennsylvania ScholarlyCommons Center for Human Modeling and Simulation Department of Computer & Information Science May 1995 Planning for Reactive Behaviors in Hide and Seek Michael B. Moore
Max. Input Power (W) Input Current (Arms) Dimming. Enclosure
Product Overview XI025100V036NM1M Input Voltage (Vac) Output Power (W) Output Voltage Range (V) Output urrent (A) Efficiency@ Max Load and 70 ase Max ase Temp. ( ) Input urrent (Arms) Max. Input Power
Constructive Decision Theory
Constructive Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Constructive Decision Theory p. 1/2 Savage s Approach Savage s approach to decision
Connection equations with stream variables are generated in a model when using the # $ % () operator or the & ' %
7 9 9 7 The two basic variable types in a connector potential (or across) variable and flow (or through) variable are not sufficient to describe in a numerically sound way the bi-directional flow of matter
- Why aren t there more quantum algorithms? - Quantum Programming Languages. By : Amanda Cieslak and Ahmana Tarin
- Why aren t there more quantum algorithms? - Quantum Programming Languages By : Amanda Cieslak and Ahmana Tarin Why aren t there more quantum algorithms? there are only a few problems for which quantum
New BaBar Results on Rare Leptonic B Decays
New BaBar Results on Rare Leptonic B Decays Valerie Halyo Stanford Linear Accelerator Center (SLAC) FPCP 22 valerieh@slac.stanford.edu 1 Table of Contents Motivation to look for and Analysis Strategy Measurement
Examination paper for TFY4240 Electromagnetic theory
Department of Physics Examination paper for TFY4240 Electromagnetic theory Academic contact during examination: Associate Professor John Ove Fjærestad Phone: 97 94 00 36 Examination date: 16 December 2015
The University of Bath School of Management is one of the oldest established management schools in Britain. It enjoys an international reputation for
The University of Bath School of Management is one of the oldest established management schools in Britain. It enjoys an international reputation for the quality of its teaching and research. Its mission
SOLAR MORTEC INDUSTRIES.
SOLAR MORTEC INDUSTRIES www.mortecindustries.com.au Wind Regions Region A Callytharra Springs Gascoyne Junction Green Head Kununurra Lord Howe Island Morawa Toowoomba Wittanoom Bourke Region B Adelaide
1. Allstate Group Critical Illness Claim Form: When filing Critical Illness claim, please be sure to include the following:
Dear Policyholder, Per your recent request, enclosed you will find the following forms: 1. Allstate Group Critical Illness Claim Form: When filing Critical Illness claim, please be sure to include the
Structuring Quantum Effects: Superoperators as Arrows
Math. Struct. in Comp. Science Structuring Quantum Effects: Superoperators as Arrows J U L I A N A V I Z Z O T T O 1, T H O R S T E N A L T E N K I R C H 2 and A M R S A B R Y 3 1 Institute of Informatics,
Byung-Soo Choi.
Grover Search and its Applications Bung-Soo Choi bschoi3@gmail.com Contents Basics of Quantum Computation General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric
General Neoclassical Closure Theory: Diagonalizing the Drift Kinetic Operator
General Neoclassical Closure Theory: Diagonalizing the Drift Kinetic Operator E. D. Held eheld@cc.usu.edu Utah State University General Neoclassical Closure Theory:Diagonalizing the Drift Kinetic Operator
Quantum Recursion and Second Quantisation
Quantum Recursion and Second Quantisation Mingsheng Ying State Key Laboratory of Computer Science Outline 1. Introduction 2. Recursive Programming 3. Classical Recursion in Quantum Programming 4. Quantum
Matrices and Determinants
Matrices and Determinants Teaching-Learning Points A matri is an ordered rectanguar arra (arrangement) of numbers and encosed b capita bracket [ ]. These numbers are caed eements of the matri. Matri is
$%! & (, -3 / 0 4, 5 6/ 6 +7, 6 8 9/ 5 :/ 5 A BDC EF G H I EJ KL N G H I. ] ^ _ ` _ ^ a b=c o e f p a q i h f i a j k e i l _ ^ m=c n ^
![$%! & (, -3 / 0 4, 5 6/ 6 +7, 6 8 9/ 5 :/ 5 A BDC EF G H I EJ KL N G H I. ] ^ _ ` _ ^ a b=c o e f p a q i h f i a j k e i l _ ^ m=c n ^](/thumbs/92/108125918.jpg "$%! & (, -3 / 0 4, 5 6/ 6 +7, 6 8 9/ 5 :/ 5 A BDC EF G H I EJ KL N G H I. ] ^ _ ` _ ^ a b=c o e f p a q i h f i a j k e i l _ ^ m=c n ^")
! #" $%! & ' ( ) ) (, -. / ( 0 1#2 ' ( ) ) (, -3 / 0 4, 5 6/ 6 7, 6 8 9/ 5 :/ 5 ;=? @ A BDC EF G H I EJ KL M @C N G H I OPQ ;=R F L EI E G H A S T U S V@C N G H IDW G Q G XYU Z A [ H R C \ G ] ^ _ `
Symbols and dingbats. A 41 Α a 61 α À K cb ➋ à esc. Á g e7 á esc. Â e e5 â. Ã L cc ➌ ã esc ~ Ä esc : ä esc : Å esc * å esc *
Note: Although every effort ws tken to get complete nd ccurte tble, the uhtor cn not be held responsible for ny errors. Vrious sources hd to be consulted nd MIF hd to be exmined to get s much informtion
Orthogonality and Algebraic Lambda-Calculus
Orthogonality and Algebraic Lambda-Calculus Benoît Valiron March 28, 2010 Abstract Directly encoding lambda-terms on quantum strings while keeping a quantum interpretation is a hard task. As shown by van
Loop parallelization using compiler analysis
Loop parallelization using compiler analysis Which of these loops is parallel? How can we determine this automatically using compiler analysis? Organization of a Modern Compiler Source Program Front-end
Lecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
Transformation Rules for Designing CNOT-based Quantum Circuits
Transformation Rules for Designing CNOT-based Quantum Circuits Kazuo Iwama Sch. of Inform., Kyoto Univ. QCI, ERATO, JST iwama@kuis.kyoto-u.ac.jp Yahiko Kambayashi Sch. of Inform., Kyoto Univ. yahiko@i.kyoto-u.ac.jp
Rarefied Gas FlowThroughan Orifice at Finite Pressure Ratio
Rarefied Gas FlowThroughan Orifice at Finite Pressure Ratio Felix Sharipov Departamento de Física, Universidade Federal do Paraná Caixa Postal 90, 85-990 Curitiba, Brazil Email: sharipov@fisica.ufpr.br;
Obtain from theory/experiment a value for the absorbtion cross-section. Calculate the number of atoms/ions/molecules giving rise to the line.
Line Emission Observations of spectral lines offer the possibility of determining a wealth of information about an astronomical source. A usual plan of attack is :- Identify the line. Obtain from theory/experiment
1. CALL TO ORDER 2. ROLL CALL 3. PLEDGE OF ALLEGIANCE 4. ORAL COMMUNICATIONS (NON-ACTION ITEM) 5. APPROVAL OF AGENDA 6. EWA SEJPA INTEGRATION PROPOSAL
SPECIAL MEETING AGENDA SAN ELIJO JOINT POWERS AUTHORITY (SEJPA) TUESDAY JULY 12, 2016 AT 8:30 AM ENCINA WATER POLLUTION CONTROL FACILITY (EWA) BOARD MEETING ROOM 6200 AVENIDA ENCINAS CARLSBAD, CALIFORNIA
ALGEBRAIC THEORIES IN MONOIDAL CATEGORIES
ALGEBRAIC THEORIES IN MONOIDAL CATEGORIES LUCA MAURI ABSTRACT. We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in
Type Systems for Quantum Computation
Type Systems for Quantum Computation Bill Zorn Abstract Type systems are useful to programmers for a variety of reasons. In the classical world, they help us to define interfaces between separate pieces
Weak ω-groupoids in Type Theory
Weak ω-groupoids in Type Theory Based on joint work with Ondrej Rypacek Thorsten Altenkirch Functional Programming Laboratory School of Computer Science University of Nottingham April 2, 2012 Thorsten
Complex Analysis. PH 503 Course TM. Charudatt Kadolkar Indian Institute of Technology, Guwahati
Complex Analysis PH 503 Course TM Charudatt Kadolkar Indian Institute of Technology, Guwahati ii Copyright 2000 by Charudatt Kadolkar Preface Preface Head These notes were prepared during the lectures
Pharmacological and genomic profiling identifies NF-κB targeted treatment strategies for mantle cell lymphoma
CORRECTION NOTICE Nat. Med. 0, 87 9 (014) Pharmacoogica and genomic profiing identifies NF-κB targeted treatment strategies for mante ce ymphoma Rami Raha, Mareie Fric, Rodrigo Romero, Joshua M Korn, Robert
Vector analysis. 1 Scalars and vectors. Fields. Coordinate systems 1. 2 The operator The gradient, divergence, curl, and Laplacian...
Vector analysis Abstract These notes present some background material on vector analysis. Except for the material related to proving vector identities (including Einstein s summation convention and the
Quantum Recursion and Second Quantisation Basic Ideas and Examples
Quantum Recursion and Second Quantisation Basic Ideas and Examples Mingsheng Ying University of Technology, Sydney, Australia and Tsinghua University, China Happy Birthday Prakash! Happy Birthday Prakash!
Books. Book Collection Editor. Editor. Name Name Company. Title "SA" A tree pattern. A database instance
"! # #%$ $ $ & & & # ( # ) $ + $, -. 0 1 1 1 2430 5 6 78 9 =?
Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
Chapter 2. Linear Algebra. rather simple and learning them will eventually allow us to explain the strange results of
Chapter 2 Linear Algebra In this chapter, we study the formal structure that provides the background for quantum mechanics. The basic ideas of the mathematical machinery, linear algebra, are rather simple
B œ c " " ã B œ c 8 8. such that substituting these values for the B 3 's will make all the equations true
System of Linear Equations variables Ð unknowns Ñ B" ß B# ß ÞÞÞ ß B8 Æ Æ Æ + B + B ÞÞÞ + B œ, "" " "# # "8 8 " + B + B ÞÞÞ + B œ, #" " ## # #8 8 # ã + B + B ÞÞÞ + B œ, 3" " 3# # 38 8 3 ã + 7" B" + 7# B#
Queues, Stack Modules, and Abstract Data Types. CS2023 Winter 2004
Queues Stack Modules and Abstact Data Types CS2023 Wnte 2004 Outcomes: Queues Stack Modules and Abstact Data Types C fo Java Pogammes Chapte 11 (11.5) and C Pogammng - a Moden Appoach Chapte 19 Afte the
Front-end. Organization of a Modern Compiler. Middle1. Middle2. Back-end. converted to control flow) Representation
register allocation instruction selection Code Low-level intermediate Representation Back-end Assembly array references converted into low level operations, loops converted to control flow Middle2 Low-level
QLang: Qubit Language
QLang: Qubit Language Christopher Campbell Clément Canonne Sankalpa Khadka Winnie Narang Jonathan Wong September 24, 24 Introduction In 965, Gordon Moore predicted that the number of transistors in integrated
DISSIPATIVE SYSTEMS. Lectures by. Jan C. Willems. K.U. Leuven
DISSIPATIVE SYSTEMS Lectures by Jan C. Willems K.U. Leuven p.1/26 LYAPUNOV FUNCTIONS Consider the classical dynamical system, the flow with, the state, and Denote the set of solutions, the vector-field.
More advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
Damping Ring Requirements for 3 TeV CLIC
Damping Ring Requirements for 3 TeV CLIC Quantity Symbol Value Bunch population N b 9 4.1 10 No. of bunches/train k bt 154 Repetition frequency f r 100 Hz Horizontal emittance γε x 7 4.5 10 m Vertical
Information quantique, calcul quantique :
Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour
Testing SUSY Dark Matter
Testing SUSY Dark Matter Wi de Boer, Markus Horn, Christian Sander Institut für Experientelle Kernphysik Universität Karlsruhe Wi.de.Boer@cern.ch http://hoe.cern.ch/ deboerw SPACE Part Elba, May 7, CMSSM
Some emission processes are intrinsically polarised e.g. synchrotron radiation.
Polarisation Some emission processes are intrinsically polarised e.g. synchrotron radiation. B e linearly polarised emission circularly polarised emission Scattering processes can either increase or decrease
MARKET AREA UPDATE Report as of: 1Q 2Q 3Q 4Q
Year: 2013 Market Area (Cit, State): Greater Portland, OR MARKET AREA UPDATE Report as of: 1Q 2Q 3Q 4Q Provided b (Compan / Companies): Coldwell Banker Seal, Archibald Relocation, Prudential Northwest
n P! " # $ % & % & ' ( ) * + % $, $ -. $ -..! " # ) & % $/ $ - 0 1 2 3 4 5 6 7 3 8 7 9 9 : 3 ; 1 7 < 9 : 5 = > : 9? @ A B C D E F G HI J G H K D L M N O P Q R S T U V M Q P W X X Y W X X Z [ Y \ ] M
A Proposal for Requirement Engineering
A Proposal for Requirement Engineering Fumio Negoro The Institute of Computer Based Software Methodology and Technology 3-11-3 Takanawa, Minato-ku, Tokyo 108-0074, Japan f-negoro@lyee.co.jp http://www.lyee.co.jp
)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI
Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1
Factoring on a Quantum Computer
Factoring on a Quantum Computer The Essence Shor s Algorithm Wolfgang Polak wp@pocs.com Thanks to: Eleanor Rieffel Fuji Xerox Palo Alto Laboratory Wolfgang Polak San Jose State University, 4-14-010 - p.
Agent-based Proof Search with Indexed Formulas
5 I7. - $ '! " gent-based Proof earch with Indexed ormulas Malte Hübner, erge utexier, and Christoph Benzmüller with thans to Voler orge aarland University, aarbrücen, Germany Calculemus 2002, Marseille,
Categorical quantum mechanics
Categorical quantum mechanics Chris Heunen 1 / 76 Categorical Quantum Mechanics? Study of compositional nature of (physical) systems Primitive notion: forming compound systems 2 / 76 Categorical Quantum
Optimal data-independent point locations for RBF interpolation
Optimal dataindependent point locations for RF interpolation S De Marchi, R Schaback and H Wendland Università di Verona (Italy), Universität Göttingen (Germany) Metodi di Approssimazione: lezione dell
Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
Logical error rate in the Pauli twirling approximation
Logical error rate in the Pauli twirling approximation Amara Katabarwa and Michael R. Geller Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA (Dated: April 10, 2015)
An Introduction to Quantum Computation and Quantum Information
An to and Graduate Group in Applied Math University of California, Davis March 13, 009 A bit of history Benioff 198 : First paper published mentioning quantum computing Feynman 198 : Use a quantum computer
Optimization of a parallel 3d-FFT with non-blocking collective operations
Optimization of a parallel 3d-FFT with non-blocking collective operations Chair of Computer Architecture Technical University of Chemnitz Département de Physique Théorique et Appliquée Commissariat à l
UNIQUE FJORDS AND THE ROYAL CAPITALS UNIQUE FJORDS & THE NORTH CAPE & UNIQUE NORTHERN CAPITALS
Q J j,. Y j, q.. Q J & j,. & x x. Q x q. ø. 2019 :. q - j Q J & 11 Y j,.. j,, q j q. : 10 x. 3 x - 1..,,. 1-10 ( ). / 2-10. : 02-06.19-12.06.19 23.06.19-03.07.19 30.06.19-10.07.19 07.07.19-17.07.19 14.07.19-24.07.19
Quantum Information & Quantum Computation
CS9A, Spring 5: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 59 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs9/ Administrivia Who has the book already? Office hours: Wednesday
Optimizing Stresses for Testing DRAM Cell Defects Using Electrical Simulation
Optimizing Stresses for Testing RAM Cell efects Using Electrical Simulation Zaid Al-Ars Ad J. van de Goor Faculty of Information Technology and Systems Section of Computer Engineering elft University of
S T A T E B U D G E T : T A X A M E N D M E N T S
i T A X I N F O R M ATION N. 1 J a n u a r y 2 0 1 3 2 0 1 3 S T A T E B U D G E T : T A X A M E N D M E N T S I. I N T R O D U C T I O N................................... 2 I I. P E R S O N A L I N C
C/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).
C/CS/Phys 191 Quantum Gates and Universality 9//05 Fall 005 Lecture 8 1 Readings Benenti, Casati, and Strini: Classical circuits and computation Ch.1.,.6 Quantum Gates Ch. 3.-3.4 Universality Ch. 3.5-3.6
THE ANALYSIS OF THE CONVECTIVE-CONDUCTIVE HEAT TRANSFER IN THE BUILDING CONSTRUCTIONS. Zbynek Svoboda
THE NLSIS OF THE CONECTIE-CONDUCTIE HET TRNSFER IN THE BUILDING CONSTRUCTIONS Zbynek Soboda Czech Technical Uniersity in Prague Faculty of Ciil Engineering 166 29 Prague 6 - Czech Republic BSTRCT The numerical
Baby's First Diagrammatic Calculus for Quantum Information Processing
Baby's First Diagrammatic Calculus for Quantum Information Processing Vladimir Zamdzhiev Department of Computer Science Tulane University 30 May 2018 1 / 38 Quantum computing ˆ Quantum computing is usually
February 17, 2015 REQUEST FOR PROPOSALS. For Columbus Metropolitan Library. Issued by: Purchasing Division 96 S. Grant Ave. Columbus, OH 43215
F 7, 05 RQU FOR PROPOL P/B & O RFP L 5-006 F L : P D 96 G, OH 435 D : 3, 05 N :00 N (, O L ) W D, P P D, F D : (64) 849-034; F: (64) 849-34 @ RQU FOR PROPOL NRUON L ( L L ) R P ( RFP ) P B P N L 5-006
Introduction to Quantum Computing
Introduction to Quantum Computing Einar Pius University of Edinburgh Why this Course To raise interest in quantum computing To show how quantum computers could be useful To talk about concepts not found
Ensembles and incomplete information
p. 1/32 Ensembles and incomplete information So far in this course, we have described quantum systems by states that are normalized vectors in a complex Hilbert space. This works so long as (a) the system
6. Convert 5021 centimeters to kilometers. 7. How many seconds are in a leap year? 8. Convert the speed 5.30 m/s to km/h.
% " ' ) 2 3 1 2 3 + + 4 2 3 L L CHAPTER A Physics Toolkit Practice Problems Mathematics and Physics pages page 5 For each problem, give the rewritten equation you would use and the answer. 1. A lightbulb
ALTER TABLE Employee ADD ( Mname VARCHAR2(20), Birthday DATE );
!! "# $ % & '( ) # * +, - # $ "# $ % & '( ) # *.! / 0 "# "1 "& # 2 3 & 4 4 "# $ % & '( ) # *!! "# $ % & # * 1 3 - "# 1 * #! ) & 3 / 5 6 7 8 9 ALTER ; ? @ A B C D E F G H I A = @ A J > K L ; ?
SECTION A - EMPLOYEE DETAILS Termination date Employee number Contract/ Department SECTION C - STANDARD DOCUMENTS REQUIRED FOR ALL TERMINATIONS
UNITRANS SA TERMINATION CHECKLIST NOTES: 1. This form applies to all terminations and needs to be submitted along with the required supplementary documentation to the HR Department within the following
Cairns Hospital: Suspected Acute Coronary Syndrome Pathways. DO NOT USE if a non cardiac cause for the chest pain can be diagnosed
Cairns Hospital: Suspected Acute Coronary Syndrome Pathways DO NOT USE if a non cardiac cause for the chest pain can be diagnosed Clinical pathways never replace clinical judgement. Care outlined on this
THE UNIVERSITY OF CALGARY. Programming with a Quantum Stack. Brett Gordon Giles A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES
THE UNIVERSITY OF CALGARY Programming with a Quantum Stack by Brett Gordon Giles A THESIS SUBMITTED TO THE FACULTY OF GRADUATE STUDIES IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER
Introduction to Quantum Error Correction
Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors
T i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a. A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r )
v e r. E N G O u t l i n e T i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r ) C o n t e n t s : T h i s w o