Search

Quantum entanglement serves as an important resource for quantum processing. In the original thought experiment of the Quantum Cheshire Cat, the physical properties of the cat (state) can be decoupled from its quantum entities. How do quantum entanglement and weak values affect such thought experiment? Here, we conceive a new thought experiment that exploits quantum entanglement with weak (value) measurement. Specifically, we ask: can two entangled particles exchange physical and quantum properties? We answer the question in the affirmative.

We propose a natural application of Quantum Linear Systems Problem (QLSP) solvers such as the HHL algorithm to efficiently prepare highly excited interior eigenstates of physical Hamiltonians in a variational manner. This is enabled by the efficient computation of inverse expectation values, taking advantage of the QLSP solvers' exponentially better scaling in problem size without concealing exponentially costly pre/post-processing steps that usually accompanies it. We detail implementations of this scheme for both fault-tolerant and near-term quantum computers, analyse their efficiency and implementability, and discuss applications and simulation results in many-body physics and quantum chemistry that demonstrate its superior effectiveness and scalability over existing approaches., 16 pages, 6 figures

Digital quantum computers have the potential to simulate complex quantum systems. The spin-boson model is one of such systems, used in disparate physical domains. Importantly, in a number of setups, the spin-boson model is open, i.e. the system is in contact with an external environment which can, for instance, cause the decay of the spin state. Here we study how to simulate such open quantum dynamics in a digital quantum computer, for which we use one of IBM's hardware. We consider in particular how accurate different implementations of the evolution result as a function of the level of noise in the hardware and of the parameters of the open dynamics. For the regimes studied, we show that the key aspect is to simulate the unitary portion of the dynamics, while the dissipative part can lead to a more noise-resistant simulation. We consider both a single spin coupled to a harmonic oscillator, and also two spins coupled to the oscillator. In the latter case, we show that it is possible to simulate the emergence of correlations between the spins via the oscillator.

Self-testing has been established as a major approach for quantum device certification based on experimental statistics under minimal assumptions. However, despite more than 20 years of research effort most of the self-testing protocols are restricted to spatial scenarios (Bell scenarios), without any temporal generalisations known. Under the scenario of sequential measurements performed on a single quantum system, we build upon previous works which used semi-definite programming (SDP) based methods to bound sequential measurement inequalities. For such SDPs, we show that the optimiser matrix is unique and moreover this uniqueness is robust to small deviations from the quantum bound. Further, we consider a generalised scenario in presence of quantum channels and draw analogies in the structure of Bell and sequential inequalities using the pseudo-density matrix formalism. These analogies allow us to show a practical use of maximal violations of sequential inequalities in the form of certification of quantum channels up to isometries., 12 pages; comments welcome

The calculation of off-diagonal matrix elements has various applications in fields such as nuclear physics and quantum chemistry. In this paper, we present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix elements of a generic observable in the energy eigenbasis of a given Hamiltonian. Several numerical simulations indicate that this approach can find many of the matrix elements even when the trial functions are randomly initialized across a wide range of parameter values without, at the same time, the need to prepare the energy eigenstates.

Finding the transient and steady state properties of open quantum systems is a central problem in various fields of quantum technologies. Here, we present a quantum-assisted algorithm to determine the steady states of open system dynamics. By reformulating the problem of finding the fixed point of Lindblad dynamics as a feasibility semidefinite program, we bypass several well-known issues with variational quantum approaches to solving for steady states. We demonstrate that our hybrid approach allows us to estimate the steady states of higher dimensional open quantum systems and discuss how our method can find multiple steady states for systems with symmetries., 14 pages, 4 figures

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices., Added new content, Modified certain parts and the paper structure

33 revtex pages; 10 figs; Atomtronics is an emerging field which aims to manipulate ultracold atom moving in matter wave circuits for both fundamental studies in quantum science and technological applications. In this colloquium, we review recent progress in matter-wave circuitry and atomtronics-based quantum technology. After a short introduction to the basic physical principles and the key experimental techniques needed to realize atomtronic systems, we describe the physics of matter-wave in simple circuits such as ring traps and two-terminal systems. The main experimental observations and outstanding questions are discussed. Applications to a broad range of quantum technologies, from quantum sensing with atom interferometry to future quantum simulation and quantum computation architectures, are then presented.

Geometric and holonomic quantum computation utilizes intrinsic geometric properties of quantum-mechanical state spaces to realize quantum logic gates. Since both geometric phases and quantum holonomies are global quantities depending only on the evolution paths of quantum systems, quantum gates based on them possess built-in resilience to certain kinds of errors. This review provides an introduction to the topic as well as gives an overview of the theoretical and experimental progress for constructing geometric and holonomic quantum gates and how to combine them with other error-resistant techniques., added a new section "experimental realizations and gates robustness", updated the section on "Combining GQC and HQC with other quantum technologies" with 80 more references

Semidefinite programs (SDPs) are convex optimization programs with vast applications in control theory, quantum information, combinatorial optimization and operational research. Noisy intermediate-scale quantum (NISQ) algorithms aim to make an efficient use of the current generation of quantum hardware. However, optimizing variational quantum algorithms is a challenge as it is an NP-hard problem that in general requires an exponential time to solve and can contain many far from optimal local minima. Here, we present a current term NISQ algorithm for solving SDPs. The classical optimization program of our NISQ solver is another SDP over a lower dimensional ansatz space. We harness the SDP based formulation of the Hamiltonian ground state problem to design a NISQ eigensolver. Unlike variational quantum eigensolvers, the classical optimization program of our eigensolver is convex, can be solved in polynomial time with the number of ansatz parameters and every local minimum is a global minimum. We find numeric evidence that NISQ SDP can improve the estimation of ground state energies in a scalable manner. Further, we efficiently solve constrained problems to calculate the excited states of Hamiltonians, find the lowest energy of symmetry constrained Hamiltonians and determine the optimal measurements for quantum state discrimination. We demonstrate the potential of our approach by finding the largest eigenvalue of up to $2^{1000}$ dimensional matrices and solving graph problems related to quantum contextuality. We also discuss NISQ algorithms for rank-constrained SDPs. Our work extends the application of NISQ computers onto one of the most successful algorithmic frameworks of the past few decades., 16 pages, 9 figures

Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely, with minimal assumptions about the underlying quantum system. It is based on the observation that some extremal points in the set of quantum correlations can only be achieved, up to isometries, with specific states and measurements. Here, we present a new approach for quantum self-testing in Bell non-locality scenarios, motivated by the following observation: the quantum maximum of a given Bell inequality is, in general, difficult to characterize. However, it is strictly contained in an easy-to-characterize set: the \emph{theta body} of a vertex-weighted induced subgraph $(G,w)$ of the graph in which vertices represent the events and edges join mutually exclusive events. This implies that, for the cases where the quantum maximum and the maximum within the theta body (known as the Lov\'asz theta number) of $(G,w)$ coincide, self-testing can be demonstrated by just proving self-testability with the theta body of $G$. This graph-theoretic framework allows us to (i) recover the self-testability of several quantum correlations that are known to permit self-testing (like those violating the Clauser-Horne-Shimony-Holt (CHSH) and three-party Mermin Bell inequalities for projective measurements of arbitrary rank, and chained Bell inequalities for rank-one projective measurements), (ii) prove the self-testability of quantum correlations that were not known using existing self-testing techniques (e.g., those violating the Abner Shimony Bell inequality for rank-one projective measurements). Additionally, the analysis of the chained Bell inequalities gives us a closed-form expression of the Lov\'asz theta number for a family of well-studied graphs known as the M\"obius ladders, which might be of independent interest in the community of discrete mathematics., Comment: 29 pages

The design, accurate preparation and manipulation of quantum states are essential operational tasks at the heart of quantum technologies. Nowadays, physical parameters of quantum devices and networks can be controlled with unprecedented accuracy and flexibility. However, the generation of well-controlled current states is still a nagging bottleneck, especially when different circuit elements are integrated together. In this work, we show how machine learning can effectively address this challenge and outperform the current existing methods. To this end, we exploit deep reinforcement learning to prepare prescribed quantum current states within a short time scale and with a high fidelity. To highlight our method, we show how to engineer bosonic persistent currents in ring circuits as they are key ingredients in different quantum technology devices. With our approach, quantum current states characterized by a single winding number or entangled currents with two winding numbers can be prepared superseding the existing protocols. In addition, we generated quantum states entangling a larger set of different winding numbers. Our deep reinforcement learning scheme provides solutions for known challenges in quantum technology and opens new avenues for the control of quantum devices.

Synchronization occurs ubiquitously in nature. The van der Pol oscillator has been a favorite model to investigate synchronization. Here we study the oscillator in the deep quantum regime, where nonclassical effects dominate the dynamics. Our results show: (i) squeezed driving loses its effect, (ii) noise boosts synchronization, (iii) synchronization is bounded, and (iv) the limit-cycle is insensitive to strong driving. We propose a synchronization measure and analytically calculate it. These results reflect intrinsic differences between synchronization in the quantum and deep quantum regimes.

Chiral quantum networks provide a promising route for realising quantum information processing and quantum communication. Here, we describe how two distant quantum nodes of chiral quantum network become dynamically entangled by a photon transfer through a common 1D chiral waveguide. We harness the directional asymmetry in chirally-coupled single-mode ring resonators to generate entangled state between two atoms. We report a concurrence of up to 0.969, a huge improvement over the 0.736 which was suggested and analyzed in great detail in Ref. [1]. This significant enhancement is achieved by introducing microtoroidal resonators which serve as efficient photonic interface between light and matter. Robustness of our protocol to experimental imperfections such as fluctuations in inter-nodal distance, imperfect chirality, various detunings and atomic spontaneous decay is demonstrated. Our proposal can be utilised for long-distance entanglement generation in quantum networks which is a key ingredient for many applications in quantum computing and quantum information processing., 10 pages, 6 figures, 1 table

Motivated by the recent success of reinforcement learning in games such as Go and Dota2, we formulate Bell non-local games as a reinforcement learning problem. Such a formulation helps us to explore Bell non-locality in a range of scenarios. The measurement settings and the quantum states are selected by the learner randomly in the beginning. Still, eventually, it starts understanding the underlying patterns and discovers an optimal (or near-optimal) quantum configuration corresponding to the task at hand. We provide a proof of principle approach to learning quantum configurations for violating various Bell inequalities. The algorithm also works for non-convex optimization problems where convex methods fail, thus offering a possibility to explore optimal quantum configurations for Bell inequalities corresponding to large quantum networks. We also implement a hybrid quantum-classical variational algorithm with reinforcement learning., 8 pages, 4.5 main text, 3.5 supplementary material

Progress in testing fundamental physics relies on our ability to measure exceedingly small physical quantities. Using a $^{40}$Ca$^{+}$ trapped ion system as an example we show that an exceedingly weak synthetic magnetic field (at the scale of $10^{-19}$ T) can be measured with current technology. This improved sensitivity can be used to test the effects of spin coupling that affect the equivalence principle and, if present, may impact the performance of the proposed entangled optical clocks arrays., 11 pages, comments welcome

The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable examples being the analysis of big data through better machine learning algorithms and the design of new materials. Nevertheless, the capacity of quantum computers to faithfully implement quantum algorithms relies crucially on their ability to prepare specific high-dimensional and high-purity quantum states, together with suitable quantum measurements. Thus, the unambiguous certification of these requirements without assumptions on the inner workings of the quantum computer is critical to the development of trusted quantum processors. One of the most important approaches for benchmarking quantum devices is through the mechanism of self-testing that requires a pair of entangled non-communicating quantum devices. Nevertheless, although computation typically happens in a localized fashion, no local self-testing scheme is known to benchmark high dimensional states and measurements. Here, we show that the quantum self-testing paradigm can be employed to an individual quantum computer that is modelled as a programmable black box by introducing a noise-tolerant certification scheme. We substantiate the applicability of our scheme by providing a family of outcome statistics whose observation certifies that the computer is producing specific high-dimensional quantum states and implementing specific measurements., 10 pages, 4 figures, Comments welcome

We propose a realization of the quantum transistor for coherent light fields for the fibre-coupled microdisk cavities. We demonstrate by combining numerical and analytical methods that both in strong coupling and bad cavity limits it is possible to change system's behaviour from being fully transparent to being fully reflective by varying the amplitude of the external control field. We remark that tuning the amplitude of the control field is significantly easier in the experimental setting than tuning cavity-atom coupling strength which was suggested in [Phys. Rev. A 90, 053822 (2014)] for two-level atoms and works only in the strong coupling limit. We also demonstrate the possibility of controlling the statistics of the input coherent field with the control field which opens the venue for obtaining quantum states of light.

Clifford circuits play an important role in quantum computation. Gottesman and Chuang proposed a gate teleportation protocol so that a quantum circuit can be implemented by the teleportation circuit with specific ancillary qubits. In particular, an $n$-qubit Clifford circuit $U$ can be implemented by preparing an ancillary stabilizer state $(I\otimes U)|\Phi^+\rangle^{\otimes n}$ for teleportation and doing a Pauli correction conditioned on the measurement. In this paper, we provide an alternative procedure to implement a Clifford circuit through Pauli measurements, by preparing $O(1)$ ancillas that are Calderbank-Shor-Steane (CSS) stabilizer states. That is to say, $O(1)$ CSS states are sufficient to implement any Clifford circuit. As an application to fault-tolerant quantum computation, any Clifford circuit can be implemented by $O(1)$ steps of Steane syndrome extraction if clean CSS stabilizer states are available., Comment: 9 pages, comments are most welcome