Barreiro, JT, Langford, NK, Peters, NA & Kwiat, PG 2005, 'Generation of Hyperentangled Photon Pairs', Physical Review Letters, vol. 95, no. 26.
View/Download from: Publisher's site
Bremner, MJ, Bacon, D & Nielsen, MA 2005, 'Simulating Hamiltonian dynamics using many-qudit Hamiltonians and local unitary control', PHYSICAL REVIEW A, vol. 71, no. 5.
View/Download from: Publisher's site
Devitt, SJ, Cole, JH & Hollenberg, LCL 2005, 'Scheme for direct measurement of a general two-qubit Hamiltonian', Phys. Rev. A., vol. 73, no. 5, p. 052317.
View/Download from: Publisher's site
View description>>
The construction of two-qubit gates appropriate for universal quantumcomputation is of enormous importance to quantum information processing.Building such gates is dependent on accurate knowledge of the interactiondynamics between two qubit systems. This letter will present a systematicmethod for reconstructing the full two-qubit interaction Hamiltonian throughexperimental measures of concurrence. This not only gives a convenient methodfor constructing two qubit quantum gates, but can also be used toexperimentally determine various Hamiltonian parameters in physical systems. Weshow explicitly how this method can be employed to determine the first andsecond order spin-orbit corrections to the exchange coupling in quantum dots.
Devitt, SJ, Greentree, AD & Hollenberg, LCL 2005, 'Information free quantum bus for generating stabiliser states', Quant. Inf. Proc. 6(4):229 (2007), vol. 6, no. 4, pp. 229-242.
View/Download from: Publisher's site
View description>>
Efficient generation of spatially delocalised entangled states is at theheart of quantum information science. Generally flying qubits are proposed forlong range entangling interactions, however here we introduce a bus-mediatedalternative for this task. Our scheme permits efficient and flexible generationof deterministic two-qubit operator measurements and has links to the importantconcepts of mode-entanglement and repeat-until-success protocols. Importantly,unlike flying qubit protocols, our bus particle never contains informationabout the individual quantum states of the particles, hence isinformation-free.
Duan, RY, Feng, Y, Ji, ZF & Ying, MS 2005, 'Efficiency of deterministic entanglement transformation', PHYSICAL REVIEW A, vol. 71, no. 2, pp. 1-7.
View/Download from: Publisher's site
View description>>
We prove that sufficiently many copies of a bipartite entangled pure state can always be transformed into some copies of another one with certainty by local quantum operations and classical communication. The efficiency of such a transformation is charac
Duan, RY, Feng, Y, Li, X & Ying, MS 2005, 'Multiple-copy entanglement transformation and entanglement catalysis', PHYSICAL REVIEW A, vol. 71, no. 4, pp. 1-11.
View/Download from: Publisher's site
View description>>
We prove that any multiple-copy entanglement transformation [S. Bandyopadhyay, V. Roychowdhury, and U. Sen, Phys. Rev. A 65, 052315 (2002)] can be implemented by a suitable entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. R
Duan, RY, Feng, Y, Li, X & Ying, MS 2005, 'Trade-off between multiple-copy transformation and entanglement catalysis', PHYSICAL REVIEW A, vol. 71, no. 6, pp. 1-7.
View/Download from: Publisher's site
View description>>
We demonstrate that multiple copies of a bipartite entangled pure state may serve as a catalyst for certain entanglement transformations while a single copy cannot. Such a state is termed a
Duan, RY, Feng, YA & Ying, MS 2005, 'Entanglement-assisted transformation is asymptotically equivalent to multiple-copy transformation', PHYSICAL REVIEW A, vol. 72, no. 2, pp. 1-5.
View/Download from: Publisher's site
View description>>
We show that two ways of manipulating quantum entanglement-namely, entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)] and multiple-copy transformation [S. Bandyopadhyay, V. Roychowdhury, and U. Sen
Feng, Y, Duan, R & Ji, Z 2005, 'Condition and capability of quantum state separation', Phys. Rev. A, vol. 72, no. 1, p. 012313.
View/Download from: Publisher's site
View description>>
The linearity of quantum operations puts many fundamental constraints on theinformation processing tasks we can achieve on a quantum system whose state isnot exactly known, just as we observe in quantum cloning and quantumdiscrimination. In this paper we show that in probabilistic manner, linearityis in fact the only one that restricts the physically realizable tasks. To bespecific, if a system is prepared in a state secretly chosen from a linearlyindependent pure state set, then any quantum state separation can be physicallyrealized with a positive probability. Furthermore, we derive a lower bound onthe average failure probability of any quantum state separation.
Feng, Y, Duan, R & Ji, Z 2005, 'Condition and capability of quantum state separation', Physical Review A - Atomic, Molecular, and Optical Physics, vol. 72, no. 1, pp. 1-6.
View/Download from: Publisher's site
View description>>
The linearity of quantum operations puts many fundamental constraints on the information processing tasks we can achieve on a quantum system whose state is not exactly known, just as we observe in quantum cloning and quantum discrimination. In this paper we show that in a probabilistic manner, linearity is in fact the only one that restricts the physically realizable tasks. To be specific, if a system is prepared in a state secretly chosen from a linearly independent pure state set, then any quantum state separation can be physically realized with a positive probability. Furthermore, we derive a lower bound on the average failure probability of any quantum state separation. © 2005 The American Physical Society.
Feng, Y, Duan, R, Ji, Z & Ying, M 2005, 'Proof rules for purely quantum programs', CoRR, vol. abs/cs/0507043.
View description>>
We apply the notion of quantum predicate proposed by D'Hondt and Panangadento analyze a purely quantum language fragment which describes the quantum partof a future quantum computer in Knill's architecture. The denotationalsemantics, weakest precondition semantics, and weakest liberal preconditionsemantics of this language fragment are introduced. To help reasoning aboutquantum programs involving quantum loops, we extend proof rules for classicalprobabilistic programs to our purely quantum programs.
Feng, Y, Duan, RY & Ying, MS 2005, 'Catalyst-assisted probabilistic entanglement transformation', IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 51, no. 3, pp. 1090-1101.
View/Download from: Publisher's site
View description>>
We are concerned with catalyst-assisted probabilistic entanglement transformations. A necessary and sufficient condition is presented under which there exist partial catalysts that can increase the maximal transforming probability of a given entanglement
Gilchrist, A, Langford, NK & Nielsen, MA 2005, 'Distance measures to compare real and ideal quantum processes', Physical Review A, vol. 71, no. 6.
View/Download from: Publisher's site
Hsieh, M-H, Devetak, I & Winter, A 2005, 'Entanglement-Assisted Capacity of Quantum Multiple-Access Channels', IEEE Transaction on Information Theory, vol. 54, Issue 7, pp. 3078-3090, Jul. 2008, vol. 54, no. 7, pp. 3078-3090.
View/Download from: Publisher's site
View description>>
We find a regularized formula for the entanglement-assisted (EA) capacityregion for quantum multiple access channels (QMAC). We illustrate the capacityregion calculation with the example of the collective phase-flip channel whichadmits a single-letter characterization. On the way, we provide afirst-principles proof of the EA coding theorem based on a packing argument. Weobserve that the Holevo-Schumacher-Westmoreland theorem may be obtained from amodification of our EA protocol. We remark on the existence of a familyhierarchy of protocols for multiparty scenarios with a single receiver, inanalogy to the two-party case. In this way, we relate several previous resultsregarding QMACs.
Ji, ZF, Cao, HG & Ying, MS 2005, 'Optimal conclusive discrimination of two states can be achieved locally', PHYSICAL REVIEW A, vol. 71, no. 3, pp. 1-5.
View/Download from: Publisher's site
View description>>
This paper constructs a local operation and classical communication protocol that achieves the global optimality of conclusive discrimination of any two pure states with arbitrary a priori probability. This can be interpreted that there is no
Ji, ZF, Feng, YA & Ying, MS 2005, 'Local cloning of two product states', PHYSICAL REVIEW A, vol. 72, no. 3, pp. 1-5.
View/Download from: Publisher's site
View description>>
Local quantum operations and classical communication (LOCC) put considerable constraints on many quantum information processing tasks such as cloning and discrimination. Surprisingly, however, discrimination of any two pure states survives such constrain
Langford, NK, Weinhold, TJ, Prevedel, R, Resch, KJ, Gilchrist, A, O’Brien, JL, Pryde, GJ & White, AG 2005, 'Demonstration of a Simple Entangling Optical Gate and Its Use in Bell-State Analysis', Physical Review Letters, vol. 95, no. 21.
View/Download from: Publisher's site
Li, SJ, Ying, MS & Li, YM 2005, 'On countable RCC models', FUNDAMENTA INFORMATICAE, vol. 65, no. 4, pp. 329-351.
View description>>
Region Connection Calculus (RCC) is the most widely studied formalism of Qualitative Spatial Reasoning. It has been known for some time that each connected regular topological space provides an RCC model. These 'standard' models are inevitable uncountabl
Pope, DT, Berry, DW & Langford, NK 2005, 'The practicality of adaptive phase estimation', Optics and Spectroscopy, vol. 99, no. 3, pp. 397-403.
View/Download from: Publisher's site
Sun, XM, Duan, RY & Ying, MS 2005, 'The existence of quantum entanglement catalysts', IEEE TRANSACTIONS ON INFORMATION THEORY, vol. 51, no. 1, pp. 75-80.
View/Download from: Publisher's site
View description>>
Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and Plenio (Phys. Rev. Lett., vol. 83, p. 3566, 1999) presented an interesting
Ying, MS 2005, 'A theory of computation based on quantum logic (I)', THEORETICAL COMPUTER SCIENCE, vol. 344, no. 2-3, pp. 134-207.
View/Download from: Publisher's site
View description>>
The (meta)logic underlying classical theory of computation is Boolean (two-valued) logic. Quantum logic was proposed by Birkhoff and von Neumann as a logic of quantum mechanics more than 60 years ago. It is currently understood as a logic whose truth values are taken from an orthomodular lattice. The major difference between Boolean logic and quantum logic is that the latter does not enjoy distributivity in general. The rapid development of quantum computation in recent years stimulates us to establish a theory of computation based on quantum logic. The present paper is the first step toward such a new theory and it focuses on the simplest models of computation, namely finite automata. We introduce the notion of orthomodular lattice-valued (quantum) automaton. Various properties of automata are carefully reexamined in the framework of quantum logic by employing an approach of semantic analysis. We define the class of regular languages accepted by orthomodular lattice-valued automata. The acceptance abilities of orthomodular lattice-valued nondeterministic automata and their various modifications (such as deterministic automata and automata with ε-moves) are compared. The closure properties of orthomodular lattice-valued regular languages are derived. The Kleene theorem about equivalence of regular expressions and finite automata is generalized into quantum logic. We also present a pumping lemma for orthomodular lattice-valued regular languages. It is found that the universal validity of many properties (for example, the Kleene theorem, the equivalence of deterministic and nondeterministic automata) of automata depend heavily upon the distributivity of the underlying logic. This indicates that these properties does not universally hold in the realm of quantum logic. On the other hand, we show that a local validity of them can be recovered by imposing a certain commutativity to the (atomic) statements about the automata under consideration. This reveals a...
Buhrman, H, Lee, T & Melkebeek, DV 1970, 'Language compression and pseudorandom generators', computational complexity, Springer Science and Business Media LLC, pp. 228-255.
View/Download from: Publisher's site
Chun Ki Cheng & Blumenstein, M 1970, 'The neural-based segmentation of cursive words using enhanced heuristics', Eighth International Conference on Document Analysis and Recognition (ICDAR'05), Eighth International Conference on Document Analysis and Recognition (ICDAR'05), IEEE, pp. 650-654.
View/Download from: Publisher's site
View description>>
This paper presents an Enhanced Heuristic Segmenter (EHS) and an improved neural-based segmentation technique for segmenting cursive words and validating prospective segmentation points respectively. The EHS employs two new features, ligature detection and a neural assistant, to locate prospective segmentation points. The improved neural-based segmentation technique can then be used to examine the prospective segmentation points by fusion of confidence values obtained from left and centre character recognition outputs in addition to the segmentation point validation (SPY) output. The improved neural-based segmentation technique uses a recently proposed feature extraction technique (Modified Direction Feature) for representing the segmentation points and characters to enhance the overall segmentation process. The EHS and the neural-based segmentation technique have been implemented and tested on a benchmark database providing encouraging results. © 2005 IEEE.
Devitt, SJ, Fowler, AG & Hollenberg, LCL 1970, 'Investigating the practical implementation of Shor's algorithm', SPIE Proceedings, Smart Materials, Nano-, and Micro-Smart Systems, SPIE, Sydney, AUSTRALIA, pp. 483-494.
View/Download from: Publisher's site
Fowler, AG, Devitt, SJ & Hollenberg, LCL 1970, 'Constructing Steane code fault-tolerant gates', SPIE Proceedings, Smart Materials, Nano-, and Micro-Smart Systems, SPIE, Sydney, AUSTRALIA, pp. 557-568.
View/Download from: Publisher's site
Green, S, Blumenstein, M, Browne, M & Tomlinson, R 1970, 'The Detection and Quantification of Persons in Cluttered Beach Scenes Using Neural Network-Based Classification', Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05), Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05), IEEE, pp. 303-308.
View/Download from: Publisher's site
View description>>
This paper presents an initial investigation into the detection and quantification of persons in real-world beach scenes for the automated monitoring of tourist sites. Aside from the obvious use of video and digital imagery for surveillance applications, this research focuses on the analysis of images for the purpose of predicting trends of tourist activities at beach sites in Australia. The proposed system uses image enhancement and segmentation techniques to detect objects in cluttered scenes. Following these steps, a newly proposed feature extraction technique is used to represent important information in the extracted objects for training of a neural network. The neural classifier is used to distinguish the extracted objects between "person" and "non-person" categories to assist in quantification. Encouraging results are presented for person classification on a database of real-word beach scenes. © 2005 IEEE.
Lee, T & Romashchenko, A 1970, 'Resource bounded symmetry of information revisited', Theoretical Computer Science, Elsevier BV, pp. 386-405.
View/Download from: Publisher's site
Martin, P, Blumenstein, M & Deer, P 1970, 'Toward Cooperatively-Built Knowledge Repositories', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Berlin Heidelberg, pp. 411-424.
View/Download from: Publisher's site
View description>>
After noting that informal documents and formal knowledge bases are far from ideal for discussing or retrieving technical knowledge, we propose mechanisms to support the sharing, re-use and cooperative update of semi-formal semantic networks, assign values to contributions and credits to the contributors. We then propose ontological elements to guide and normalize the construction of such knowledge repositories, and an approach to permit the comparison of tools or techniques. © Springer-Verlag Berlin Heidelberg 2005.
Moscato, P, Mathieson, L, Mendes, A & Berretta, R 1970, 'The electronic primaries: Predicting the U.S. Presidency using feature selection with safe data reduction', Conferences in Research and Practice in Information Technology Series, pp. 371-380.
View description>>
The data mining inspired problem of finding the critical, and most useful features to be used to classify a data set, and construct rules to predict the class of future examples is an interesting and important problem. It is also one of the most useful problems with applications in many areas such as microarray analysis, genomics, proteomics, pattern recognition, data compression and knowledge discovery. Expressed as κ-Feature Set it is also a formally hard problem. In this paper we present a method for coping with this hardness using the combinatorial optimisation and parameterized complexity inspired technique of sound reduction rules. We apply our method to an interesting data set which is used to predict the winner of the popular vote in the U.S. presidential elections. We demonstrate the power and exibility of the reductions, especially when used in the context of the (α β)κ-Feature Set variant problem. Copyright © 2005, Australian Computer Society, Inc.
