Globalisation and sustainability: environmental Kuznets curve and the WTO

Economic globalisation is seen by many as a driving force for global economic growth. Yet opinion is divided about the benefits of this process, as highlighted by the WTO meeting in Seattle in late 1999. Proponents of economic globalisation view it as a positive force for environmental improvement and as a major factor increasing the likelihood of sustainable development through its likely boost to global investment. These proponents mostly appeal to analysis based on the environmental Kuznets curve (EKC) to support their views about environmental improvement. But EKC-analysis has significant deficiencies. Furthermore, it is impossible to be confident that the process of economic globalisation will result in sustainable development, if 'weak conditions' only are satisfied. 'Strong conditions' probably need to be satisfied to achieve sustainable development, and given current global institutional arrangements, these are likely to be violated by the economic globalisation process. Global political action seems to be needed-to avert a deterioration in the global environment and to prevent unsustainability of development. This exposition demonstrates the limitations of EKC-analysis, identifies positive and negative effects of economic globalisation on pollution levels, and highlights connections between globalisation and the debate about whether strong or weak conditions are required for sustainable development. The article concludes with a short discussion of the position of WTO in relation to trade and the environment and the seemingly de facto endorsement of WTO of weak conditions for sustainable development. It suggests that WTO's relative neglect of environmental concerns is no longer politically tenable and needs to be reassessed in the light of recent developments in economic analysis. The skew of economic growth, e.g. in favour of developing countries, is shown to be extremely important from a global environmental perspective. (C) 2001 Elsevier Science B.V. All rights reserved.

A flexible method for rapid force computation in elliptical magnets

The design of open-access elliptical cross-section magnet systems has recently come under consideration. Obtaining values for the forces generated within these unusual magnets is important to progress the designs towards feasible instruments. This paper presents a novel and flexible method for the rapid computation of forces within elliptical magnets. The method is demonstrated by the analysis of a clinical magnetic resonance imaging magnet of elliptical cross-section and open design. The analysis reveals the non-symmetric nature of the generated Maxwell forces, which are an important consideration, particularly in the design of superconducting systems.

Integrability and exact spectrum of a pairing model for nucleons

A pairing model for nucleons, introduced by Richardson in 1966, which describes proton-neutron pairing as well as proton-proton and neutron-neutron pairing, is re-examined in the context of the quantum inverse scattering method. Specifically, this shows that the model is integrable by enabling the explicit construction of the conserved operators. We determine the eigenvalues of these operators in terms of the Bethe ansatz, which in turn leads to an expression for the energy eigenvalues of the Hamiltonian.

Read-only-memory-based quantum computation: Experimental explorations using nuclear magnetic resonance and future prospects

Read-only-memory-based (ROM-based) quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less magical, and being more suited to implementing space-efficient computation (i.e., computation using the minimum number of writable qubits). Here we consider a number of small (one- and two-qubit) quantum algorithms illustrating different aspects of ROM-based QC. They are: (a) a one-qubit algorithm to solve the Deutsch problem; (b) a one-qubit binary multiplication algorithm; (c) a two-qubit controlled binary multiplication algorithm; and (d) a two-qubit ROM-based version of the Deutsch-Jozsa algorithm. For each algorithm we present experimental verification using nuclear magnetic resonance ensemble QC. The average fidelities for the implementation were in the ranges 0.9-0.97 for the one-qubit algorithms, and 0.84-0.94 for the two-qubit algorithms. We conclude with a discussion of future prospects for ROM-based quantum computation. We propose a four-qubit algorithm, using Grover's iterate, for solving a miniature real-world problem relating to the lengths of paths in a network.

Entanglement creation using quantum interrogation

We present some applications of high-efficiency quantum interrogation (interaction-free measurement) for the creation of entangled states of separate atoms and of separate photons. The quantum interrogation of a quantum object in a superposition of object-in and object-out leaves the object and probe in an entangled state. The probe can then be further entangled with other objects in subsequent quantum interrogations. By then projecting out those cases in which the probe is left in a particular final state, the quantum objects can themselves be left in various entangled states. In this way, we show how to generate two-, three-, and higher-qubit entanglement between atoms and between photons. The effect of finite efficiency for the quantum interrogation is delineated for the various schemes.

On positive solutions of nonlinear elliptic equations involving concave and critical nonlinearities

We study the existence of nonnegative solutions of elliptic equations involving concave and critical Sobolev nonlinearities. Applying various variational principles we obtain the existence of at least two nonnegative solutions.

Computation of the linear elastic properties of random porous materials with a wide variety of microstructure

A finite-element method is used to study the elastic properties of random three-dimensional porous materials with highly interconnected pores. We show that Young's modulus, E, is practically independent of Poisson's ratio of the solid phase, nu(s), over the entire solid fraction range, and Poisson's ratio, nu, becomes independent of nu(s) as the percolation threshold is approached. We represent this behaviour of nu in a flow diagram. This interesting but approximate behaviour is very similar to the exactly known behaviour in two-dimensional porous materials. In addition, the behaviour of nu versus nu(s) appears to imply that information in the dilute porosity limit can affect behaviour in the percolation threshold limit. We summarize the finite-element results in terms of simple structure-property relations, instead of tables of data, to make it easier to apply the computational results. Without using accurate numerical computations, one is limited to various effective medium theories and rigorous approximations like bounds and expansions. The accuracy of these equations is unknown for general porous media. To verify a particular theory it is important to check that it predicts both isotropic elastic moduli, i.e. prediction of Young's modulus alone is necessary but not sufficient. The subtleties of Poisson's ratio behaviour actually provide a very effective method for showing differences between the theories and demonstrating their ranges of validity. We find that for moderate- to high-porosity materials, none of the analytical theories is accurate and, at present, numerical techniques must be relied upon.

Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit Hamiltonian and local unitary operations. It follows that universal quantum computation can be performed using any entangling interaction and local unitary operations.

Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-NOT, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.