arXiv subjects

Raymond Laflamme

Publications and source records attributed to Raymond Laflamme.

At least 37 records · Page 2Linked to original sources

arXiv2020

Fast Simulation of Magnetic Field Gradients for Optimization of Pulse Sequences

We study how to simulate, efficiently, pulse field gradients (PFG) used in nuclear magnetic resonance (NMR). An efficient simulation requires discretization in time and space. We study both discretizations and provide a guideline to choose best discretization values depending on the precision required experimentally. We provide a theoretical study and simulation showing the minimum number of divisions we need in space for simulating, with high precision, a sequence composed of several unitary evolution and PFG. We show that the fast simulation of PFG allow us to optimize sequences composed of PFG, radio-frequency pulses and free evolution, to implement non-unitary evolution (quantum channels). As an evidence of the success of our work, we performed two types of experiments. First, we implement two quantum channels and compare the results with their theoretical predictions. In the second experiment, we used the fast simulation of PFG to optimize and implement a sequence to prepare pseudo pure state with better signal to noise ratio than any known procedure till now.

quant-ph↗

arXiv2020

Implementation of a Quantum Engine Fuelled by Information

Here, we show the implementation of a complete cycle of a quantum engine fuelled by information. This engine is a quantum version of the Szilard engine, where information is used to extract heat from the environment and fully convert it into work. In our experiment, this work is used to make a weight, initially in the ground state, reach its excited state. We measure the energy and the state of each component of the engine, after each step of the cycle, and compare them with the theoretical prediction to show that the cycle is implemented with high precision. We also perform experiments to show that the engine is well isolated from the environment after the heat extraction, and we measure the entropy of the weight to show the full conversion of heat into work. Thus, we successfully demonstrate that information can be used as a fuel for single-reservoir engines.

quant-ph↗

arXiv2020

On the freedom in representing quantum operations

We discuss the effects of a gauge freedom in representing quantum information processing devices, and its implications for characterizing these devices. We demonstrate with experimentally relevant examples that there exists equally valid descriptions of the same experiment which distribute errors differently among objects in a gate-set, leading to different error rates. Consequently, it can be misleading to attach a concrete operational meaning to figures of merit for individual gate-set elements. We propose an alternative operational figure of merit for a gate-set, the mean variation error, and a protocol for measuring this figure.

quant-ph↗

arXiv2019

Exploration of an augmented set of Leggett-Garg inequalities using a noninvasive continuous-in-time velocity measurement

Macroscopic realism (MR) is the view that a system may possess definite properties at any time independent of past or future measurements, and may be tested experimentally using the Leggett-Garg inequalities (LGIs). In this work we advance the study of LGIs in two ways using experiments carried out on a nuclear magnetic resonance spectrometer. Firstly, we addresses the fact that the LGIs are only necessary conditions for MR but not sufficient ones. We implement a recently-proposed test of necessary and sufficient conditions for MR which consists of a combination of the original four three-time LGIs augmented with a set of twelve two-time LGIs. We explore different regimes in which the two- and three-time LGIs may each be satisfied or violated. Secondly, we implement a recent proposal for a measurement protocol which determines the temporal correlation functions in an approximately non-invasive manner. It employs a measurement of the velocity of a dichotomic variable $Q$, continuous in time, from which a possible sign change of $Q$ may be determined in a single measurement of an ancilla coupled to the velocity. This protocol involves a significantly different set of assumptions to the traditional ideal negative measurement protocol and a comparison with the latter is carried out.

quant-ph↗

arXiv2019

Enhancing quantum control by improving shape pulse generation

Most quantum processors requires pulse sequences for controlling quantum states. Here, we present an alternative algorithm for computing an optimal pulse sequence in order to perform a specific task, being an implementation of a quantum gate or a quantum state preparation. In our method, we reduced drastically the number of parameters to be fitted, by using a limited number of functions as the modulations for the amplitude and phase of the radio-frequency pulses, and employed approximations to make the algorithm fast and scalable. We demonstrate the success of the proposed algorithm, by performing several real experiments for 4, 7 and 12 quantum bits systems using NMR. In addition, we have also shown the efficiency of the algorithm, finding pulses for controlling with good fidelity the quantum states of spins in a fictional square bi-dimensional lattices containing 16, 36 and 100 qubits.

quant-ph↗

arXiv2019

Accelerated quantum walk, two-particle entanglement generation and localization

We present a scheme to describe the dynamics of accelerating discrete-time quantum walk for one- and two-particle in position space. We show the effect of acceleration in enhancing the entanglement between the particle and position space in one-particle quantum walk and in generation of entanglement between the two unentangled particle in two-particle quantum walk. By introducing the disorder in the form of phase operator we study the transition from localization to delocalization as a function of acceleration. These inter-winding connection between acceleration, entanglement generation and localization along with well established connection of quantum walks with Dirac equation can be used to probe further in the direction of understanding the connection between acceleration, mass and entanglement in relativistic quantum mechanics and quantum field theory. Expansion of operational tools for quantum simulations and for modelling quantum dynamics of accelerated particle using quantum walks is an other direction where these results can play an important role.

quant-ph↗

arXiv2019

Quantum Simulation of the Non-Fermi-Liquid State of Sachdev-Ye-Kitaev Model

The Sachdev-Ye-Kitaev (SYK) model incorporates rich physics, ranging from exotic non-Fermi liquid states without quasiparticle excitations, to holographic duality and quantum chaos. However, its experimental realization remains a daunting challenge due to various unnatural ingredients of the SYK Hamiltonian such as its strong randomness and fully nonlocal fermion interaction. At present, constructing such a nonlocal Hamiltonian and exploring its dynamics is best through digital quantum simulation, where state-of-the-art techniques can already handle a moderate number of qubits. Here we demonstrate a first step towards simulation of the SYK model on a nuclear-spin-chain simulator. We observed the fermion paring instability of the non-Fermi liquid state and the chaotic-nonchaotic transition at simulated temperatures, as was predicted by previous theories. As the realization of the SYK model in practice, our experiment opens a new avenue towards investigating the key features of non-Fermi liquid states, as well as the quantum chaotic systems and the AdS/CFT duality.

quant-ph↗

arXiv2019

Measuring Holographic Entanglement Entropy on a Quantum Simulator

Quantum simulation promises to have wide applications in many fields where problems are hard to model with classical computers. Various quantum devices of different platforms have been built to tackle the problems in, say, quantum chemistry, condensed matter physics, and high-energy physics. Here, we report an experiment towards the simulation of quantum gravity by simulating the holographic entanglement entropy. On a six-qubit nuclear magnetic resonance quantum simulator, we demonstrate a key result of Anti-de Sitter/conformal field theory(\adscft) correspondence---the Ryu-Takayanagi formula is demonstrated by measuring the relevant entanglement entropies on the perfect tensor state. The fidelity of our experimentally prepared the six-qubit state is 85.0\% via full state tomography and reaches 93.7\% if the signal-decay due to decoherence is taken into account. Our experiment serves as the basic module of simulating more complex tensor network states that exploring \adscft correspondence. As the initial experimental attempt to study \adscft via quantum information processing, our work opens up new avenues exploring quantum gravity phenomena on quantum simulators.

quant-ph↗

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

Coherence in quantum error-correcting codes

Typical studies of quantum error correction assume probabilistic Pauli noise, largely because it is relatively easy to analyze and simulate. Consequently, the effective logical noise due to physically realistic coherent errors is relatively unknown. Here, we prove that encoding a system in a stabilizer code and measuring error syndromes decoheres errors, that is, causes coherent errors to converge toward probabilistic Pauli errors, even when no recovery operations are applied. Two practical consequences are that the error rate in a logical circuit is well quantified by the average gate fidelity at the logical level and that essentially optimal recovery operators can be determined by independently optimizing the logical fidelity of the effective noise per syndrome.

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

Bounds on the dynamics of periodic quantum walks and emergence of the gapless and gapped Dirac equation

We study the dynamics of discrete-time quantum walk using quantum coin operations, $\hat{C}(θ_1)$ and $\hat{C}(θ_2)$ in time-dependent periodic sequence. For the two-period quantum walk with the parameters $θ_1$ and $θ_2$ in the coin operations we show that the standard deviation [$σ_{θ_1, θ_2} (t)$] is the same as the minimum of standard deviation obtained from one of the one-period quantum walks with coin operations $θ_1$ or $θ_2$, $σ_{θ_1, θ_2}(t) = \min \{σ_{θ_1}(t), σ_{θ_2}(t) \}$. Our numerical result is analytically corroborated using the dispersion relation obtained from the continuum limit of the dynamics. Using the dispersion relation for one- and two-period quantum walks, we present the bounds on the dynamics of three- and higher period quantum walks. We also show that the bounds for the two-period quantum walk will hold good for the split-step quantum walk which is also defined using two coin operators using $θ_1$ and $θ_2$. Unlike the previous known connection of discrete-time quantum walks with the massless Dirac equation where coin parameter $θ=0$, here we show the recovery of the massless Dirac equation with non-zero $θ$ parameters contributing to the intriguing interference in the dynamics in a totally non-relativistic situation. We also present the effect of periodic sequence on the entanglement between coin and position space.

quant-ph↗

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

Overhead analysis of universal concatenated quantum codes

We analyze the resource overhead of recently proposed methods for universal fault-tolerant quantum computation using concatenated codes. Namely, we examine the concatenation of the 7-qubit Steane code with the 15-qubit Reed-Muller code, which allows for the construction of the 49 and 105-qubit codes that do not require the need for magic state distillation for universality. We compute a lower bound for the adversarial noise threshold of the 105-qubit code and find it to be $8.33\times 10^{-6}.$ We obtain a depolarizing noise threshold for the 49-qubit code of $9.69\times 10^{-4}$ which is competitive with the 105-qubit threshold result of $1.28\times 10^{-3}$. We then provide lower bounds on the resource requirements of the 49 and 105-qubit codes and compare them with the surface code implementation of a logical $T$ gate using magic state distillation. For the sampled input error rates and noise model, we find that the surface code achieves a smaller overhead compared to our concatenated schemes.

quant-ph↗

arXiv2017

Hard decoding algorithm for optimizing thresholds under general Markovian noise

Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of error-correcting codes have been obtained. However, realistic quantum systems can undergo noise processes that differ significantly from Pauli noise. In this paper, we present an efficient hard decoding algorithm for optimizing thresholds and lowering failure rates of an error-correcting code under general completely positive and trace-preserving (i.e., Markovian) noise. We use our hard decoding algorithm to study the performance of several error-correcting codes under various non-Pauli noise models by computing threshold values and failure rates for these codes. We compare the performance of our hard decoding algorithm to decoders optimized for depolarizing noise and show improvements in thresholds and reductions in failure rates by several orders of magnitude. Our hard decoding algorithm can also be adapted to take advantage of a code's non-Pauli transversal gates to further suppress noise. For example, we show that using the transversal gates of the 5-qubit code allows arbitrary rotations around certain axes to be perfectly corrected. Furthermore, we show that Pauli twirling can increase or decrease the threshold depending upon the code properties. Lastly, we show that even if the physical noise model differs slightly from the hypothesized noise model used to determine an optimized decoder, failure rates can still be reduced by applying our hard decoding algorithm.

quant-ph↗

arXiv2017

Defect production in nonequilibrium phase transitions: Experimental investigation of the Kibble-Zurek mechanism in a two-qubit quantum simulator

Systems passing through quantum critical points at finite rates have a finite probability of undergoing transitions between different eigenstates of the instantaneous Hamiltonian. This mechanism was proposed by Kibble as the underlying mechanism for the formation of topological defects in the early universe and by Zurek for condensed matter systems. Here, we use a system of nuclear spins as an experimental quantum simulator undergoing a non-equilibrium quantum phase transition. The experimental data confirm the validity of the Kibble-Zurek mechanism of defect formation.

quant-ph↗

arXiv2017

Correlation-Enhanced Algorithmic Cooling

We propose a method for increasing purity of interacting quantum systems that takes advantage of correlations present due to the internal interaction. In particular we show that by using the system's quantum correlations one can achieve cooling beyond established limits of previous conventional algorithmic cooling proposals which assume no interaction.

quant-ph↗