arXiv subjects

Dawei Lu

Publications and source records attributed to Dawei Lu.

At least 73 records · Page 4Linked to original sources

arXiv2018

Experimental Implementation of Efficient Quantum Pseudorandomness on a 12-spin System

Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing these objects in realistic physical systems can be a challenging task. In this work, we study quantum pseudorandomness generation on a 12-spin nuclear magnetic resonance system. The experimental process is based on the recently proposed design Hamiltonian approach, which has the merit of being significantly more efficient than previous protocols. By applying random refocusing sequences to the experimental system we create a design Hamiltonian the dynamics of which quickly forms unitary designs. We then use multiple-quantum techniques to measure spreading of quantum coherences over system's degrees of freedom, and so to probe the growth of quantum pseudorandomness. The measured multiple-quantum coherence spectra indicate that substantial quantum pseudorandomness have been achieved.

quant-ph↗

arXiv2018

Gradient-based closed-loop quantum optimal control in a solid-state two-qubit system

Quantum optimal control can play a crucial role to realize a set of universal quantum logic gates with error rates below the threshold required for fault-tolerance. Open-loop quantum optimal control relies on accurate modeling of the quantum system under control, and does not scale efficiently with system size. These problems can be avoided in closed-loop quantum optimal control, which utilizes feedback from the system to improve control fidelity. In this paper, two gradient-based closed-loop quantum optimal control algorithms, the hybrid quantum-classical approach (HQCA) described in [Phys. Rev. Lett. 118, 150503 (2017)] and the finite-difference (FD) method, are experimentally investigated and compared to the open-loop quantum optimal control utilizing the gradient ascent method. We employ a solid-state ensemble of coupled electron-nuclear spins serving as a two-qubit system. Specific single-qubit and two-qubit state preparation gates are optimized using the closed-loop and open-loop methods. The experimental results demonstrate the implemented closed-loop quantum control outperforms the open-loop control in our system. Furthermore, simulations reveal that HQCA is more robust than the FD method to gradient noise which originates from measurement noise in this experimental setting. On the other hand, the FD method is more robust to control field distortions coming from non-ideal hardware

quant-ph↗

arXiv2018

A Quantum Algorithm for Solving Linear Differential Equations: Theory and Experiment

We present and experimentally realize a quantum algorithm for efficiently solving the following problem: given an $N\times N$ matrix $\mathcal{M}$, an $N$-dimensional vector $\textbf{\emph{b}}$, and an initial vector $\textbf{\emph{x}}(0)$, obtain a target vector $\textbf{\emph{x}}(t)$ as a function of time $t$ according to the constraint $d\textbf{\emph{x}}(t)/dt=\mathcal{M}\textbf{\emph{x}}(t)+\textbf{\emph{b}}$. We show that our algorithm exhibits an exponential speedup over its classical counterpart in certain circumstances. In addition, we demonstrate our quantum algorithm for a $4\times4$ linear differential equation using a 4-qubit nuclear magnetic resonance quantum information processor. Our algorithm provides a key technique for solving many important problems which rely on the solutions to linear differential equations.

quant-ph↗

arXiv2018

Frequency of Rational Fractions on [0, 1]

In this paper, the authors design a trial to count rational ratios on the interval [0, 1], and plot a normalized frequency statistical graph. Patterns, symmetry and co-linear properties reflected in the graph are confirmed. The main objective is to present a new view of Farey sequence and to explain the inner principle of its procedure. In addition, we compare Farey sequence and Continued fraction in terms of numerical approximation track and clarify the internal reason why we iteratively choose mediant as the next suitable approximation for the first time. Besides, all sorts of Fibonacci-Lucas sequences emerge from the statistical graph.

math.HO↗

arXiv2017

Quantum Spacetime on a Quantum Simulator

We experimentally simulate the spin networks -- a fundamental description of quantum spacetime at the Planck level. We achieve this by simulating quantum tetrahedra and their interactions. The tensor product of these quantum tetrahedra comprises spin networks. In this initial attempt to study quantum spacetime by quantum information processing, on a four-qubit nuclear magnetic resonance quantum simulator, we simulate the basic module -- comprising five quantum tetrahedra -- of the interactions of quantum spacetime. By measuring the geometric properties on the corresponding quantum tetrahedra and simulate their interactions, our experiment serves as the basic module that represents the Feynman diagram vertex in the spin-network formulation of quantum spacetime.

quant-ph↗

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

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

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

Experimentally superposing two pure states with partial prior knowledge

Superposition, arguably the most fundamental property of quantum mechanics, lies at the heart of quantum information science. However, how to create the superposition of any two unknown pure states remains as a daunting challenge. Recently, it is proved that such a quantum protocol does not exist if the two input states are completely unknown, whereas a probabilistic protocol is still available with some prior knowledge about the input states [M. Oszmaniec \emph{et al.}, Phys. Rev. Lett. 116, 110403 (2016)]. The knowledge is that both of the two input states have nonzero overlaps with some given referential state. In this work, we experimentally realize the probabilistic protocol of superposing two pure states in a three-qubit nuclear magnetic resonance system. We demonstrate the feasibility of the protocol by preparing a families of input states, and the average fidelity between the prepared state and expected superposition state is over 99%. Moreover, we experimentally illustrate the limitation of the protocol that it is likely to fail or yields very low fidelity, if the nonzero overlaps are approaching zero. Our experimental implementation can be extended to more complex situations and other quantum systems.

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

Estimating the coherence of noise in quantum control of a solid-state qubit

To exploit a given physical system for quantum information processing, it is critical to understand the different types of noise affecting quantum control. Distinguishing coherent and incoherent errors is extremely useful as they can be reduced in different ways. Coherent errors are generally easier to reduce at the hardware level, e.g. by improving calibration, whereas some sources of incoherent errors, e.g. T2* processes, can be reduced by engineering robust pulses. In this work, we illustrate how purity benchmarking and randomized benchmarking can be used together to distinguish between coherent and incoherent errors and to quantify the reduction in both of them due to using optimal control pulses and accounting for the transfer function in an electron spin resonance system. We also prove that purity benchmarking provides bounds on the optimal fidelity and diamond norm that can be achieved by correcting the coherent errors through improving calibration.

quant-ph↗

arXiv2016

Experimental violation of the Leggett-Garg inequality in a 3-level system

The Leggett-Garg (LG) test of macroscopic realism involves a series of dichotomic non-invasive measurements that are used to calculate a function which has a fixed upper bound for a macrorealistic system and a larger upper bound for a quantum system. The quantum upper bound depends on both the details of the measurement and the dimension of the system. Here we present an LG experiment on a three-level quantum system, which produces a larger theoretical quantum upper bound than that of a two-level quantum system. The experiment is carried out in nuclear magnetic resonance (NMR) and consists of the LG test as well as a test of the ideal assumptions associated with the experiment, such as measurement non-invasiveness. The non-invasive measurements are performed via the modified ideal negative result measurement scheme on a three-level system. Once these assumptions are tested, the violation becomes small, despite the fact that the LG value itself is large. Our results showcase the advantages of using the modified measurement scheme that can reach the higher LG values, as they give more room for hypothetical malicious errors in a real experiment

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

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

Pure State Tomography with Pauli Measurements

We examine the problem of finding the minimum number of Pauli measurements needed to uniquely determine an arbitrary $n$-qubit pure state among all quantum states. We show that only $11$ Pauli measurements are needed to determine an arbitrary two-qubit pure state compared to the full quantum state tomography with $16$ measurements, and only $31$ Pauli measurements are needed to determine an arbitrary three-qubit pure state compared to the full quantum state tomography with $64$ measurements. We demonstrate that our protocol is robust under depolarizing error with simulated random pure states. We experimentally test the protocol on two- and three-qubit systems with nuclear magnetic resonance techniques. We show that the pure state tomography protocol saves us a number of measurements without considerable loss of fidelity. We compare our protocol with same-size sets of randomly selected Pauli operators and find that our selected set of Pauli measurements significantly outperforms those random sampling sets. As a direct application, our scheme can also be used to reduce the number of settings needed for pure-state tomography in quantum optical systems.

quant-ph↗

arXiv2016

Simulation of anyonic statistics and its topological path independence using a 7-qubit quantum simulator

Anyons, quasiparticles living in two-dimensional spaces with exotic exchange statistics, can serve as the fundamental units for fault-tolerant quantum computation. However, experimentally demonstrating anyonic statistics is a challenge due to the technical limitations of current experimental platforms. Here, we take a state perpetration approach to mimic anyons in the Kitaev lattice model using a 7-qubit nuclear magnetic resonance quantum simulator. Anyons are created by dynamically preparing the ground and excited states of the 7-qubit Kitaev lattice model, and are subsequently braided along two distinct, but topologically equivalent, paths. We observe that the phase acquired by the anyons is independent of the path, and coincides with the ideal theoretical predictions when decoherence and implementation errors are taken into account. As the first demonstration of the topological path independence of anyons, our experiment helps to study and exploit the anyonic properties towards the goal of building a topological quantum computer.

quant-ph↗

arXiv2015

Tomography is necessary for universal entanglement detection with single-copy observables

Entanglement, one of the central mysteries of quantum mechanics, plays an essential role in numerous applications of quantum information theory. A natural question of both theoretical and experimental importance is whether universal entanglement detection is possible without full state tomography. In this work, we prove a no-go theorem that rules out this possibility for any non-adaptive schemes that employ single-copy measurements only. We also examine in detail a previously implemented experiment, which claimed to detect entanglement of two-qubit states via adaptive single-copy measurements without full state tomography. By performing the experiment and analyzing the data, we demonstrate that the information gathered is indeed sufficient to reconstruct the state. These results reveal a fundamental limit for single-copy measurements in entanglement detection, and provides a general framework to study the detection of other interesting properties of quantum states, such as the positivity of partial transpose and the $k$-symmetric extendibility.

quant-ph↗