arXiv subjects

Isaac L. Chuang

Publications and source records attributed to Isaac L. Chuang.

At least 109 records · Page 6Linked to original sources

arXiv2008

Temperature Dependence of Electric Field Noise Above Gold Surfaces

Electric field noise from fluctuating patch potentials is a significant problem for a broad range of precision experiments, including trapped ion quantum computation and single spin detection. Recent results demonstrated strong suppression of this noise by cryogenic cooling, suggesting an underlying thermal process. We present measurements characterizing the temperature and frequency dependence of the noise from 7 to 100 K, using a single Sr+ ion trapped 75 um above the surface of a gold plated surface electrode ion trap. The noise amplitude is observed to have an approximate 1/f spectrum around 1 MHz, and grows rapidly with temperature as T^beta for beta from 2 to 4. The data are consistent with microfabricated cantilever measurements of non-contact friction but do not extrapolate to the DC measurements with neutral atoms or contact potential probes.

quant-ph↗

arXiv2008

A Two-Dimensional Lattice Ion Trap for Quantum Simulation

Quantum simulations of spin systems could enable the solution of problems which otherwise require infeasible classical resources. Such a simulation may be implemented using a well-controlled system of effective spins, such as a two-dimensional lattice of locally interacting ions. We propose here a layered planar rf trap design that can be used to create arbitrary two-dimensional lattices of ions. The design also leads naturally to ease of microfabrication. As a first experimental demonstration, we confine strontium-88 ions in a mm-scale lattice trap and verify numerical models of the trap by measuring the motional frequencies. We also confine 440 nm diameter charged microspheres and observe ion-ion repulsion between ions in neighboring lattice sites. Our design, when scaled to smaller ion-ion distances, is appropriate for quantum simulation schemes, e.g. that of Porras and Cirac (PRL 92 207901 (2004)). We note, however, that in practical realizations of the trap, an increase in the secular frequency with decreasing ion spacing may make a coupling rate that is large relative to the decoherence rate in such a trap difficult to achieve.

quant-ph↗

arXiv2008

Nonbinary Codeword Stabilized Quantum Codes

The codeword stabilized (CWS) quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021 [quant-ph]), but only for binary states. Here we generalize the CWS framework to the nonbinary case (of both prime and nonprime dimension) and map the search for nonbinary quantum codes to a corresponding search problem for classical nonbinary codes with specific error patterns. We show that while the additivity properties of nonbinary CWS codes are similar to the binary case, the structural properties of the nonbinary codes differ substantially from the binary case, even for prime dimensions. In particular, we identify specific structure patterns of stabilizer groups, based on which efficient constructions might be possible for codes that encode more dimensions than any stabilizer codes of the same length and distance; similar methods cannot be applied in the binary case. Understanding of these structural properties can help prune the search space and facilitate the identification of good nonbinary CWS codes.

quant-ph↗

arXiv2008

Codeword stabilized quantum codes: algorithm and structure

The codeword stabilized ("CWS") quantum codes formalism presents a unifying approach to both additive and nonadditive quantum error-correcting codes (arXiv:0708.1021). This formalism reduces the problem of constructing such quantum codes to finding a binary classical code correcting an error pattern induced by a graph state. Finding such a classical code can be very difficult. Here, we consider an algorithm which maps the search for CWS codes to a problem of identifying maximum cliques in a graph. While solving this problem is in general very hard, we prove three structure theorems which reduce the search space, specifying certain admissible and optimal ((n,K,d)) additive codes. In particular, we find there does not exist any ((7,3,3)) CWS code though the linear programming bound does not rule it out. The complexity of the CWS search algorithm is compared with the contrasting method introduced by Aggarwal and Calderbank (arXiv:cs/0610159).

quant-ph↗

arXiv2008

Semi-Clifford operations, structure of $\mathcal{C}_k$ hierarchy, and gate complexity for fault-tolerant quantum computation

Teleportation is a crucial element in fault-tolerant quantum computation and a complete understanding of its capacity is very important for the practical implementation of optimal fault-tolerant architectures. It is known that stabilizer codes support a natural set of gates that can be more easily implemented by teleportation than any other gates. These gates belong to the so called $\mathcal{C}_k$ hierarchy introduced by Gottesman and Chuang (Nature \textbf{402}, 390). Moreover, a subset of $\mathcal{C}_k$ gates, called semi-Clifford operations, can be implemented by an even simpler architecture than the traditional teleportation setup (Phys. Rev. \textbf{A62}, 052316). However, the precise set of gates in $\mathcal{C}_k$ remains unknown, even for a fixed number of qubits $n$, which prevents us from knowing exactly what teleportation is capable of. In this paper we study the structure of $\mathcal{C}_k$ in terms of semi-Clifford operations, which send by conjugation at least one maximal abelian subgroup of the $n$-qubit Pauli group into another one. We show that for $n=1,2$, all the $\mathcal{C}_k$ gates are semi-Clifford, which is also true for $\{n=3,k=3\}$. However, this is no longer true for $\{n>2,k>3\}$. To measure the capability of this teleportation primitive, we introduce a quantity called `teleportation depth', which characterizes how many teleportation steps are necessary, on average, to implement a given gate. We calculate upper bounds for teleportation depth by decomposing gates into both semi-Clifford $\mathcal{C}_k$ gates and those $\mathcal{C}_k$ gates beyond semi-Clifford operations, and compare their efficiency.

quant-ph↗

arXiv2008

Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit

A long-standing open problem in fault-tolerant quantum computation has been to find a universal set of transversal gates. As three of us proved in arXiv: 0706.1382, such a set does not exist for binary stabilizer codes. Here we generalize our work to show that for subsystem stabilizer codes in $d$ dimensional Hilbert space, such a universal set of transversal gates cannot exist for even one encoded qudit, for any dimension $d$, prime or nonprime. This result strongly supports the idea that other primitives, such as quantum teleportation, are necessary for universal fault-tolerant quantum computation, and may be an important factor for fault tolerance noise thresholds.

quant-ph↗

arXiv2007

Suppression of Heating Rates in Cryogenic Surface-Electrode Ion Traps

Dense arrays of trapped ions provide one way of scaling up ion trap quantum information processing. However, miniaturization of ion traps is currently limited by sharply increasing motional state decoherence at sub-100 um ion-electrode distances. We characterize heating rates in cryogenically cooled surface-electrode traps, with characteristic sizes in 75 um to 150 um range. Upon cooling to 6 K, the measured rates are suppressed by 7 orders of magnitude, two orders of magnitude below previously published data of similarly sized traps operated at room temperature. The observed noise depends strongly on fabrication process, which suggests further improvements are possible.

quant-ph↗

arXiv2007

Transversality versus Universality for Additive Quantum Codes

Certain quantum codes allow logic operations to be performed on the encoded data, such that a multitude of errors introduced by faulty gates can be corrected. An important class of such operations are {\em transversal}, acting bitwise between corresponding qubits in each code block, thus allowing error propagation to be carefully limited. If any quantum operation could be implemented using a set of such gates, the set would be {\em universal}; codes with such a universal, transversal gate set have been widely desired for efficient fault-tolerant quantum computation. We study the structure of GF(4)-additive quantum codes and prove that no universal set of transversal logic operations exists for these codes. This result strongly supports the idea that additional primitive operations, based for example on quantum teleportation, are necessary to achieve universal fault-tolerant computation on additive codes.

quant-ph↗

arXiv2007

Laser ablation loading of a surface-electrode ion trap

We demonstrate loading by laser ablation of $^{88}$Sr$^+$ ions into a mm-scale surface-electrode ion trap. The laser used for ablation is a pulsed, frequency-tripled Nd:YAG with pulse energies of 1-10 mJ and durations of 3-5 ns. An additional laser is not required to photoionize the ablated material. The efficiency and lifetime of several candidate materials for the laser ablation target are characterized by measuring the trapped ion fluorescence signal for a number of consecutive loads. Additionally, laser ablation is used to load traps with a trap depth (40 meV) below where electron impact ionization loading is typically successful ($\gtrsim$ 500 meV).

quant-ph↗

arXiv2007

Local unitary versus local Clifford equivalence of stabilizer and graph states

The equivalence of stabilizer states under local transformations is of fundamental interest in understanding properties and uses of entanglement. Two stabilizer states are equivalent under the usual stochastic local operations and classical communication criterion if and only if they are equivalent under local unitary (LU) operations. More surprisingly, under certain conditions, two LU equivalent stabilizer states are also equivalent under local Clifford (LC) operations, as was shown by Van den Nest et al. [Phys. Rev. \textbf{A71}, 062323]. Here, we broaden the class of stabilizer states for which LU equivalence implies LC equivalence ($LU\Leftrightarrow LC$) to include all stabilizer states represented by graphs with neither cycles of length 3 nor 4. To compare our result with Van den Nest et al.'s, we show that any stabilizer state of distance $δ=2$ is beyond their criterion. We then further prove that $LU\Leftrightarrow LC$ holds for a more general class of stabilizer states of $δ=2$. We also explicitly construct graphs representing $δ>2$ stabilizer states which are beyond their criterion: we identify all 58 graphs with up to 11 vertices and construct graphs with $2^m-1$ ($m\geq 4$) vertices using quantum error correcting codes which have non-Clifford transversal gates.

quant-ph↗

arXiv2006

Electron impact ionization loading of a surface electrode ion trap

We demonstrate a method for loading surface electrode ion traps by electron impact ionization. The method relies on the property of surface electrode geometries that the trap depth can be increased at the cost of more micromotion. By introducing a buffer gas, we can counteract the rf heating assocated with the micromotion and benefit from the larger trap depth. After an initial loading of the trap, standard compensation techniques can be used to cancel the stray fields resulting from charged dielectric and allow for the loading of the trap at ultra-high vacuum.

quant-ph↗

arXiv2006

Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing

The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, ``sea-of-qubits'' architectures. The resulting architectures overcome the primary challenges of reliability and scalability at the cost of physically unacceptable system area. We find that by exploiting the natural serialization at both the application and the physical microarchitecture level of a quantum computer, we can reduce the area requirement while improving performance. In particular we present a scalable quantum architecture design that employs specialization of the system into memory and computational regions, each individually optimized to match hardware support to the available parallelism. Through careful application and system analysis, we find that our new architecture can yield up to a factor of thirteen savings in area due to specialization. In addition, by providing a memory hierarchy design for quantum computers, we can increase time performance by a factor of eight. This result brings us closer to the realization of a quantum processor that can solve meaningful problems.

quant-ph↗

arXiv2006

Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance

Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and experimental study of an algorithm to find the low-lying spectrum of a Hamiltonian. While the number of elementary quantum gates does scale polynomially with the size of the system, it increases inversely to the desired error bound $ε$. Making such simulations robust to decoherence using fault-tolerance constructs requires an additional factor of $1/ ε$ gates. These constraints are illustrated by using a three qubit nuclear magnetic resonance system to simulate a pairing Hamiltonian, following the algorithm proposed by Wu, Byrd, and Lidar.

quant-ph↗

arXiv2005

The Quantum Schur Transform: I. Efficient Qudit Circuits

We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis to a labelling related to the representation theory of the symmetric and unitary groups. If we desire to implement the Schur transform to an accuracy of epsilon, then our circuit construction uses a number of gates which is polynomial in n, d and log(1/epsilon). The important insights we use to perform this construction are the selection of the appropriate subgroup adapted basis and the Wigner-Eckart theorem. Our efficient circuit construction renders numerous protocols in quantum information theory computationally tractable and is an important new efficient quantum circuit family which goes significantly beyond the standard paradigm of the quantum Fourier transform.

quant-ph↗

arXiv2005

A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation

Recent experimental advances have demonstrated technologies capable of supporting scalable quantum computation. A critical next step is how to put those technologies together into a scalable, fault-tolerant system that is also feasible. We propose a Quantum Logic Array (QLA) microarchitecture that forms the foundation of such a system. The QLA focuses on the communication resources necessary to efficiently support fault-tolerant computations. We leverage the extensive groundwork in quantum error correction theory and provide analysis that shows that our system is both asymptotically and empirically fault tolerant. Specifically, we use the QLA to implement a hierarchical, array-based design and a logarithmic expense quantum-teleportation communication protocol. Our goal is to overcome the primary scalability challenges of reliability, communication, and quantum resource distribution that plague current proposals for large-scale quantum computing.

quant-ph↗

arXiv2004

Bounds on the entanglability of thermal states in liquid-state nuclear magnetic resonance

The role of mixed state entanglement in liquid-state nuclear magnetic resonance (NMR) quantum computation is not yet well-understood. In particular, despite the success of quantum information processing with NMR, recent work has shown that quantum states used in most of those experiments were not entangled. This is because these states, derived by unitary transforms from the thermal equilibrium state, were too close to the maximally mixed state. We are thus motivated to determine whether a given NMR state is entanglable - that is, does there exist a unitary transform that entangles the state? The boundary between entanglable and nonentanglable thermal states is a function of the spin system size $N$ and its temperature $T$. We provide new bounds on the location of this boundary using analytical and numerical methods; our tightest bound scales as $N \sim T$, giving a lower bound requiring at least $N \sim 22,000$ proton spins to realize an entanglable thermal state at typical laboratory NMR magnetic fields. These bounds are tighter than known bounds on the entanglability of effective pure states.

quant-ph↗

arXiv2004

Entanglement in the stabilizer formalism

We define a multi-partite entanglement measure for stabilizer states, which can be computed efficiently from a set of generators of the stabilizer group. Our measure applies to qubits, qudits and continuous variables.

quant-ph↗

arXiv2004

NMR Techniques for Quantum Control and Computation

Fifty years of developments in nuclear magnetic resonance (NMR) have resulted in an unrivaled degree of control of the dynamics of coupled two-level quantum systems. This coherent control of nuclear spin dynamics has recently been taken to a new level, motivated by the interest in quantum information processing. NMR has been the workhorse for the experimental implementation of quantum protocols, allowing exquisite control of systems up to seven qubits in size. Here, we survey and summarize a broad variety of pulse control and tomographic techniques which have been developed for and used in NMR quantum computation. Many of these will be useful in other quantum systems now being considered for implementation of quantum information processing tasks.

quant-ph↗