arXiv subjects

Yaakov S. Weinstein

Publications and source records attributed to Yaakov S. Weinstein.

45 records · Page 3Linked to original sources

arXiv2004

Energetic Suppression of Decoherence in Exchange-Only Quantum Computation

Universal quantum computation requiring only the Heisenberg exchange interaction and suppressing decoherence via an energy gap is presented. The combination of an always-on exchange interaction between the three physical qubits comprising the encoded qubit and a global magnetic field generates an energy gap between the subspace of interest and all other states. This energy gap suppresses decoherence. Always-on exchange couplings greatly simplify hardware specifications and the implementation of inter-logical-qubit gates. A controlled phase gate can be implemented using only three Heisenberg exchange operations all of which can be performed simultaneously.

quant-ph↗

arXiv2004

Quantum Process Tomography of the Quantum Fourier Transform

The results of quantum process tomography on a three-qubit nuclear magnetic resonance quantum information processor are presented, and shown to be consistent with a detailed model of the system-plus-apparatus used for the experiments. The quantum operation studied was the quantum Fourier transform, which is important in several quantum algorithms and poses a rigorous test for the precision of our recently-developed strongly modulating control fields. The results were analyzed in an attempt to decompose the implementation errors into coherent (overall systematic), incoherent (microscopically deterministic), and decoherent (microscopically random) components. This analysis yielded a superoperator consisting of a unitary part that was strongly correlated with the theoretically expected unitary superoperator of the quantum Fourier transform, an overall attenuation consistent with decoherence, and a residual portion that was not completely positive - although complete positivity is required for any quantum operation. By comparison with the results of computer simulations, the lack of complete positivity was shown to be largely a consequence of the incoherent errors during the quantum process tomography procedure. These simulations further showed that coherent, incoherent, and decoherent errors can often be identified by their distinctive effects on the spectrum of the overall superoperator. The gate fidelity of the experimentally determined superoperator was 0.64, while the correlation coefficient between experimentally determined superoperator and the simulated superoperator was 0.79; most of the discrepancies with the simulations could be explained by the cummulative effect of small errors in the single qubit gates.

quant-ph↗

arXiv2004

Matrix Element Randomness, Entanglement, and Quantum Chaos

We demonstrate the connection between an operator's matrix element distribution and entangling power via numerical simulations of random, pseudo-random, and quantum chaotic operators. Creating operators with a random distribution of matrix elements is more difficult than creating operators that reproduce other statistical properties of random matrices. Thus, operators that fulfill many random matrix statistical properties may not generate states of high multi-partite entanglement. To quantify the randomness of various statistical distributions and, by extension, entangling power, we use properties of interpolating ensembles that transition between integrable and random matrix ensembles.

quant-ph↗

arXiv2004

Quantum Cellular Automata Pseudo-Random Maps

Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in which all qubits of a species evolve in parallel. We show that, in spite of its inherent constraints, a QCA system can be used to study complex quantum dynamics. To this aim, we demonstrate scalable operations on a QCA system that fulfill statistical criteria of randomness and explore which criteria of randomness can be fulfilled by operators from various QCA architectures. Other means of realizing random operators with only a few independent operators are also discussed.

quant-ph↗

arXiv2003

On the Emergence of Nonextensivity at the Edge of Quantum Chaos

We explore the border between regular and chaotic quantum dynamics, characterized by a power law decrease in the overlap between a state evolved under chaotic dynamics and the same state evolved under a slightly perturbed dynamics. This region corresponds to the edge of chaos for the classical map from which the quantum chaotic dynamics is derived and can be characterized via nonextensive entropy concepts.

quant-ph↗

arXiv2003

Fidelity Decay as an Efficient Indicator of Quantum Chaos

Recent work has connected the type of fidelity decay in perturbed quantum models to the presence of chaos in the associated classical models. We demonstrate that a system's rate of fidelity decay under repeated perturbations may be measured efficiently on a quantum information processor, and analyze the conditions under which this indicator is a reliable probe of quantum chaos and related statistical properties of the unperturbed system. The type and rate of the decay are not dependent on the eigenvalue statistics of the unperturbed system, but depend on the system's eigenvector statistics in the eigenbasis of the perturbation operator. For random eigenvector statistics the decay is exponential with a rate fixed precisely by the variance of the perturbation's energy spectrum. Hence, even classically regular models can exhibit an exponential fidelity decay under generic quantum perturbations. These results clarify which perturbations can distinguish classically regular and chaotic quantum systems.

quant-ph↗

arXiv2002

Fidelity Decay Saturation Level for Initial Eigenstates

We show that the fidelity decay between an initial eigenstate state evolved under a unitary chaotic operator and the same eigenstate evolved under a perturbed operator saturates well before the 1/N limit, where $N$ is the size of the Hilbert space, expected for a generic initial state. We provide a theoretical argument and numerical evidence that, for intermediate perturbation strengths, the saturation level depends quadratically on the perturbation strength.

quant-ph↗

arXiv2002

Experimental Implementation of the Quantum Baker's Map

This paper reports on the experimental implementation of the quantum baker's map via a three bit nuclear magnetic resonance (NMR) quantum information processor. The experiments tested the sensitivity of the quantum chaotic map to perturbations. In the first experiment, the map was iterated forward and then backwards to provide benchmarks for intrinsic errors and decoherence. In the second set of experiments, the least significant qubit was perturbed in between the iterations to test the sensitivity of the quantum chaotic map to applied perturbations. These experiments are used to investigate previous predicted properties of quantum chaotic dynamics.

quant-ph↗

arXiv1999

Implementation of the Quantum Fourier Transform

The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of the QFT is presented with fidelity measures, and state tomography. Experimentally realizing the QFT is a clear demonstration of NMR's ability to control quantum systems.

quant-ph↗