arXiv subjects

Bei Zeng

Publications and source records attributed to Bei Zeng.

At least 73 records · Page 4Linked to original sources

arXiv2017

Enhancing quantum control by bootstrapping a quantum processor of 12 qubits

Accurate and efficient control of quantum systems is one of the central challenges for quantum information processing. Current state-of-the-art experiments rarely go beyond 10 qubits and in most cases demonstrate only limited control. Here we demonstrate control of a 12-qubit system, and show that the system can be employed as a quantum processor to optimize its own control sequence by using measurement-based feedback control (MQFC). The final product is a control sequence for a complex 12-qubit task: preparation of a 12-coherent state. The control sequence is about 10% more accurate than the one generated by the standard (classical) technique, showing that MQFC can correct for unknown imperfections. Apart from demonstrating a high level of control over a relatively large system, our results show that even at the 12-qubit level, a quantum processor can be a useful lab instrument. As an extension of our work, we propose a method for combining the MQFC technique with a twirling protocol, to optimize the control sequence that produces a desired Clifford gate.

quant-ph↗

arXiv2017

NMRCloudQ: A Quantum Cloud Experience on a Nuclear Magnetic Resonance Quantum Computer

As of today, no one can tell when a universal quantum computer with thousands of logical quantum bits (qubits) will be built. At present, most quantum computer prototypes involve less than ten individually controllable qubits, and only exist in laboratories for the sake of either the great costs of devices or professional maintenance requirements. Moreover, scientists believe that quantum computers will never replace our daily, every-minute use of classical computers, but would rather serve as a substantial addition to the classical ones when tackling some particular problems. Due to the above two reasons, cloud-based quantum computing is anticipated to be the most useful and reachable form for public users to experience with the power of quantum. As initial attempts, IBM Q has launched influential cloud services on a superconducting quantum processor in 2016, but no other platforms has followed up yet. Here, we report our new cloud quantum computing service -- NMRCloudQ (http://nmrcloudq.com/zh-hans/), where nuclear magnetic resonance, one of the pioneer platforms with mature techniques in experimental quantum computing, plays as the role of implementing computing tasks. Our service provides a comprehensive software environment preconfigured with a list of quantum information processing packages, and aims to be freely accessible to either amateurs that look forward to keeping pace with this quantum era or professionals that are interested in carrying out real quantum computing experiments in person. In our current version, four qubits are already usable with in average 1.26% single-qubit gate error rate and 1.77% two-qubit controlled-NOT gate error rate via randomized benchmaking tests. Improved control precisions as well as a new seven-qubit processor are also in preparation and will be available later.

quant-ph↗

arXiv2017

Random Invariant Tensors

Invariant tensors are states in the (local) SU(2) tensor product representation but invariant under global SU(2) action. They are of importance in the study of loop quantum gravity. A random tensor is an ensemble of tensor states. An average over the ensemble is carried out when computing any physical quantities. The random tensor exhibits a phenomenon of `concentration of measure', saying that for any bipartition, the expected value of entanglement entropy of its reduced density matrix is asymptotically the maximal possible as the local dimension goes to infinity. This is also true even when the average is over the invariant subspace instead of the whole space for $4-$valent tensors, although its entropy deficit is divergent. One might expect that for $n\geq 5$, $n-$valent random invariant tensor would behavior similarly. However, we show that, the expected entropy deficit of reduced density matrix of such $n-$valent random invariant tensor from maximum, is not divergent but a finite number. Under some special situation, the number could be even smaller than half a bit, which is the deficit of random pure state over the whole Hilbert space from maximum.

quant-ph↗

arXiv2017

Measuring out-of-time-order correlators on a nuclear magnetic resonance quantum simulator

The idea of the out-of-time-order correlator (OTOC) has recently emerged in the study of both condensed matter systems and gravitational systems. It not only plays a key role in investigating the holographic duality between a strongly interacting quantum system and a gravitational system, but also diagnoses the chaotic behavior of many-body quantum systems and characterizes the information scrambling. Based on the OTOCs, three different concepts -- quantum chaos, holographic duality, and information scrambling -- are found to be intimately related to each other. Despite of its theoretical importance, the experimental measurement of the OTOC is quite challenging and so far there is no experimental measurement of the OTOC for local operators. Here we report the measurement of OTOCs of local operators for an Ising spin chain on a nuclear magnetic resonance quantum simulator. We observe that the OTOC behaves differently in the integrable and non-integrable cases. Based on the recent discovered relationship between OTOCs and the growth of entanglement entropy in the many-body system, we extract the entanglement entropy from the measured OTOCs, which clearly shows that the information entropy oscillates in time for integrable models and scrambles for non-intgrable models. With the measured OTOCs, we also obtain the experimental result of the butterfly velocity, which measures the speed of correlation propagation. Our experiment paves a way for experimentally studying quantum chaos, holographic duality, and information scrambling in many-body quantum systems with quantum simulators.

cond-mat.str-el↗

arXiv2017

A Separability-Entanglement Classifier via Machine Learning

The problem of determining whether a given quantum state is entangled lies at the heart of quantum information processing, which is known to be an NP-hard problem in general. Despite the proposed many methods such as the positive partial transpose (PPT) criterion and the k-symmetric extendibility criterion to tackle this problem in practice, none of them enables a general, effective solution to the problem even for small dimensions. Explicitly, separable states form a high-dimensional convex set, which exhibits a vastly complicated structure. In this work, we build a new separability-entanglement classifier underpinned by machine learning techniques. Our method outperforms the existing methods in generic cases in terms of both speed and accuracy, opening up the avenues to explore quantum entanglement via the machine learning approach.

quant-ph↗

arXiv2017

Codes for Simultaneous Transmission of Quantum and Classical Information

We consider the characterization as well as the construction of quantum codes that allow to transmit both quantum and classical information, which we refer to as `hybrid codes'. We construct hybrid codes $[\![n,k{: }m,d]\!]_q$ with length $n$ and distance $d$, that simultaneously transmit $k$ qudits and $m$ symbols from a classical alphabet of size $q$. Many good codes such as $[\![7,1{: }1,3]\!]_2$, $[\![9,2{: }2,3]\!]_2$, $[\![10,3{: }2,3]\!]_2$, $[\![11,4{: }2,3]\!]_2$, $[\![11,1{: }2,4]\!]_2$, $[\![13,1{: }4,4]\!]_2$, $[\![13,1{: }1,5]\!]_2$, $[\![14,1{: }2,5]\!]_2$, $[\![15,1{: }3,5]\!]_2$, $[\![19,9{: }1,4]\!]_2$, $[\![20,9{: }2,4]\!]_2$, $[\![21,9{: }3,4]\!]_2$, $[\![22,9{: }4,4]\!]_2$ have been found. All these codes have better parameters than hybrid codes obtained from the best known stabilizer quantum codes.

quant-ph↗

arXiv2017

Optimal experiment design for quantum state tomography

Quantum state tomography is an indispensable but costly part of many quantum experiments. Typically, it requires measurements to be carried in a number of different settings on a fixed experimental setup. The collected data is often informationally overcomplete, with the amount of information redundancy depending on the particular set of measurement settings chosen. This raises a question about how should one optimally take data so that the number of measurement settings necessary can be reduced. Here, we cast this problem in terms of integer programming. For a given experimental setup, standard integer programming algorithms allow us to find the minimum set of readout operations that can realize a target tomographic task. We apply the method to certain basic and practical state tomographic problems in nuclear magnetic resonance experimental systems. The results show that, considerably less readout operations can be found using our technique than it was by using the previous greedy search strategy. Therefore, our method could be helpful for simplifying measurement schemes so as to minimize the experimental effort.

quant-ph↗

arXiv2017

Experimental Identification of Non-Abelian Topological Orders on a Quantum Simulator

Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular $S$ and $T$ matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net model with two string types, including the $\Z_2$ toric code, doubled semion, and doubled Fibonacci. The third one, non-Abelian Fibonacci order is notably expected to be the simplest candidate for universal topological quantum computing. Our experiment serves as the basic module, built on which one can simulate braiding of non-Abelian anyons and ultimately topological quantum computation via the braiding, and thus provides a new approach of investigating topological orders using quantum computers.

cond-mat.str-el↗

arXiv2016

Invariant Perfect Tensors

Invariant tensors are states in the SU(2) tensor product representation that are invariant under the SU(2) action. They play an important role in the study of loop quantum gravity. On the other hand, perfect tensors are highly entangled many-body quantum states with local density matrices maximally mixed. Recently, the notion of perfect tensors recently has attracted a lot of attention in the fields of quantum information theory, condensed matter theory, and quantum gravity. In this work, we introduce the concept of an invariant perfect tensor (IPT), which is a $n$-valent tensor that is both invariant and perfect. We discuss the existence and construction of IPT. For bivalent tensors, the invariant perfect tensor is the unique singlet state for each local dimension. The trivalent invariant perfect tensor also exists and is uniquely given by Wigner's $3j$ symbol. However, we show that, surprisingly, there does not exist four-valent invariant perfect tensors for any dimension. On the contrary, when the dimension is large, almost all invariant tensors are perfect asymptotically, which is a consequence of the phenomenon of concentration of measure for multipartite quantum states.

quant-ph↗

arXiv2016

Experimental Detection of Entanglement Polytopes via Local Filters

Entanglement polytopes result in finitely many types of entanglement that can be detected by only measuring single-particle spectra. With high probability, however, the local spectra lie in more than one polytope, hence providing no information about the entanglement type. To overcome this problem, we propose to additionally use local filters. We experimentally demonstrate the detection of entanglement polytopes in a four-qubit system. Using local filters we can distinguish the entanglement type of states with the same single particle spectra, but which belong to different polytopes.

quant-ph↗

arXiv2016

Joint product numerical range and geometry of reduced density matrices

The reduced density matrices of a many-body quantum system form a convex set, whose three-dimensional projection $Θ$ is convex in $\mathbb{R}^3$. The boundary $\partialΘ$ of $Θ$ may exhibit nontrivial geometry, in particular ruled surfaces. Two physical mechanisms are known for the origins of ruled surfaces: symmetry breaking and gapless. In this work, we study the emergence of ruled surfaces for systems with local Hamiltonians in infinite spatial dimension, where the reduced density matrices are known to be separable as a consequence of the quantum de Finetti's theorem. This allows us to identify the reduced density matrix geometry with joint product numerical range $Π$ of the Hamiltonian interaction terms. We focus on the case where the interaction terms have certain structures, such that ruled surface emerge naturally when taking a convex hull of $Π$. We show that, a ruled surface on $\partialΘ$ sitting in $Π$ has a gapless origin, otherwise it has a symmetry breaking origin. As an example, we demonstrate that a famous ruled surface, known as the oloid, is a possible shape of $Θ$, with two boundary pieces of symmetry breaking origin separated by two gapless lines.

quant-ph↗

arXiv2016

Physical origins of ruled surfaces on the reduced density matrices geometry

The reduced density matrices (RDMs) of many-body quantum states form a convex set. The boundary of low dimensional projections of this convex set may exhibit nontrivial geometry such as ruled surfaces. In this paper, we study the physical origins of these ruled surfaces for bosonic systems. The emergence of ruled surfaces was recently proposed as signatures of symmetry-breaking phase. We show that, apart from being signatures of symmetry-breaking, ruled surfaces can also be the consequence of gapless quantum systems by demonstrating an explicit example in terms of a two-mode Ising model. Our analysis was largely simplified by the quantum de Finetti's theorem---in the limit of large system size, these RDMs are the convex set of all the symmetric separable states. To distinguish ruled surfaces originated from gapless systems from those caused by symmetry-breaking, we propose to use the finite size scaling method for the corresponding geometry. This method is then applied to the two-mode XY model, successfully identifying a ruled surface as the consequence of gapless systems.

quant-ph↗

arXiv2016

Quantum State and Process Tomography via Adaptive Measurements

We investigate quantum state tomography (QST) for pure states and quantum process tomography (QPT) for unitary channels via $adaptive$ measurements. For a quantum system with a $d$-dimensional Hilbert space, we first propose an adaptive protocol where only $2d-1$ measurement outcomes are used to accomplish the QST for $all$ pure states. This idea is then extended to study QPT for unitary channels, where an adaptive unitary process tomography (AUPT) protocol of $d^2+d-1$ measurement outcomes is constructed for any unitary channel. We experimentally implement the AUPT protocol in a 2-qubit nuclear magnetic resonance system. We examine the performance of the AUPT protocol when applied to Hadamard gate, $T$ gate ($π/8$ phase gate), and controlled-NOT gate, respectively, as these gates form the universal gate set for quantum information processing purpose. As a comparison, standard QPT is also implemented for each gate. Our experimental results show that the AUPT protocol that reconstructing unitary channels via adaptive measurements significantly reduce the number of experiments required by standard QPT without considerable loss of fidelity.

quant-ph↗

arXiv2016

Dichotomy of entanglement depth for symmetric states

Entanglement depth characterizes the minimal number of particles in a system that are mutually entangled. For symmetric states, we show that there is a dichotomy for entanglement depth: an $N$-particle symmetric state is either fully separable, or fully entangled---the entanglement depth is either $1$ or $N$. This property is even stable under non-symmetric noise. We propose an experimentally accessible method to detect entanglement depth in atomic ensembles based on a bound on the particle number population of Dicke states, and demonstrate that the entanglement depth of some Dicke states, for example the twin Fock state, is very stable even under a large arbitrary noise. Our observation can be applied to atomic Bose-Einstein condensates to infer that these systems can be highly entangled with the entanglement depth that is of the order of the system size (i.e. several thousands of atoms).

quant-ph↗

arXiv2016

Quantum state tomography via reduced density matrices

Quantum state tomography via local measurements is an efficient tool for characterizing quantum states. However it requires that the original global state be uniquely determined (UD) by its local reduced density matrices (RDMs). In this work we demonstrate for the first time a class of states that are UD by their RDMs under the assumption that the global state is pure, but fail to be UD in the absence of that assumption. This discovery allows us to classify quantum states according to their UD properties, with the requirement that each class be treated distinctly in the practice of simplifying quantum state tomography. Additionally we experimentally test the feasibility and stability of performing quantum state tomography via the measurement of local RDMs for each class. These theoretical and experimental results advance the project of performing efficient and accurate quantum state tomography in practice.

quant-ph↗

arXiv2016

Quantum Capacities for Entanglement Networks

We discuss quantum capacities for two types of entanglement networks: $\mathcal{Q}$ for the quantum repeater network with free classical communication, and $\mathcal{R}$ for the tensor network as the rank of the linear operation represented by the tensor network. We find that $\mathcal{Q}$ always equals $\mathcal{R}$ in the regularized case for the samenetwork graph. However, the relationships between the corresponding one-shot capacities $\mathcal{Q}_1$ and $\mathcal{R}_1$ are more complicated, and the min-cut upper bound is in general not achievable. We show that the tensor network can be viewed as a stochastic protocol with the quantum repeater network, such that $\mathcal{R}_1$ is a natural upper bound of $\mathcal{Q}_1$. We analyze the possible gap between $\mathcal{R}_1$ and $\mathcal{Q}_1$ for certain networks, and compare them with the one-shot classical capacity of the corresponding classical network.

quant-ph↗

arXiv2016

Concatenated Codes for Amplitude Damping

We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric errors, many new codes with good parameters are found, which are better than the amplitude damping codes obtained by any previously known construction.

quant-ph↗

arXiv2016

Codeword Stabilized Quantum Codes for Asymmetric Channels

We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In particular, we look at codes for Pauli error models that correct one or two amplitude damping errors. Applying local Clifford operations on graph states, we are able to exhaustively search for all possible codes up to length $9$. With a similar method, we also look at codes for the Pauli error model that detect a single amplitude error and detect multiple phase damping errors. Many new codes with good parameters are found, including nonadditive codes and degenerate codes.

quant-ph↗