Planck Constant and the Deutsch-Jozsa Algorithm
|
|
- Elmer Morgan
- 5 years ago
- Views:
Transcription
1 Adv. Studies Theor. Phys., Vol. 4, 010, no. 0, Planck Constant and the Deutsch-Jozsa Algorithm Koji agata Future University Hakodate ko mi Tadao akamura Keio University Science and Technology Abstract It is shown that there is a contradiction within conventional quantum mechanics [K. agata, Int J Theor Phys: Volume 48, Issue 1 (009), Page 5: DOI: /s z] based on Planck constant. We investigate whether Planck constant meets our physical world. We derive a proposition concerning a quantum expectation value under the assumption of the existence of the orientation of reference frames in spin-1/ systems. This assumption intuitively depictures our physical world. The quantum predictions within the formalism of Planck constant violate the proposition with a magnitude that grows exponentially with the number of particles. Planck constant cannot depicture our physical world with a violation factor that grows exponentially with the number of particles. Planck constant cannot meet our physical world. We formulate Planck constant. Our formulation is equivalent to changing Planck constant (h) to new constant (h/ Dimension). PACS: a 1 Introduction It is shown that there is a contradiction within conventional quantum mechanics [1] based on Planck constant []. Planck constant (cf. [, 4, 5, 6, 7, 8]) gives approximate and at times remarkably accurate numerical predictions. Much experimental data approximately fits to the quantum predictions of Planck constant for the past some 100 years.
2 974 K. agata and T. akamura Planck constant says new science with respect to information theory. The science is called the quantum information theory [8]. Planck constant gives us very useful another theory in order to create new information science and to explain the handing of raw experimental data in our physical world. As for the foundations of Planck constant, Leggett-type nonlocal variables theory [9] is experimentally investigated [10, 11, 1]. The experiments report that Planck constant does not accept Leggett-type nonlocal variables interpretation. As for the applications of Planck constant, there are several attempts to use single-photon two-qubit states for quantum computing. Oliveira et al. implement Deutsch s algorithm [1] with polarization and transverse spatial modes of the electromagnetic field as qubits [14]. Single-photon Bell states are prepared and measured [15]. The decoherence-free implementation of Deutsch s algorithm is reported by using such single-photon and by using two logical qubits [16]. A one-way based experimental implementation of Deutsch s algorithm is reported [17]. Planck constant seems successful formula and it looks no problem in order to use it experimentally. Several researches address [] the mathematical formulation of the quantum theory. Planck constant is accepted widely. It is desirable that Planck constant is mathematically successful because we predict unknown physical phenomena precisely. Sometimes such predictions are effective in the field of elementary particle physics. We endure much time in order to see the fact by using for example large-scale accelerator. Rolf Landauer says Information is Physical [8]. We cannot create any computer without physical phenomena. This fact motivates us to investigate the Hilbert space formalism of Planck constant. Here we ask. Does Planck constant depicture our physical world? Unfortunately it is not so even in both the macroscopic scale and the microscopic scale. The theoretical formalism of the implementation of the Deutsch-Jozsa algorithm [1, 18] relies on Planck constant. We cannot implement the Deutsch-Jozsa algorithm by using Planck constant. In this paper we investigate whether Planck constant meets our physical world. We derive a proposition concerning a quantum expectation value under the assumption of the existence of the orientation of reference frames in spin-1/ systems. This assumption intuitively depictures our physical world. The quantum predictions within the formalism of Planck constant violate the proposition with a magnitude that grows exponentially with the number of particles. Planck constant cannot depicture our physical world with a violation factor that grows exponentially with the number of particles. Planck constant cannot meet our physical world. We formulate Planck constant. Our formulation is equivalent to changing Planck constant (h) to new constant
3 Planck constant and the Deutsch-Jozsa algorithm 975 (h/ Dimension). We use an established mathematical method presented in Refs. [1, 19, 0, 1,,, 4, 5]. In what follows we confine ourselves to the two-level (e.g. electron spin, photon polarizations, and so on). In what follows we confine ourselves to the discrete eigenvalue case. Problem of Planck constant.1 Plane settings model.1.1 Original Planck constant Assume that we have a set of spins 1. Each of them is a spin-1/ pure state lying in the z-x plane. Assume that one source of uncorrelated spin-carrying particles emits them in a state which can be described as a multi spin-1/ pure uncorrelated state. Parameterize the settings of the jth observer with a unit vector n j (its direction along which the spin component is measured) with j = 1,...,. We can introduce the Planck correlation function which is the average of the product of the results of measurements E Planck ( n 1, n,..., n )= r( n 1, n,..., n ) avg (1) where r is the result. The value of r is ±1 (in ( /) unit) which is obtained if the measurement directions are set at n 1, n,..., n if we accept Planck constant. Also we can introduce a quantum correlation function with the system in a multi spin-1/ pure uncorrelated state E QM ( n 1, n,..., n )=Tr[ρ n 1 σ n σ n σ]. () denotes the tensor product. denotes the scalar product in R. σ =(σ z,σ x ) denotes a vector of two Pauli operators. ρ denotes a multi spin-1/ pure uncorrelated state ρ = ρ 1 ρ ρ () with ρ j = Ψ j Ψ j. Ψ j is a spin-1/ pure state lying in the z-x plane. We can write the observable (unit) vector n j in a plane coordinate system as follows n j (θ k j j ) = cos θk j j x(1) j + sin θ k j j x() j (4)
4 976 K. agata and T. akamura where x (1) j = z j and x () j values θj 1 =0,θj = π,...,θn 1 j = n = x j are the Cartesian axes. The angle θ k j j (n )π, and θj n = n takes n (n 1)π. (5) n We derive a necessary condition to be satisfied by the quantum correlation function with the system in a multi spin-1/ pure uncorrelated state given in (). In more detail we derive (E QM,E QM ) which is the value of the scalar product of the quantum correlation function E QM given in (). We use decomposition (4). We introduce simplified notations as and Then we have T i1 i...i =Tr[ρ x (i 1) 1 σ x (i ) σ x (i ) σ] (6) (E QM,E QM )= c j =(c 1 j,c j ) = (cos θk j j, sin θk j j ). (7) n k 1 =1 ( n k =1 i 1,...,i =1 T i1...i c i 1 1 c i ) ( n ) = i 1,...,i =1 T i 1...i ( n ) (8) where we use the orthogonality relation n k j =1 cα j cβ j = nδ α,β. The value of i 1,...,i =1 T i 1...i is bounded as i 1,...,i =1 T i 1...i 1. We have j=1 i j =1 (Tr[ρ j x (i j) j σ]) 1. (9) It is important that the inequality (8) is saturated iff ρ is a multi spin-1/ pure uncorrelated state such that ρ j = Ψ j Ψ j and Ψ j is a spin-1/ pure state lying in the z-x plane for every j. The reason of the inequality (8) is due to the following quantum inequality (Tr[ρ j x (i j) j σ]) 1. (10) i j =1 The inequality (10) is saturated iff ρ j = Ψ j Ψ j and Ψ j is a spin-1/ pure state lying in the z-x plane. The inequality (8) is saturated iff the inequality
5 Planck constant and the Deutsch-Jozsa algorithm 977 (10) is saturated for every j. Thus we have the maximal possible value of the scalar product as a quantum proposition concerning our physical world ( n ) (E QM,E QM ) max = (11) when the system is in a multi spin-1/ pure uncorrelated state. On the other hand a correlation function satisfies Planck constant if it can be written as E Planck ( n 1, n,..., n ) = lim r( n 1, n,..., n,l) m (1) where l denotes a label and r denotes the result of measurements of the dichotomic observables parameterized by directions of n 1, n,..., n. Assume the quantum correlation function with the system in a multi spin- 1/ pure uncorrelated state given in () admits Planck constant. We have the following proposition concerning Planck constant E QM ( n 1, n,..., n ) = lim r( n 1, n,..., n,l). (1) m In what follows we show that we cannot assign the truth value 1 for the proposition (1) concerning Planck constant. Assume the proposition (1) is true. We have same quantum correlation function by changing the label l into l and by changing the label m into m as follows l E QM ( n 1, n,..., n ) = lim =1 r( n 1, n,..., n,l ). (14) m m The value of the right-hand-side of (1) is equal to the value of the righthand-side of (14) because we only change the labels. We abbreviate r( n 1, n,..., n,l)tor(l). We abbreviate r( n 1, n,..., n,l ) to r(l ).
6 978 K. agata and T. akamura We have (E QM,E QM ) ( n n = = = k 1 =1 n k 1 =1 n k 1 =1 n k 1 =1 We use the following k =1 ( n k =1 ( n k =1 ( n k =1 lim lim lim lim r(l) ) m l lim =1 r(l ) m m m ) m m lim l =1 r(l)r(l ) m m m m ) lim l =1 r(l)r(l ) m m ) m lim l =1 = n. (15) m m r( n 1, n,..., n,l) r( n 1, n,..., n,l ) =1. (16) The inequality (15) is saturated since we have {l r( n 1, n,..., n,l)=1 l } = {l r( n 1, n,..., n,l )=1 l } and {l r( n 1, n,..., n,l)= 1 l } = {l r( n 1, n,..., n,l )= 1 l }.(17) denotes {1,,...,+ }. Hence we have the following proposition concerning Planck constant (E QM,E QM ) max = n. (18) We cannot assign the truth value 1 for two propositions (11) (concerning our physical world) and (18) (concerning Planck constant) simultaneously when the system is in a multi spin-1/ pure uncorrelated state. Each of them is a spin-1/ pure state lying in the z-x plane. We are in the contradiction when the system is in a multi spin-1/ pure uncorrelated state. We cannot accept the validity of the proposition (1) (concerning Planck constant) if we assign the truth value 1 for the proposition (11) (concerning our physical world). In other words Planck constant does not reveal our physical world..1. Reformulation of Planck constant We formulate Planck constant. We have the maximal possible value of the scalar product as a quantum proposition concerning our physical world ( n ) (E QM,E QM ) max = (19)
7 Planck constant and the Deutsch-Jozsa algorithm 979 when the system is in a multi spin-1/ pure uncorrelated state. On the other hand we have the following proposition concerning Planck constant (E QM,E QM ) max = n. (0) We cannot assign the truth value 1 for two propositions (19) (concerning our physical world) and (0) (concerning Planck constant) simultaneously when the system is in a multi spin-1/ pure uncorrelated state. Each of them is a spin-1/ pure state lying in the z-x plane. We are in the contradiction when the system is in a multi spin-1/ pure uncorrelated state. We formulate Planck constant as follows. Formulated Planck constant: h. (1) The value of r is ±( 1 ) (in ( /) unit) which is obtained if the measurement directions are set at n 1, n,..., n if we accept formulated Planck constant. The proposition (0) (concerning Planck constant) becomes the following new proposition concerning formulated Planck constant when we accept formulated Planck constant ( n ) (E QM,E QM ) max =. () We can assign the truth value 1 for both two propositions (19) (concerning our physical world) and () (concerning formulated Planck constant) simultaneously when the system is in a multi spin-1/ pure uncorrelated state. Each of them is a spin-1/ pure state lying in the z-x plane. We are not in the contradiction when the system is in a multi spin-1/ pure uncorrelated state. We solve the contradiction presented in the previous section by formulating Planck constant..1. ew type of the Deutsch-Jozsa algorithm The earliest quantum algorithm, the Deutsch-Jozsa algorithm, is representative to show that quantum computation is faster than classical counterpart with a magnitude that grows exponentially with the number of qubits. Let us follow the argumentation presented in [8]. The application, known as Deutsch s problem, may be described as the following game. Alice, in Amsterdam, selects a number x from 0 to 1, and mails it in a letter to Bob, in Boston. Bob calculates the value of some function f : {0,..., 1}
8 980 K. agata and T. akamura {0, 1} and replies with the result, which is either 0 or 1. ow, Bob has promised to use a function f which is of one of two kinds; either the value of f(x) is constant for all values of x, or else the value of f(x) is balanced, that is, equal to 1 for exactly half of all the possible x, and 0 for the other half. Alice s goal is to determine with certainty whether Bob has chosen a constant or a balanced function, corresponding with him as little as possible. How fast can she succeed? In the classical case, Alice may only send Bob one value of x in each letter. At worst, Alice will need to query Bob at least / + 1 times, since she may receive / 0s before finally getting a 1, telling her that Bob s function is balanced. The best deterministic classical algorithm she can use therefore requires / + 1 queries. ote that in each letter, Alice sends Bob bits of information. Furthermore, in this example, physical distance is being used to artificially elevate the cost of calculating f(x), but this is not needed in the general problem, where f(x) may be inherently difficult to calculate. If Bob and Alice were able to exchange qubits, instead of just classical bits, and if Bob agreed to calculate f(x) using a unitary transformation U f, then Alice could achieve her goal in just one correspondence with Bob, using the following algorithm. Alice has an qubit register to store her query in, and a single qubit register which she will give to Bob, to store the answer in. She begins by preparing both her query and answer registers in a superposition state. Bob will evaluate f(x) using quantum parallelism and leave the result in the answer register. Alice then interferes states in the superposition using a Hadamard transformation (a unitary transformation), H =(σ z + σ x )/, on the query register, and finishes by performing a suitable measurement to determine whether f was constant or balanced. Let us follow the quantum states through this algorithm. The input state is ψ 0 = 0 1. () Here the query register describes the state of qubits all prepared in the 0 state. After the Hadamard transformation on the query register and the Hadamard gate on the answer register we have ψ 1 = x {0,1} x [ ] 0 1. (4) The query register is now a superposition of all values, and the answer register is in an evenly weighted superposition of 0 and 1. ext, the function f is
9 Planck constant and the Deutsch-Jozsa algorithm 981 evaluated (by Bob) using U f : x, y x, y f(x), giving ( 1) f(x) x [ ] 0 1. (5) ψ = ± x Here y f(x) is the bitwise XOR (exclusive OR) of y and f(x). Alice now has a set of qubits in which the result of Bob s function evaluation is stored in the amplitude of the qubit superposition state. She now interferes terms in the superposition using a Hadamard transformation on the query register. To determine the result of the Hadamard transformation it helps to first calculate the effect of the Hadamard transformation on a state x. By checking the cases x = 0 and x = 1 separately we see that for a single qubit H x = z ( 1)xz z /. Thus H x 1,...,x z = 1,...,z ( 1) x 1z 1 + +x z z 1,...,z. (6) This can be summarized more succinctly in the very useful equation H z ( 1)x z z x =, (7) where x z is the bitwise inner product of x and z, modulo. Using this equation and (5) we can now evaluate ψ, ψ = ± [ ] ( 1) x z+f(x) z 0 1. (8) z x Alice now observes the query register. ote that the absolute value of the amplitude for the state 0 is x ( 1)f(x) /. Let s look at the two possible cases f constant and f balanced to discern what happens. In the case where f is constant the absolute value of the amplitude for 0 is +1. Because ψ is of unit length it follows that all the other amplitudes must be zero, and an observation will yield (+ 1 )s for all qubits in the query register. Thus, global measurement outcome is (+ 1 ). If f is balanced then the positive and negative contributions to the absolute value of the amplitude for 0 cancel, leaving an amplitude of zero, and a measurement must yield a result other than + 1 (i.e., 1 ) on at least one qubit in the query register. Summarizing, if Alice measures all (+ 1 )s and global measurement outcome is (+ 1 ) the function is constant; otherwise the function is balanced. We notice that the difference between + 1 and 1 is approximately zero when 1. We question if the Deutsch-Jozsa algorithm in the macroscopic scale is possible or not. This question is open problem.
10 98 K. agata and T. akamura. Sphere settings model..1 Original Planck constant Assume that we have a set of spins 1. Each of them is a spin-1/ pure state. Assume that one source of uncorrelated spin-carrying particles emits them in a state which can be described as a multi spin-1/ pure uncorrelated state. Parameterize the settings of the jth observer with a unit vector n j (its direction along which the spin component is measured) with j = 1,...,. We can introduce the Planck correlation function which is the average of the product of the results of measurements E Planck ( n 1, n,..., n )= r( n 1, n,..., n ) avg (9) where r is the result of measurements. The value of r is ±1 (in ( /) unit) which is obtained if the measurement directions are set at n 1, n,..., n if we accept Planck constant. Also we can introduce a quantum correlation function with the system in a multi spin-1/ pure uncorrelated state E QM ( n 1, n,..., n )=Tr[ρ n 1 σ n σ n σ]. (0) denotes the tensor product. denotes the scalar product in R. σ = (σ z,σ x,σ y ) denotes the vector of Pauli operator. ρ denotes a multi spin-1/ pure uncorrelated state ρ = ρ 1 ρ ρ (1) with ρ j = Ψ j Ψ j. Ψ j is a spin-1/ pure state. We can write the observable (unit) vector n j in a spherical coordinate system as follows n j (θ j,φ j ) = sin θ j cos φ j x (1) j + sin θ j sin φ j x () j + cos θ j x () j () where x (1) j = z j, x () j = x j, and x () j = y j are the Cartesian axes. We derive a necessary condition to be satisfied by the quantum correlation function with the system in a multi spin-1/ pure uncorrelated state given in (0). In more detail we derive (E QM,E QM ) which is the value of the scalar product of the quantum correlation function E QM given in (0). We use decomposition (). We introduce the measure dω j = sin θ j dθ j dφ j for the system of the jth observer. We introduce simplified notations as T i1 i...i =Tr[ρ x (i 1) 1 σ x (i ) σ x (i ) σ] ()
11 Planck constant and the Deutsch-Jozsa algorithm 98 and Then we have c j =(c 1 j,c j,c j) = (sin θ j cos φ j, sin θ j sin φ j, cos θ j ). (4) (E QM,E QM )= ( dω 1 dω i 1,...,i =1 T i1...i c i 1 1 c i ) = ( ) 4π Ti 1...i i 1,...,i =1 ( ) 4π (5) where we use the orthogonality relation dω j c α j cβ j = 4πδ α,β. The value of i 1,...,i =1 T i 1...i is bounded as i 1,...,i =1 T i 1...i 1. We have j=1 i j =1 (Tr[ρ j x (i j) j σ]) 1. (6) It is important that this inequality is saturated iff ρ is a multi spin-1/ pure uncorrelated state. The reason of the inequality (5) is due to the Bloch sphere (Tr[ρ j x (i j) j σ]) 1. (7) i j =1 The inequality (7) is saturated iff ρ j = Ψ j Ψ j and Ψ j is a spin-1/ pure state. The inequality (5) is saturated iff the inequality (7) is saturated for every j. Thus we have the maximal possible value of the scalar product as a quantum proposition concerning our physical world (E QM,E QM ) max = ( ) 4π (8) when the system is in a multi spin-1/ pure uncorrelated state. On the other hand a correlation function satisfies Planck constant if it can be written as E Planck ( n 1, n,..., n ) = lim r( n 1, n,..., n,l) m (9) where l denotes a label and r denotes the result of measurements of the dichotomic observables parameterized by directions of n 1, n,..., n.
12 984 K. agata and T. akamura Assume the quantum correlation function with the system in a multi spin- 1/ pure uncorrelated state given in (0) admits Planck constant. We have the following proposition concerning Planck constant E QM ( n 1, n,..., n ) = lim r( n 1, n,..., n,l). (40) m In what follows we show that we cannot assign the truth value 1 for the proposition (40) concerning Planck constant. Assume the proposition (40) is true. We have same quantum correlation function by changing the label l into l and by changing the label m into m as follows l E QM ( n 1, n,..., n ) = lim =1 r( n 1, n,..., n,l ). (41) m m The value of the right-hand-side of (40) is equal to the value of the righthand-side of (41) because we only change the labels. We abbreviate r( n 1, n,..., n,l)tor(l). We abbreviate r( n 1, n,..., n,l ) to r(l ). We have We use the following (E QM,E QM ) ( = dω 1 dω ( = dω 1 dω ( dω 1 dω ( = dω 1 dω lim r(l) m lim lim lim m m m lim m lim l =1 m lim m lim m ) l =1 r(l ) m m r(l)r(l ) ) l =1 r(l)r(l ) m ) m l =1 m ) =(4π). (4) r( n 1, n,..., n,l) r( n 1, n,..., n,l ) =1. (4) The inequality (4) is saturated since we have {l r( n 1, n,..., n,l)=1 l } = {l r( n 1, n,..., n,l )=1 l } and {l r( n 1, n,..., n,l)= 1 l } = {l r( n 1, n,..., n,l )= 1 l }.(44)
13 Planck constant and the Deutsch-Jozsa algorithm 985 Hence we have the following proposition concerning Planck constant (E QM,E QM ) max =(4π). (45) We cannot assign the truth value 1 for two propositions (8) (concerning our physical world) and (45) (concerning Planck constant) simultaneously when the system is in a multi spin-1/ pure uncorrelated state. Each of them is a spin-1/ pure state. We are in the contradiction when the system is in a multi spin-1/ pure uncorrelated state. Thus we cannot accept the validity of the proposition (40) (concerning Planck constant) if we assign the truth value 1 for the proposition (8) (concerning our physical world). In other words Planck constant does not reveal our physical world... Reformulation of Planck constant We formulate Planck constant. We have the maximal possible value of the scalar product as a quantum proposition concerning our physical world ( ) 4π (E QM,E QM ) max = (46) when the system is in a multi spin-1/ pure uncorrelated state. On the other hand we have the following proposition concerning Planck constant (E QM,E QM ) max =(4π). (47) We cannot assign the truth value 1 for two propositions (46) (concerning our physical world) and (47) (concerning Planck constant) simultaneously when the system is in a multi spin-1/ pure uncorrelated state. We are in the contradiction when the system is in a multi spin-1/ pure uncorrelated state. We formulate Planck constant as follows. Formulated Planck constant: h. (48) The value of r is ±( 1 ) (in ( /) unit) which is obtained if the measurement directions are set at n 1, n,..., n if we accept formulated Planck constant. The proposition (47) (concerning Planck constant) becomes the following new proposition concerning formulated Planck constant when we accept formulated Planck constant (E QM,E QM ) max = ( ) 4π. (49)
14 986 K. agata and T. akamura We can assign the truth value 1 for both two propositions (46) (concerning our physical world) and (49) (concerning formulated Planck constant) simultaneously when the system is in a multi spin-1/ pure uncorrelated state. We are not in the contradiction when the system is in a multi spin-1/ pure uncorrelated state. We solve the contradiction presented in the previous section by formulating Planck constant... ew type of the Deutsch-Jozsa algorithm The earliest quantum algorithm, the Deutsch-Jozsa algorithm, is representative to show that quantum computation is faster than classical counterpart with a magnitude that grows exponentially with the number of qubits. Let us follow the argumentation presented in [8]. The application, known as Deutsch s problem, may be described as the following game. Alice, in Amsterdam, selects a number x from 0 to 1, and mails it in a letter to Bob, in Boston. Bob calculates the value of some function f : {0,..., 1} {0, 1} and replies with the result, which is either 0 or 1. ow, Bob has promised to use a function f which is of one of two kinds; either the value of f(x) is constant for all values of x, or else the value of f(x) is balanced, that is, equal to 1 for exactly half of all the possible x, and 0 for the other half. Alice s goal is to determine with certainty whether Bob has chosen a constant or a balanced function, corresponding with him as little as possible. How fast can she succeed? In the classical case, Alice may only send Bob one value of x in each letter. At worst, Alice will need to query Bob at least / + 1 times, since she may receive / 0s before finally getting a 1, telling her that Bob s function is balanced. The best deterministic classical algorithm she can use therefore requires / + 1 queries. ote that in each letter, Alice sends Bob bits of information. Furthermore, in this example, physical distance is being used to artificially elevate the cost of calculating f(x), but this is not needed in the general problem, where f(x) may be inherently difficult to calculate. If Bob and Alice were able to exchange qubits, instead of just classical bits, and if Bob agreed to calculate f(x) using a unitary transformation U f, then Alice could achieve her goal in just one correspondence with Bob, using the following algorithm. Alice has an qubit register to store her query in, and a single qubit register which she will give to Bob, to store the answer in. She begins by preparing both her query and answer registers in a superposition state. Bob will evaluate f(x) using quantum parallelism and leave the result in the answer register.
15 Planck constant and the Deutsch-Jozsa algorithm 987 Alice then interferes states in the superposition using a Hadamard transformation (a unitary transformation), H =(σ z + σ x )/, on the query register, and finishes by performing a suitable measurement to determine whether f was constant or balanced. Let us follow the quantum states through this algorithm. The input state is ψ 0 = 0 1. (50) Here the query register describes the state of qubits all prepared in the 0 state. After the Hadamard transformation on the query register and the Hadamard gate on the answer register we have ψ 1 = x {0,1} x [ ] 0 1. (51) The query register is now a superposition of all values, and the answer register is in an evenly weighted superposition of 0 and 1. ext, the function f is evaluated (by Bob) using U f : x, y x, y f(x), giving ( 1) f(x) x [ ] 0 1. (5) ψ = ± x Here y f(x) is the bitwise XOR (exclusive OR) of y and f(x). Alice now has a set of qubits in which the result of Bob s function evaluation is stored in the amplitude of the qubit superposition state. She now interferes terms in the superposition using a Hadamard transformation on the query register. To determine the result of the Hadamard transformation it helps to first calculate the effect of the Hadamard transformation on a state x. By checking the cases x = 0 and x = 1 separately we see that for a single qubit H x = z ( 1)xz z /. Thus H x 1,...,x z = 1,...,z ( 1) x 1z 1 + +x z z 1,...,z. (5) This can be summarized more succinctly in the very useful equation H z ( 1)x z z x =, (54) where x z is the bitwise inner product of x and z, modulo. equation and (5) we can now evaluate ψ, ψ = ± z x ( 1) x z+f(x) z Using this [ 0 1 ]. (55)
16 988 K. agata and T. akamura Alice now observes the query register. ote that the absolute value of the amplitude for the state 0 is x ( 1)f(x) /. Let s look at the two possible cases f constant and f balanced to discern what happens. In the case where f is constant the absolute value of the amplitude for 0 is +1. Because ψ is of unit length it follows that all the other amplitudes must be zero, and an observation will yield (+ 1 )s for all qubits in the query register. Thus, global measurement outcome is (+ 1 ). If f is balanced then the positive and negative contributions to the absolute value of the amplitude for 0 cancel, leaving an amplitude of zero, and a measurement must yield a result other than + 1 (i.e., 1 ) on at least one qubit in the query register. Summarizing, if Alice measures all (+ 1 )s and global measurement outcome is (+ 1 ) the function is constant; otherwise the function is balanced. We notice that the difference between + 1 and 1 is approximately zero when 1. We question if the Deutsch-Jozsa algorithm in the macroscopic scale is possible or not. This question is open problem. Conclusions In conclusion we have investigated whether Planck constant meets our physical world. We have derived a proposition concerning a quantum expectation value under the assumption of the existence of the orientation of reference frames in spin-1/ systems. The quantum predictions within the formalism of Planck constant have violated the proposition with a magnitude that grows exponentially with the number of particles. Planck constant cannot have depictured our physical world with a violation factor that grows exponentially with the number of particles. Planck constant cannot have met our physical world. We have formulated Planck constant. Our formulation has been equivalent to changing Planck constant (h) to new constant (h/ Dimension). References [1] K. agata, Int J Theor Phys: Volume 48, Issue 1 (009), Page 5: DOI: /s z. [] Planck constant - Wikipedia, the free encyclopedia. [] J. von eumann, Mathematical Foundations of Quantum Mechanics (Princeton University Press, Princeton, ew Jersey, 1955).
17 Planck constant and the Deutsch-Jozsa algorithm 989 [4] R. P. Feynman, R. B. Leighton, and M. Sands, Lectures on Physics, Volume III, Quantum mechanics (Addison-Wesley Publishing Company, 1965). [5] M. Redhead, Incompleteness, onlocality, and Realism (Clarendon Press, Oxford, 1989), nd ed. [6] A. Peres, Quantum Theory: Concepts and Methods (Kluwer Academic, Dordrecht, The etherlands, 199). [7] J. J. Sakurai, Modern Quantum Mechanics (Addison-Wesley Publishing Company, 1995), Revised ed. [8] M. A. ielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, 000). [9] A. J. Leggett, Found. Phys., 1469 (00). [10] S. Gröblacher, T. Paterek, R. Kaltenbaek, Č. Brukner, M. Żukowski, M. Aspelmeyer, and A. Zeilinger, ature (London) 446, 871 (007). [11] T. Paterek, A. Fedrizzi, S. Gröblacher, T. Jennewein, M. Żukowski, M. Aspelmeyer, and A. Zeilinger, Phys. Rev. Lett. 99, (007). [1] C. Branciard, A. Ling,. Gisin, C. Kurtsiefer, A. Lamas-Linares, and V. Scarani, Phys. Rev. Lett. 99, (007). [1] D. Deutsch, Proc. Roy. Soc. London Ser. A 400, 97 (1985). [14] A.. de Oliveira, S. P. Walborn, and C. H. Monken, J. Opt. B: Quantum Semiclass. Opt. 7, 88-9 (005). [15] Y.-H. Kim, Phys. Rev. A 67, 04001(R) (00). [16] M. Mohseni, J. S. Lundeen, K. J. Resch, and A. M. Steinberg, Phys. Rev. Lett. 91, (00). [17] M. S. Tame, R. Prevedel, M. Paternostro, P. Böhi, M. S. Kim, and A. Zeilinger, Phys. Rev. Lett. 98, (007). [18] D. Deutsch and R. Jozsa, Proc. Roy. Soc. London Ser. A 49, 55 (199). [19] K. agata, Eur. Phys. J. D 56, 441 (010). [0] K. agata and T. akamura, Int. J. Theor. Phys. 48, 87 (009). [1] K. agata and T. akamura, Int. J. Theor. Phys. 49, 16 (010).
18 990 K. agata and T. akamura [] K. agata and T. akamura, Adv. Studies Theor. Phys. 4, 197 (010). [] K. agata and T. akamura, arxiv: [4] K. agata and T. akamura, Advances and Applications in Statistical Sciences, Volume, Issue 1, (010), Page 195. [5] K. agata and T. akamura, Adv. Studies Theor. Phys. (010) Does singleton set meet Zermelo-Fraenkel set theory with the axiom of choice? Received: September, 010
The Two Quantum Measurement Theories and the Bell-Kochen-Specker Paradox
International Journal of Electronic Engineering Computer Science Vol. 1, No. 1, 2016, pp. 40-44 http://www.aiscience.org/journal/ijeecs The Two Quantum Measurement Theories the Bell-Kochen-Specker Paradox
More informationOn the Bell- Kochen -Specker paradox
On the Bell- Kochen -Specker paradox Koji Nagata and Tadao Nakaura Departent of Physics, Korea Advanced Institute of Science and Technology, Daejeon, Korea E-ail: ko_i_na@yahoo.co.jp Departent of Inforation
More informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationSUPPLEMENTARY INFORMATION
doi: 1.138/nature5677 An experimental test of non-local realism Simon Gröblacher, 1, Tomasz Paterek, 3, 4 Rainer Kaltenbaek, 1 Časlav Brukner, 1, Marek Żukowski,3, 1 Markus Aspelmeyer, 1, and Anton Zeilinger
More informationShort introduction to Quantum Computing
November 7, 2017 Short introduction to Quantum Computing Joris Kattemölle QuSoft, CWI, Science Park 123, Amsterdam, The Netherlands Institute for Theoretical Physics, University of Amsterdam, Science Park
More informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationUnitary evolution: this axiom governs how the state of the quantum system evolves in time.
CS 94- Introduction Axioms Bell Inequalities /7/7 Spring 7 Lecture Why Quantum Computation? Quantum computers are the only model of computation that escape the limitations on computation imposed by the
More informationIntroduction to Quantum Computation
Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical
More informationJoint Distributions and Quantum Nonlocal Models
Axioms 2014, 3, 166-176; doi:10.3390/axioms3020166 OPEN ACCESS axioms ISSN 2075-1680 www.mdpi.com/journal/axioms/ Communication Joint Distributions and Quantum Nonlocal Models James D. Malley * and Anthony
More informationIntroduction to Quantum Information Hermann Kampermann
Introduction to Quantum Information Hermann Kampermann Heinrich-Heine-Universität Düsseldorf Theoretische Physik III Summer school Bleubeuren July 014 Contents 1 Quantum Mechanics...........................
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationEntanglement and Quantum Teleportation
Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,
More informationAn 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
More informationAQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013
AQI: Advanced Quantum Information Lecture 6 (Module 2): Distinguishing Quantum States January 28, 2013 Lecturer: Dr. Mark Tame Introduction With the emergence of new types of information, in this case
More informationErrata list, Nielsen & Chuang. rrata/errata.html
Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation
More informationQLang: 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
More informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationHilbert 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
More informationThe controlled-not (CNOT) gate exors the first qubit into the second qubit ( a,b. a,a + b mod 2 ). Thus it permutes the four basis states as follows:
C/CS/Phys C9 Qubit gates, EPR, ell s inequality 9/8/05 Fall 005 Lecture 4 Two-qubit gate: COT The controlled-not (COT) gate exors the first qubit into the second qubit ( a,b a,a b = a,a + b mod ). Thus
More informationAn introduction to Quantum Computing using Trapped cold Ions
An introduction to Quantum Computing using Trapped cold Ions March 10, 011 Contents 1 Introduction 1 Qubits 3 Operations in Quantum Computing 3.1 Quantum Operators.........................................
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationQuantum gate. Contents. Commonly used gates
Quantum gate From Wikipedia, the free encyclopedia In quantum computing and specifically the quantum circuit model of computation, a quantum gate (or quantum logic gate) is a basic quantum circuit operating
More informationLecture: Quantum Information
Lecture: Quantum Information Transcribed by: Crystal Noel and Da An (Chi Chi) November 10, 016 1 Final Proect Information Find an issue related to class you are interested in and either: read some papers
More informationQuantum information and quantum computing
Middle East Technical University, Department of Physics January 7, 009 Outline Measurement 1 Measurement 3 Single qubit gates Multiple qubit gates 4 Distinguishability 5 What s measurement? Quantum measurement
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationQuantum Communication
Quantum Communication Harry Buhrman CWI & University of Amsterdam Physics and Computing Computing is physical Miniaturization quantum effects Quantum Computers ) Enables continuing miniaturization ) Fundamentally
More informationLecture 4: Elementary Quantum Algorithms
CS 880: Quantum Information Processing 9/13/010 Lecture 4: Elementary Quantum Algorithms Instructor: Dieter van Melkebeek Scribe: Kenneth Rudinger This lecture introduces several simple quantum algorithms.
More informationLecture 1: Overview of quantum information
CPSC 59/69: Quantum Computation John Watrous, University of Calgary References Lecture : Overview of quantum information January 0, 006 Most of the material in these lecture notes is discussed in greater
More informationChapter 2 The Density Matrix
Chapter 2 The Density Matrix We are going to require a more general description of a quantum state than that given by a state vector. The density matrix provides such a description. Its use is required
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2016 Mika Hirvensalo Basics on quantum information 1 of 52 Brief
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationInformation 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
More informationMax-Planck-Institut für Mathematik in den Naturwissenschaften Leipzig
Max-Planck-Institut für Mathematik in den aturwissenschaften Leipzig Bell inequality for multipartite qubit quantum system and the maximal violation by Ming Li and Shao-Ming Fei Preprint no.: 27 2013 Bell
More informationGisin s theorem for three qubits Author(s) Jing-Ling Chen, Chunfeng Wu, L. C. Kwek and C. H. Oh Source Physical Review Letters, 93,
Title Gisin s theorem for three qubits Author(s) Jing-Ling Chen, Chunfeng Wu, L. C. Kwek and C. H. Oh Source Physical Review Letters, 93, 140407 This document may be used for private study or research
More informationInstantaneous Nonlocal Measurements
Instantaneous Nonlocal Measurements Li Yu Department of Physics, Carnegie-Mellon University, Pittsburgh, PA July 22, 2010 References Entanglement consumption of instantaneous nonlocal quantum measurements.
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationChapter 2. Basic Principles of Quantum mechanics
Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical
More informationBell s inequalities and their uses
The Quantum Theory of Information and Computation http://www.comlab.ox.ac.uk/activities/quantum/course/ Bell s inequalities and their uses Mark Williamson mark.williamson@wofson.ox.ac.uk 10.06.10 Aims
More informationQuantum 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
More informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
More informationQuantum Information Types
qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
More informationQuantum Communication Complexity
Quantum Communication Complexity Ronald de Wolf Communication complexity has been studied extensively in the area of theoretical computer science and has deep connections with seemingly unrelated areas,
More informationROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL
arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,
More informationBorromean Entanglement Revisited
Borromean Entanglement Revisited Ayumu SUGITA Abstract An interesting analogy between quantum entangled states and topological links was suggested by Aravind. In particular, he emphasized a connection
More informationQUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36
QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING
More informationC/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21
C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 1 Readings Benenti et al, Ch 310 Stolze and Suter, Quantum Computing, Ch 84 ielsen and Chuang, Quantum Computation and Quantum
More informationBasics on quantum information
Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief
More information6.896 Quantum Complexity Theory September 9, Lecture 2
6.96 Quantum Complexity Theory September 9, 00 Lecturer: Scott Aaronson Lecture Quick Recap The central object of study in our class is BQP, which stands for Bounded error, Quantum, Polynomial time. Informally
More informationSemiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005
Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron
More informationQuantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)
Quantum Computation Alessandra Di Pierro alessandra.dipierro@univr.it 21 Info + Programme Info: http://profs.sci.univr.it/~dipierro/infquant/ InfQuant1.html Preliminary Programme: Introduction and Background
More informationPerfect quantum teleportation and dense coding protocols via the 2N-qubit W state
Perfect quantum teleportation and dense coding protocols via the -qubit W state Wang Mei-Yu( ) a)b) and Yan Feng-Li( ) a)b) a) College of Physics Science and Information Engineering, Hebei ormal University,
More informationNew Quantum Algorithm Solving the NP Complete Problem
ISSN 070-0466, p-adic Numbers, Ultrametric Analysis and Applications, 01, Vol. 4, No., pp. 161 165. c Pleiades Publishing, Ltd., 01. SHORT COMMUNICATIONS New Quantum Algorithm Solving the NP Complete Problem
More informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
More informationComments on There is no axiomatic system for the. quantum theory. Noname manuscript No. (will be inserted by the editor) J.
Noname manuscript No. (will be inserted by the editor) Comments on There is no axiomatic system for the quantum theory J. Acacio de Barros the date of receipt and acceptance should be inserted later Abstract
More information6. Composites systems and Entanglement
6. Composites systems and Entanglement 6.1 Tensor product of Hilbert spaces 6.1.1 Product Operator Basis 6. Quantum Information Processing 6.3 Operators on two Qubits 6.4 No cloning Theorem 6.5 Entanglement
More informationQuantum theory without predefined causal structure
Quantum theory without predefined causal structure Ognyan Oreshkov Centre for Quantum Information and Communication, niversité Libre de Bruxelles Based on work with Caslav Brukner, Nicolas Cerf, Fabio
More informationarxiv: v2 [quant-ph] 21 Oct 2013
Genuine hidden quantum nonlocality Flavien Hirsch, 1 Marco Túlio Quintino, 1 Joseph Bowles, 1 and Nicolas Brunner 1, 1 Département de Physique Théorique, Université de Genève, 111 Genève, Switzerland H.H.
More informationIntroduction to Quantum Mechanics
Introduction to Quantum Mechanics R. J. Renka Department of Computer Science & Engineering University of North Texas 03/19/2018 Postulates of Quantum Mechanics The postulates (axioms) of quantum mechanics
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Petros Wallden Lecture 3: Basic Quantum Mechanics 26th September 2016 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information
More informationBell inequality, Bell states and maximally entangled states for n qubits
7 September 1998 Physics Letters A 26 (1998) 116 Bell inequality, Bell states and maximally entangled states for n qubits N. Gisin, H. Bechmann-Pasquinucci Group of Applied Physics, University of Geneva,
More informationSUPERDENSE CODING AND QUANTUM TELEPORTATION
SUPERDENSE CODING AND QUANTUM TELEPORTATION YAQIAO LI This note tries to rephrase mathematically superdense coding and quantum teleportation explained in [] Section.3 and.3.7, respectively (as if I understood
More informationAn Introduction to Quantum Information. By Aditya Jain. Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata
An Introduction to Quantum Information By Aditya Jain Under the Guidance of Dr. Guruprasad Kar PAMU, ISI Kolkata 1. Introduction Quantum information is physical information that is held in the state of
More informationQuantum Theory Based On Information And Entropy
University of Vienna Faculty of Physics Boltzmanngasse 5, 1090 Wien Quantum Theory Based On Information And Entropy Author: Martin Pimon Supervisor: Ao. Univ.-Prof. i.r. Dr. Reinhold Bertlmann July 31,
More informationPh 219/CS 219. Exercises Due: Friday 3 November 2006
Ph 9/CS 9 Exercises Due: Friday 3 November 006. Fidelity We saw in Exercise. that the trace norm ρ ρ tr provides a useful measure of the distinguishability of the states ρ and ρ. Another useful measure
More informationProbabilistic exact cloning and probabilistic no-signalling. Abstract
Probabilistic exact cloning and probabilistic no-signalling Arun Kumar Pati Quantum Optics and Information Group, SEECS, Dean Street, University of Wales, Bangor LL 57 IUT, UK (August 5, 999) Abstract
More informationLogical independence and quantum randomness
New Journal of Physics The open access journal for physics Logical independence and quantum randomness T Paterek 1,3,5, J Kofler 1,2, R Prevedel 2, P Klimek 2,4, M Aspelmeyer 1,2, A Zeilinger 1,2 and Č
More informationLecture 20: Bell inequalities and nonlocality
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 0: Bell inequalities and nonlocality April 4, 006 So far in the course we have considered uses for quantum information in the
More informationA coarse-grained Schrödinger cat
A coarse-grained Schrödinger cat Johannes KOFLER and Časlav BRUKNER Institut für Quantenoptik und Quanteninformation, Österreichische Akademie der Wissenschaften, Boltzmanngasse 3, 1090 Wien, Austria;
More informationexample: e.g. electron spin in a field: on the Bloch sphere: this is a rotation around the equator with Larmor precession frequency ω
Dynamics of a Quantum System: QM postulate: The time evolution of a state ψ> of a closed quantum system is described by the Schrödinger equation where H is the hermitian operator known as the Hamiltonian
More informationOn the Relation between Quantum Discord and Purified Entanglement
On the Relation between Quantum Discord and Purified Entanglement by Eric Webster A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics
More informationQuantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2
Quantum Computing 1 Multi-Qubit System Quantum Computing State Space of Bits The state space of a single bit is {0,1}. n-bit state space is {0,1} n. These are the vertices of the n-dimensional hypercube.
More informationSome Introductory Notes on Quantum Computing
Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best
More informationEntanglement Manipulation
Entanglement Manipulation Steven T. Flammia 1 1 Perimeter Institute for Theoretical Physics, Waterloo, Ontario, N2L 2Y5 Canada (Dated: 22 March 2010) These are notes for my RIT tutorial lecture at the
More information. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.
CS 94- Hilbert Spaces, Tensor Products, Quantum Gates, Bell States 1//07 Spring 007 Lecture 01 Hilbert Spaces Consider a discrete quantum system that has k distinguishable states (eg k distinct energy
More informationHidden Variable Theory
Hidden Variable Theory Quantum Mechanics II - 502 February 7th, 2018 Maine Christos Department of Physics and Astronomy 1 In non-deterministic quantum mechanics... Both QM and classical physics seek to
More informationIntroduction to Quantum Computing. Lecture 1
Introduction to Quantum Computing Lecture 1 1 OUTLINE Why Quantum Computing? What is Quantum Computing? History Quantum Weirdness Quantum Properties Quantum Computation 2 Why Quantum Computing? 3 Transistors
More informationLecture 1: Introduction to Quantum Computing
Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These
More informationQuantum Computation: From Quantum Teleportation to the Shor s Algorithm
Quantum Computation: From Quantum Teleportation to the Shor s Algorithm J. J. Ruiz-Lorenzo Dep. Física, Universidad de Extremadura Instituto de Computación Científica Avanzada de Extremadura (ICCAEx) http://www.eweb.unex.es/eweb/fisteor/juan
More informationCS/Ph120 Homework 1 Solutions
CS/Ph0 Homework Solutions October, 06 Problem : State discrimination Suppose you are given two distinct states of a single qubit, ψ and ψ. a) Argue that if there is a ϕ such that ψ = e iϕ ψ then no measurement
More informationQuantum Computing Lecture 6. Quantum Search
Quantum Computing Lecture 6 Quantum Search Maris Ozols Grover s search problem One of the two most important algorithms in quantum computing is Grover s search algorithm (invented by Lov Grover in 1996)
More informationIs Entanglement Sufficient to Enable Quantum Speedup?
arxiv:107.536v3 [quant-ph] 14 Sep 01 Is Entanglement Sufficient to Enable Quantum Speedup? 1 Introduction The mere fact that a quantum computer realises an entangled state is ususally concluded to be insufficient
More informationThe relation between Hardy s non-locality and violation of Bell inequality
The relation between Hardy s non-locality and violation of Bell inequality Xiang Yang( ) School of Physics and Electronics, Henan University, Kaifeng 475001, China (Received 20 September 2010; revised
More informationCLASSIFICATION OF MAXIMALLY ENTANGLED STATES OF SPIN 1/2 PARTICLES
CLASSIFICATION OF MAXIMALLY ENTANGLED STATES OF SPIN 1/ PARTICLES S. Ghosh, G. Kar, and A. Roy Physics and Applied Mathematics Unit Indian Statistical Institute 03, B. T. Road Calcutta 700 035 India. E
More informationNonlocal Quantum XOR Games for Large Number of Players
onlocal Quantum XOR Games for Large umber of Players Andris Ambainis, Dmitry Kravchenko, ikolajs ahimovs, Alexander Rivosh Faculty of Computing, University of Latvia Abstract onlocal games are used to
More informationBell s Theorem. Ben Dribus. June 8, Louisiana State University
Bell s Theorem Ben Dribus Louisiana State University June 8, 2012 Introduction. Quantum Theory makes predictions that challenge intuitive notions of physical reality. Einstein and others were sufficiently
More informationCS/Ph120 Homework 8 Solutions
CS/Ph0 Homework 8 Solutions December, 06 Problem : Thinking adversarially. Solution: (Due to De Huang) Attack to portocol : Assume that Eve has a quantum machine that can store arbitrary amount of quantum
More informationQuantum Teleportation Pt. 3
Quantum Teleportation Pt. 3 PHYS 500 - Southern Illinois University March 7, 2017 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 3 March 7, 2017 1 / 9 A Bit of History on Teleportation
More informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationQuantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
More informationDECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS
DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS SCOTT HOTTOVY Abstract. Quantum networks are used to transmit and process information by using the phenomena of quantum mechanics.
More informationLecture 21: Quantum communication complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 21: Quantum communication complexity April 6, 2006 In this lecture we will discuss how quantum information can allow for a
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More informationQuantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií
České vysoké učení technické v Praze Fakulta informačních technologií Katedra teoretické informatiky Evropský sociální fond Praha & EU: Investujeme do vaší budoucnosti MI-MVI Methods of Computational Intelligence(2010/2011)
More information6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1
6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable
More informationQUANTUM COMPUTATION. Exercise sheet 1. Ashley Montanaro, University of Bristol H Z U = 1 2
School of Mathematics Spring 017 QUANTUM COMPUTATION Exercise sheet 1 Ashley Montanaro, University of Bristol ashley.montanaro@bristol.ac.uk 1. The quantum circuit model. (a) Consider the following quantum
More informationPh 219b/CS 219b. Exercises Due: Wednesday 11 February 2009
1 Ph 219b/CS 219b Exercises Due: Wednesday 11 February 2009 5.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationQuantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.
Quantum Algorithms Andreas Klappenecker Texas A&M University Lecture notes of a course given in Spring 003. Preliminary draft. c 003 by Andreas Klappenecker. All rights reserved. Preface Quantum computing
More information