A fundamental problem in quantum computation and quantum information is finding the minimum quantum dimension needed for a task. For tasks involving state preparation and measurements, this problem can be addressed using only the input-output correlations. This has been applied to Bell, prepare-and-measure, and Kochen-Specker contextuality scenarios. Here, we introduce a novel approach to quantum dimension witnessing for scenarios with one preparation and several measurements, which uses the graphs of mutual exclusivity between sets of measurement events. We present the concepts and tools needed for graph-theoretic quantum dimension witnessing and illustrate their use by identifying novel quantum dimension witnesses, including a family that can certify arbitrarily high quantum dimensions with few events.

Graph-theoretic approach to dimension witnessing

We show that a perfectly genuine tripartite steerable assemblage can be distilled from partially genuine tripartite EPR steerable assemblages. In particular, we consider two types of hybrid scenarios: one-sided device-independent scenario (where one observer is untrusted, and other two observers are trusted) and two-sided device-independent scenario (where two observers are untrusted, and one observer is trusted). In both scenarios, we show distillation of perfectly genuine steerable assemblage of three-qubit Greenberger-Horne-Zeilinger states or three-qubit W states from many copies of initial partially genuine steerable assemblages of the corresponding states. In each of these cases, we demonstrate that at least one copy of a perfectly genuine steerable assemblage can be distilled with certainty from infinitely many copies of initial assemblages. In case of practical scenarios employing finite copies, we show that the efficiency of our distillation protocols reaches near perfect levels using only a few number of initial assemblages.

Distillation of genuine tripartite Einstein-Podolsky-Rosen steering

We consider the problem of devising a suitable Quantum Error Correction (QEC) procedures for a generic quantum noise acting on a quantum circuit. In general, there is no analytic universal procedure to obtain the encoding and correction unitary gates, and the problem is even harder if the noise is unknown and has to be reconstructed. The existing procedures rely on Variational Quantum Algorithms (VQAs) and are very difficult to train since the size of the gradient of the cost function decays exponentially with the number of qubits. We address this problem using a cost function based on the Quantum Wasserstein distance of order 1 ($QW_1$). At variance with other quantum distances typically adopted in quantum information processing, $QW_1$ lacks the unitary invariance property which makes it a suitable tool to avoid to get trapped in local minima. Focusing on a simple noise model for which an exact QEC solution is known and can be used as a theoretical benchmark, we run a series of numerical tests that show how, guiding the VQA search through the $QW_1$, can indeed significantly increase both the probability of a successful training and the fidelity of the recovered state, with respect to the results one obtains when using conventional approaches.

Improving the speed of variational quantum algorithms for quantum error correction


 Quantum computers promise to solve finite-temperature properties of quantum many-body systems, which is generally challenging for classical computers due to high computational complexities. Here, we report experimental preparations of Gibbs states and excited states of Heisenberg XX and XXZ models by using a 5-qubit programmable superconducting processor. In the experiments, we apply a hybrid quantum-classical algorithm to generate finite temperature states with classical probability models and variational quantum circuits. We reveal that the Hamiltonians can be fully diagonalized with optimized quantum circuits, which enable us to prepare excited states at arbitrary energy density. We demonstrate that the approach has a self-verifying feature and can estimate fundamental thermal observables with a small statistical error. Based on numerical results, we further show that the time complexity of our approach scales polynomially in the number of qubits revealing its potential in solving large-scale problems.

/pdf/variational-quantum-simulation-of-thermal-statistical-states-34vwsw6s.pdf

Variational quantum simulation of thermal statistical states on a superconducting quantum processer

We consider the task of certification of genuine entanglement of tripartite states. For this purpose, we first present an "all-versus-nothing" proof of genuine tripartite Einstein-Podolsky-Rosen (EPR) steering by demonstrating the non-existence of a hybrid local hidden state (LHS) model in the tripartite network as a motivation to our main result. A full logical contradiction of the predictions of the hybrid LHS model with quantum mechanical outcome statistics for any three-qubit generalized Greenberger-Horne-Zeilinger (GGHZ) states and pure W-class states is shown. Using logical contradiction, we can distinguish between the GGHZ and W-class state in a two-sided device-independent (2SDI) steering scenario. We next formulate a 2SDI steering inequality which is a generalization of the fine-grained steering inequality (FGI) derived in \cite{PKM14} for the tripartite scenario. We show that the maximum quantum violation of this tripartite FGI can be used to certify genuine entanglement of three-qubit pure states. 

“All-versus-nothing” proof of genuine tripartite steering and entanglement certification in the two-sided device-independent scenario

Abstract In this short review article, we aim to provide physicists not working within the quantum computing community a hopefully easy-to-read introduction to the state of the art in the field, with minimal mathematics involved. In particular, we focus on what is termed the Noisy Intermediate Scale Quantum era of quantum computing. We describe how this is increasingly seen to be a distinct phase in the development of quantum computers, heralding an era where we have quantum computers that are capable of doing certain quantum computations in a limited fashion, and subject to certain constraints and noise. We further discuss the prominent algorithms that are believed to hold the most potential for this era, and also describe the competing physical platforms on which to build a quantum computer that have seen the most success so far. We then talk about the applications that are most feasible in the near-term, and finish off with a short discussion on the state of the field. We hope that as non-experts read this article, it will give context to the recent developments in quantum computers that have garnered much popular press, and help the community understand how to place such developments in the timeline of quantum computing. 

/pdf/nisq-computing-where-are-we-and-where-do-we-go-2xoj7rka.pdf

NISQ computing: where are we and where do we go?

The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown by Coladangelo et. al. (Nat Commun 8, 15485 (2017)) that all pure bipartite entangled states can be self tested in the device independent scenario by employing subspace methods introduced by Yang et. al. (Phys. Rev. A 87, 050102(R)). Here, we have adapted their method to show that any bipartite pure entangled state can be certified in the semi-device independent scenario through Quantum Steering. Analogous to the tilted CHSH inequality, we use a steering inequality called Tilted Steering Inequality for certifying any pure two-qubit entangled state. Further, we use this inequality to certify any bipartite pure entangled state by certifying two-dimensional sub-spaces of the qudit state by observing the structure of the set of assemblages obtained on the trusted side after measurements are made on the un-trusted side. As a feature of quantum state certification via steering, we use the notion of Assemblage based robust state certification to provide robustness bounds for the certification result in the case of pure maximally entangled states of any local dimension.

Robust Semi-Device Independent Certification of All Pure Bipartite Maximally Entangled States via Quantum Steering

The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Here, we have shown that any bipartite pure entangled state can be self-tested through Quantum Steering. Analogous to the tilted CHSH inequality, we have established a new steering inequality called Tilted Steering Inequality for self-testing any pure two-qubit entangled state. We have further used this inequality to self-test any bipartite pure entangled state by certifying two-dimensional sub-spaces of the qudit state by observing the structure of the assemblage obtained on Bob's side after Alice's measurement.

Self Testing of All Pure Bipartite Entangled States via Quantum Steering

The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown [A. Coladangelo, K. T. Goh, and V. Scarani, Nat. Commun. 8, 15485 (2017)] that all pure bipartite entangled states can be self-tested in the device-independent scenario by employing subspace methods introduced by Yang and Navascu\'es [Phys. Rev. A 87, 050102(R) (2013)]. Here, we have adapted their method to show that any bipartite pure entangled state can be certified in the semi-device-independent scenario through quantum steering. Analogous to the tilted Clauser-Horne-Shimony-Holt inequality, we use a steering inequality called the tilted steering inequality for certifying any pure two-qubit entangled state. Furthermore, we use this inequality to certify any bipartite pure entangled state by certifying two-dimensional subspaces of the qudit state by observing the structure of the set of assemblages obtained on the trusted side after measurements are made on the untrusted side. As a feature of quantum state certification via steering, we use the notion of assemblage-based robust state certification to provide robustness bounds for the certification result in the case of pure maximally entangled states of any local dimension.

Robust semi-device-independent certification of all pure bipartite maximally entangled states via quantum steering

We study the role of topology in governing deep thermalization, the relaxation of a local subsystem towards a maximally-entropic, uniform distribution of post-measurement states, upon observing the complementary subsystem in a local basis. Concretely, we focus on a class of (1+1)d systems exhibiting `maximally-chaotic' dynamics, and consider how the rate of the formation of such a universal wavefunction distribution depends on boundary conditions of the system. We find that deep thermalization is achieved exponentially quickly in the presence of either periodic or open boundary conditions; however, the rate at which this occurs is twice as fast for the former than for the latter. These results are attained analytically using the calculus of integration over unitary groups, and supported by extensive numerical simulations. Our findings highlight the nonlocal nature of deep thermalization, and clearly illustrates that the physics underlying this phenomenon goes beyond that of standard quantum thermalization, which only depends on the net build-up of entanglement between a subsystem and its complement.

Harshank Shrotriya

Papers

NISQ computing: where are we and where do we go?

Robust Semi-Device Independent Certification of All Pure Bipartite Maximally Entangled States via Quantum Steering

Self Testing of All Pure Bipartite Entangled States via Quantum Steering

Robust semi-device-independent certification of all pure bipartite maximally entangled states via quantum steering

Nonlocality of Deep Thermalization