Bremner, MJ, Dawson, CM, Dodd, JL, Gilchrist, A, Harrow, AW, Mortimer, D, Nielsen, MA & Osborne, TJ 2002, 'Practical scheme for quantum computation with any two-qubit entangling gate', PHYSICAL REVIEW LETTERS, vol. 89, no. 24.
View/Download from: Publisher's site
Bremner, MJ, Dawson, CM, Dodd, JL, Gilchrist, A, Harrow, AW, Mortimer, D, Nielsen, MA & Osborne, TJ 2002, 'Practical Scheme for Quantum Computation with Any Two-Qubit Entangling Gate', Physical Review Letters, vol. 89, no. 24.
View/Download from: Publisher's site
View description>>
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. © 2002 The American Physical Society.
Dodd, JL, Nielsen, MA, Bremner, MJ & Thew, RT 2002, 'Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries', Physical Review A. Atomic, Molecular, and Optical Physics, vol. 65, no. 4 A, pp. 403011-403014.
View description>>
Simulations and universal quantum computations using an entangling Hamiltonian and local unitaries were performed. A specific two-qubit example was given to illustrate the techniques and the general algorithm was described for the case of an arbitrary two-qubit systems. The efficiency of the algorithm and the effect of errors were then discussed.
Dodd, JL, Nielsen, MA, Bremner, MJ & Thew, RT 2002, 'Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries', PHYSICAL REVIEW A, vol. 65, no. 4.
View/Download from: Publisher's site
Feng, Y, Zhang, SY & Ying, MS 2002, 'Probabilistic cloning and deleting of quantum states', PHYSICAL REVIEW A, vol. 65, no. 4, pp. 4-4.
View/Download from: Publisher's site
View description>>
We construct a probabilistic cloning and deleting machine which, taking several copies of an input quantum state, can output a linear superposition of multiple cloning and deleting states. Since the machine can perform cloning and deleting in a single unitary evolution, the probabilistic cloning and other cloning machines proposed in the previous literature can be thought of as special cases of our machine. A sufficient and necessary condition for successful cloning and deleting is presented, and it requires that the copies of an arbitrarily presumed number of the input states are linearly independent. This simply generalizes some results for cloning. We also derive an upper bound for the success probability of the cloning and deleting machine. © 2002 The American Physical Society.
Feng, Y, Zhang, SY, Duan, RY & Ying, MS 2002, 'Lower bound on inconclusive probability of unambiguous discrimination', PHYSICAL REVIEW A, vol. 66, no. 6, pp. 1-4.
View/Download from: Publisher's site
View description>>
We derive a lower bound on the inconclusive probability of unambiguous discrimination among n linearly independent quantum states by using the constraint of no signaling. It improves the bound presented in the. paper of Zhang, Feng, Sun, and Ying [Phys.
Nielsen, MA, Bremner, MJ, Dodd, JL, Childs, AM & Dawson, CM 2002, 'Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces', PHYSICAL REVIEW A, vol. 66, no. 2.
View/Download from: Publisher's site
Ralph, TC, Langford, NK, Bell, TB & White, AG 2002, 'Linear optical controlled-NOT gate in the coincidence basis', Physical Review A, vol. 65, no. 6.
View/Download from: Publisher's site
Sun, XM, Zhang, SY, Feng, Y & Ying, MS 2002, 'Mathematical nature of and a family of lower bounds for the success probability of unambiguous discrimination', PHYSICAL REVIEW A, vol. 65, no. 4, pp. 3-3.
View/Download from: Publisher's site
View description>>
Unambiguous discrimination is a strategy to the discrimination problem that identifies the state with certainty, leaving a possibility of undecidability. This paper points out that the optimal success probability of unambiguous discrimination is mathematically the well-known semidefinite programming problem. A family of lower bounds of the optimal success probability is also given. © 2002 The American Physical Society.
Tereshko, V & Lee, T 2002, 'How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony', Open Systems & Information Dynamics, vol. 09, no. 02, pp. 181-193.
View/Download from: Publisher's site
View description>>
We have developed a model of foraging behaviour of a honeybee colony based on reaction-diffusion equations and have studied how mapping the information about the explored environment to the hive determines this behaviour. The model utilizes two dominant components of colony's foraging behaviour — the recruitment to the located nectar sources and the abandonment of them. The recruitment is based upon positive feedback, i.e autocatalytic replication of information about the located source. If every potential forager in the hive, the onlooker, acquires information about all located sources, a common information niche is formed, which leads to the rapid selection of the most profitable nectar source. If the onlookers acquire information about some parts of the environment and slowly learn about the other parts, different information niches where individuals are associated mainly with a particular food source are formed, and the correspondent foraging trails coexist for longer periods. When selected nectar source becomes depleted, the foragers switch over to another, more profitable source. The faster the onlookers learn about the entire environment, the faster that switching occurs.
Blumenstein, M 1970, 'Strategies for improving a Java-based, first year programming course', International Conference on Computers in Education, 2002. Proceedings., International Conference on Computers in Education, IEEE Comput. Soc, pp. 1095-1099.
View/Download from: Publisher's site
View description>>
© 2002 IEEE. This paper describes the evolution of a first year Java course at Griffith University-Gold Coast since Semester 1, 2000 to the December 2002. The course was updated to emphasise program design and to implement and evaluate an "objects-as-needed" approach to first year programming. A number of strategies were tested to increase consistency amongst teaching staff, improve delivery of course resources, successfully cater to a wide variety of students and to enhance the learning experience in general. The success of the revised course has been measured by evaluating student feedback and performance. Currently, a focus group-based strategy of evaluation is being adopted to determine students' attitudes to the most recently implemented changes.
Min-Hsiu Hsieh & Kwang-Cheng Chen 1970, 'A novel channel interference identification', Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002 (Cat. No.02CH37367), Vehicular Technology Conference. IEEE 55th Vehicular Technology Conference. VTC Spring 2002, IEEE, Birmingham, Alabama, pp. 1886-1890.
View/Download from: Publisher's site
View description>>
Both direct sequence and frequency hopping spread spectrum communication systems co-exist in the unlicensed band such as 2.4 GHz ISM band. We propose a novel structure to obtain the channel information so that more robust communication is possible. Both theoretical and numerical results are presented to demonstrate effectiveness.
