Method for measuring two-qubit entanglement of formation by local operations and classical communication

We present a parametrically efficient method for measuring the entanglement of formation E-f in an arbitrarily given unknown two-qubit state rho(AB) by local operations and classical communication. The two observers, Alice and Bob, first perform some local operations on their composite systems separately, by which the desired global quantum states can be prepared. Then they estimate seven functions via two modified local quantum networks supplemented a classical communication. After obtaining these functions, Alice and Bob can determine the concurrence C and the entanglement of formation E-f.

Detecting a set of entanglement measures in an unknown tripartite quantum state by local operations and classical communication

We propose a more general method for detecting a set of entanglement measures, i.e., negativities, in an arbitrary tripartite quantum state by local operations and classical communication. To accomplish the detection task using this method, three observers do not need to perform partial transposition maps by the structural physical approximation; instead, they only need to collectively measure some functions via three local networks supplemented by a classical communication. With these functions, they are able to determine the set of negativities related to the tripartite quantum state.

Method for detecting concurrence without the structural physical approximation by local operations and classical communication

We present a modified method for detecting the concurrence in an arbitrary two-qubit quantum state rho(AB) with local operations and classical communication. In this method, it is not necessary for the two observers to prepare the quantum state rho(AB) by the structural physical approximation. Their main task is to measure four specific functions via two local quantum networks. With these functions they can determine the concurrence and then the entanglement of formation.

Coherent classical-path description of deep tunneling

A central challenge to the semiclassical description of quantum mechanics is the quantum phenomenon of "deep" tunneling. Here we show that real time classical trajectories suffice to account correctly even for deep quantum tunneling, using a recently formulated semiclassical initial value representation series of the quantum propagator and a prefactor free semiclassical propagator. Deep quantum tunneling is effected through what we term as coherent classical paths which are composed of one or more classical trajectories that lead from reactant to product but are discontinuous along the way. The end and initial phase space points of consecutive classical trajectories contributing to the coherent path are close to each other in the sense that the distance between them is weighted by a coherent state overlap matrix element. Results are presented for thermal and energy dependent tunneling through a symmetric Eckart barrier.

Investigation of "Rearrangement Step" in classical Beckmann rearrangement mechanism over solid acid by means of O-18 isotopic

The reaction mechanism of the Beckmann rearrangement over B2O3/gamma-Al2O3 and TS-1 in the gas phase has been investigated by isotope labeling approach. The isotopic labeled products were measured by mass spectrometry method. By exchanging oxygen with H, 180 in the rearrangement step, it was found that the exchange reaction between cyclohexanone oxime and (H2O)-O-18 over B2O3/-gamma-Al2O3 and TS-1 could only be carried out in some extent. It suggested that the dissociation of nitrilium, over solid acids be not completely free as the classical mechanism. A concept of the dissociation degree (alpha) that is defined as the ratio of the dissociated intermediate nitrilium to the total intermediate nitrilium has been proposed. By fitting the experimental values with the calculation equation of isotopic labeled products, it is obtained that a values for B2O3/-gamma-Al2O3 and TS-1 are 0.199 and 0.806 at the reaction conditions, respectively.

Qualitative and Quantitative Knowledge in Classical Mechanics

This thesis investigates what knowledge is necessary to solve mechanics problems. A program NEWTON is described which understands and solves problems in mechanics mini-world of objects moving on surfaces. Facts and equations such as those given in mechanics text need to be represented. However, this is far from sufficient to solve problems. Human problem solvers rely on "common sense" and "qualitative" knowledge which the physics text tacitly assumes to be present. A mechanics problem solver must embody such knowledge. Quantitative knowledge given by equations and more qualitative common sense knowledge are the major research points exposited in this thesis. The major issue in solving problems is planning. Planning involves tentatively outlining a possible path to the solution without actually solving the problem. Such a plan needs to be constructed and debugged in the process of solving the problem. Envisionment, or qualitative simulation of the event, plays a central role in this planning process.

Why Ideas Matter in International Relations : Hans Morgenthau, Classical Realism, and the Moral Construction of Power Politics

Williams, Mike, 'Why ideas matter in International Relations: Hans Morgenthau, Classical Realism, and the Moral Construction of Power Politics', International Organization (2004) 58(4) pp.633-665 RAE2008

Birkhoff normal forms in semi-classical inverse problems

Iantchenko, A.; Sj?strand, J.; Zworski, M., (2002) 'Birkhoff normal forms in semi-classical inverse problems', Mathematical Research Letters 9(3) pp.337-362 RAE2008

On Finding Sensitivity of Quantum and Classical Gates

We consider a fault model of Boolean gates, both classical and quantum, where some of the inputs may not be connected to the actual gate hardware. This model is somewhat similar to the stuck-at model which is a very popular model in testing Boolean circuits. We consider the problem of detecting such faults; the detection algorithm can query the faulty gate and its complexity is the number of such queries. This problem is related to determining the sensitivity of Boolean functions. We show how quantum parallelism can be used to detect such faults. Specifically, we show that a quantum algorithm can detect such faults more efficiently than a classical algorithm for a Parity gate and an AND gate. We give explicit constructions of quantum detector algorithms and show lower bounds for classical algorithms. We show that the model for detecting such faults is similar to algebraic decision trees and extend some known results from quantum query complexity to prove some of our results.