Algebraic properties of generalized Rijndael-like ciphers

We provide conditions under which the set of Rijndael functions considered as permutations of the state space and based on operations of the finite field \GF (p^k) ($p\geq 2$ a prime number) is not closed under functional composition. These conditions justify using a sequential multiple encryption to strengthen the AES (Rijndael block cipher with specific block sizes) in case AES became practically insecure. In Sparr and Wernsdorf (2008), R. Sparr and R. Wernsdorf provided conditions under which the group generated by the Rijndael-like round functions based on operations of the finite field \GF (2^k) is equal to the alternating group on the state space. In this paper we provide conditions under which the group generated by the Rijndael-like round functions based on operations of the finite field \GF (p^k) ($p\geq 2$) is equal to the symmetric group or the alternating group on the state space.Comment: 22 pages; Prelim0

Selective coherence transfers in homonuclear dipolar coupled spin systems

Mapping the physical dipolar Hamiltonian of a solid-state network of nuclear spins onto a system of nearest-neighbor couplings would be extremely useful for a variety of quantum information processing applications, as well as NMR structural studies. We demonstrate such a mapping for a system consisting of an ensemble of spin pairs, where the coupling between spins in the same pair is significantly stronger than the coupling between spins on different pairs. An amplitude modulated RF field is applied on resonance with the Larmor frequency of the spins, with the frequency of the modulation matched to the frequency of the dipolar coupling of interest. The spin pairs appear isolated from each other in the regime where the RF power (omega_1) is such that omega_weak << omega_1 << omega_strong. Coherence lifetimes within the two-spin system are increased from 19 us to 11.1 ms, a factor of 572.Comment: 4 pages. Paper re-submitted with minor changes to clarify that the scheme demonstrated is not an exact mapping onto a nearest neighbor system. However, this is the first demonstration of a controlled evolution in a subspace of an extended spin system, on a timescale that is much larger than the dipolar dephasing tim

Three-Qubit Gate Realization Using Single Quantum Particle

Using virtual spin formalism it is shown that a quantum particle with eight energy levels can store three qubits. The formalism allows to realize a universal set of quantum gates. Feasible formalism implementation is suggested which uses nuclear spin-7/2 as a storage medium and radio frequency pulses as the gates. One pulse realization of all universal gates has been found, including three-qubit Toffoli gate.Comment: LaTeX, 6 pages, no figures; Submitted to "Pis'ma v Zh. Eksp. Teor. Fiz.

Multiqubit Spin

It is proposed that the state space of a quantum object with a complicated discrete spectrum can be used as a basis for multiqubit recording and processing of information in a quantum computer. As an example, nuclear spin 3/2 is considered. The possibilities of writing and reading two quantum bits of information, preparation of the initial state, implementation of the "rotation" and "controlled negation" operations, which are sufficient for constructing any algorithms, are demonstrated.Comment: 7 pages, PostScript, no figures; translation of Pis'ma Zh. Eksp. Teor. Fiz. 70, No. 1, pp. 59-63, 10 July 1999; (Submitted 29 April 1999; resubmitted 2 June 1999

Sharing Polarization within Quantum Subspaces

Given an ensemble of n spins, at least some of which are partially polarized, we investigate the sharing of this polarization within a subspace of k spins. We assume that the sharing results in a pseudopure state, characterized by a single purity parameter which we call the bias. As a concrete example we consider ensembles of spin-1/2 nuclei in liquid-state nuclear magnetic resonance (NMR) systems. The shared bias levels are compared with some current entanglement bounds to determine whether the reduced subspaces can give rise to entangled states.Comment: 7 pages, 3 figure

Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing

We construct a local realistic hidden-variable model that describes the states and dynamics of bulk-ensemble NMR information processing up to about 12 nuclear spins. The existence of such a model rules out violation of any Bell inequality, temporal or otherwise, in present high-temperature, liquid-state NMR experiments. The model does not provide an efficient description in that the number of hidden variables grows exponentially with the number of nuclear spins.Comment: REVTEX, 7 page

Classical model for bulk-ensemble NMR quantum computation

We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.Comment: 14 pages, no figures, revte

Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm

We describe an implementation of Grover's fixed-point quantum search algorithm on a nuclear magnetic resonance (NMR) quantum computer, searching for either one or two matching items in an unsorted database of four items. In this new algorithm the target state (an equally weighted superposition of the matching states) is a fixed point of the recursive search operator, and so the algorithm always moves towards the desired state. The effects of systematic errors in the implementation are briefly explored.Comment: 5 Pages RevTex4 including three figures. Changes made at request of referees; now in press at Phys Rev

Effective Pure States for Bulk Quantum Computation

In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.Comment: 24 pages in LaTex, 14 figures, the paper is also avalaible at http://qso.lanl.gov/qc

Separability of very noisy mixed states and implications for NMR quantum computing

We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable. The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. We also discuss the implications of the bounds for NMR quantum computing.Comment: 4 pages, extensively revised, references adde