Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd [Phys. Rev. A 65, 040301(R) (2002)] provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems are qudits, that is, have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.

Overlarge sets of 2-(11, 5, 2) designs and related configurations

We consider the construction of several configurations, including: • overlarge sets of 2-(11,5,2) designs, that is, partitions of the set of all 5-subsets of a 12-set into 72 2-(11,5,2) designs; • an indecomposable doubly overlarge set of 2-(11,5,2) designs, that is, a partition of two copies of the set of all 5-subsets of a 12-set into 144 2-(11,5,2) designs, such that the 144 designs can be arranged into a 12 × 12 square with interesting row and column properties; • a partition of the Steiner system S(5,6,12) into 12 disjoint 2-(11,6,3) designs arising from the diagonal of the square; • bidistant permutation arrays and generalized Room squares arising from the doubly overlarge set, and their relation to some new strongly regular graphs.

Partitioning sets of triples into small planes

We study partitions of the set of all ((v)(3)) triples chosen from a v-set into pairwise disjoint planes with three points per line. Our partitions may contain copies of PG(2, 2) only (Fano partitions) or copies of AG(2, 3) only (affine partitions) or copies of some planes of each type (mixed partitions). We find necessary conditions for Fano or affine partitions to exist. Such partitions are already known in several cases: Fano partitions for v = 8 and affine partitions for v = 9 or 10. We construct such partitions for several sporadic orders, namely, Fano partitions for v = 14, 16, 22, 23, 28, and an affine partition for v = 18. Using these as starter partitions, we prove that Fano partitions exist for v = 7(n) + 1, 13(n) + 1, 27(n) + 1, and affine partitions for v = 8(n) + 1, 9(n) + 1, 17(n) + 1. In particular, both Fano and affine partitions exist for v = 3(6n) + 1. Using properties of 3-wise balanced designs, we extend these results to show that affine partitions also exist for v = 3(2n). Similarly, mixed partitions are shown to exist for v = 8(n), 9(n), 11(n) + 1.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

On the volume of 4-cycle trades

A 4-cycle trade of volume t corresponds to a simple graph G without isolated vertices, where the edge set can be partitioned into t 4-cycles in at least two different ways such that the two collections of 4-cycles have no 4-cycles in common. The foundation of the trade is v = \V(G)\. This paper determines for which values oft and a there exists a 4-cycle trade of volume t and foundation v.

Segmenting the market of West Australian senior tourists using an artificial neural network

Measuring perceptions of customers can be a major problem for marketers of tourism and travel services. Much of the problem is to determine which attributes carry most weight in the purchasing decision. Older travellers weigh many travel features before making their travel decisions. This paper presents a descriptive analysis of neural network methodology and provides a research technique that assesses the weighting of different attributes and uses an unsupervised neural network model to describe a consumer-product relationship. The development of this rich class of models was inspired by the neural architecture of the human brain. These models mathematically emulate the neurophysical structure and decision making of the human brain, and, from a statistical perspective, are closely related to generalised linear models. Artificial neural networks or neural networks are, however, nonlinear and do not require the same restrictive assumptions about the relationship between the independent variables and dependent variables. Using neural networks is one way to determine what trade-offs older travellers make as they decide their travel plans. The sample of this study is from a syndicated data source of 200 valid cases from Western Australia. From senior groups, active learner, relaxed family body, careful participants and elementary vacation were identified and discussed. (C) 2003 Published by Elsevier Science Ltd.

The spectrum of minimal defining sets of some Steiner systems

For a design D, define spec(D) = {\M\ \ M is a minimal defining set of D} to be the spectrum of minimal defining sets of D. In this note we give bounds on the size of an element in spec(D) when D is a Steiner system. We also show that the spectrum of minimal defining sets of the Steiner triple system given by the points and lines of PG(3,2) equals {16,17,18,19,20,21,22}, and point out some open questions concerning the Steiner triple systems associated with PG(n, 2) in general. (C) 2002 Elsevier Science B.V. All rights reserved.

Electron exchange coupling for single-donor solid-state spin qubits

Intervalley interference between degenerate conduction band minima has been shown to lead to oscillations in the exchange energy between neighboring phosphorus donor electron states in silicon [B. Koiller, X. Hu, and S. Das Sarma, Phys. Rev. Lett. 88, 027903 (2002); Phys. Rev. B 66, 115201 (2002)]. These same effects lead to an extreme sensitivity of the exchange energy on the relative orientation of the donor atoms, an issue of crucial importance in the construction of silicon-based spin quantum computers. In this article we calculate the donor electron exchange coupling as a function of donor position incorporating the full Bloch structure of the Kohn-Luttinger electron wave functions. It is found that due to the rapidly oscillating nature of the terms they produce, the periodic part of the Bloch functions can be safely ignored in the Heitler-London integrals as was done by Koiller, Hu, and Das Sarma, significantly reducing the complexity of calculations. We address issues of fabrication and calculate the expected exchange coupling between neighboring donors that have been implanted into the silicon substrate using an 15 keV ion beam in the so-called top down fabrication scheme for a Kane solid-state quantum computer. In addition, we calculate the exchange coupling as a function of the voltage bias on control gates used to manipulate the electron wave functions and implement quantum logic operations in the Kane proposal, and find that these gate biases can be used to both increase and decrease the magnitude of the exchange coupling between neighboring donor electrons. The zero-bias results reconfirm those previously obtained by Koiller, Hu, and Das Sarma.

More on exact bicoverings of 12 points

The minimum number of incomplete blocks required to cover, exactly lambda times, all t-element subsets from a set V of cardinality v (v > t) is denoted by y(lambda, t; v). The value of g(2, 2; v) is known for v = 3, 4,..., 11. It was previously known that 14 less than or equal to g(2, 2; 12) less than or equal to 16. We prove that g(2, 2; 12) greater than or equal to 15.

Factorizations of the complete graph into C-5-factors and 1-factors

In this paper, we show that K-10n can be factored into alpha C-5-factors and beta 1-factors for all non-negative integers alpha and beta satisfying 2alpha + beta = 10(n) - 1.

Skolem-type difference sets for cycle systems

Cyclic m-cycle systems of order v are constructed for all m greater than or equal to 3, and all v = 1(mod 2m). This result has been settled previously by several authors. In this paper, we provide a different solution, as a consequence of a more general result, which handles all cases using similar methods and which also allows us to prove necessary and sufficient conditions for the existence of a cyclic m-cycle system of K-v - F for all m greater than or equal to 3, and all v = 2(mod 2m).

Yablo's paradox and referring to infinite objects

The blame for the semantic and set-theoretic paradoxes is often placed on self-reference and circularity. Some years ago, Yablo [1985; 1993] challenged this diagnosis, by producing a paradox that's liar-like but does not seem to involve circularity. But is Yablo's paradox really non-circular? In a recent paper, Beall [2001] has suggested that there are no means available to refer to Yablo's paradox without invoking descriptions, and since Priest [1997] has shown that any such description is circular, Beall concludes that Yablo's paradox itself is circular. In this paper, we argue that Beall's conclusion is unwarranted, given that (1) descriptions are not the only way to refer to Yablo's paradox, and (ii) we have no reason to believe that because the description involves self-reference, the denotation of the description is also circular. As a result, for all that's been said so far, we have no reason to believe that Yablo's paradox is circular.