28 pages, LaTeX, 11 figures within the text, to appear in "Collected Papers on Quantum Computation and Quantum Information Theory", edited by C. Macchiavello, G.M. Palma, and A. Zeilinger (World Scientific)
We give a basic overview of computational complexity, query complexity, and communication complexity, with quantum information incorporated into each of these scenarios. The aim is to provide simple but clear definitions, and to highlight the interplay between the three scenarios and currently-known quantum algorithms.
This is an overview of the state of the art for practical quantum key distribution (QKD) as of March 2015. It is written by a non-expert for non-experts. Additions and corrections are welcome.
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large systems of linear equations. Here we briefly survey some known quantum algorithms, with an emphasis on a broad overview of their applications rather than their technical details. We include a discussion of recent developments and near-term applications of quantum algorithms.
We present a short overview of quantum entanglement generation and preservation in a steady state. In addition to the focus on quantum entanglement stabilization, we briefly discuss the same objective for steady-state quantum coherence. The overview classifies the approaches into two main categories: hybrid drive and dissipation methods and purely dissipative schemes. Furthermore, purely dissipative schemes are discussed under two subclasses of equilibrium and nonequilibrium environments. The significance of the dissipative route to sustained quantum entanglement and challenges against it are …
We discuss how quantum computation can be applied to financial problems, providing an overview of current approaches and potential prospects. We review quantum optimization algorithms, and expose how quantum annealers can be used to optimize portfolios, find arbitrage opportunities, and perform credit scoring. We also discuss deep-learning in finance, and suggestions to improve these methods through quantum machine learning. Finally, we consider quantum amplitude estimation, and how it can result in a quantum speed-up for Monte Carlo sampling. This has direct applications to many current finan…
The phase-space formulation of quantum mechanics has recently seen increased use in testing quantum technologies, including metho ds of tomography for state verification and device validation. Here, an overview of quantum mechanics in phase space is presented. The formulation to generate a generalized phase-space function for any arbitrary quantum system is shown, such as the Wigner and Weyl functions along with the asso ciated Q and P functions. Examples of how these different formulations have b een used in quantum technologies are provided, with a focus on discrete quantum systems, qubits i…
Quantum computers, if fully realized, promise to be a revolutionary technology. As a result, quantum computing has become one of the hottest areas of research in the last few years. Much effort is being applied at all levels of the system stack, from the creation of quantum algorithms to the development of hardware devices. The quantum age appears to be arriving sooner rather than later as commercially useful small-to-medium sized machines have already been built. However, full-scale quantum computers, and the full-scale algorithms they would perform, remain out of reach for now. It is current…
Circuit design for quantum machine learning remains a formidable challenge. Inspired by the applications of tensor networks across different fields and their novel presence in the classical machine learning context, one proposed method to design variational circuits is to base the circuit architecture on tensor networks. Here, we comprehensively describe tensor-network quantum circuits and how to implement them in simulations. This includes leveraging circuit cutting, a technique used to evaluate circuits with more qubits than those available on current quantum devices. We then illustrate the …
How Time Works in Quantum Systems: Overview of time ordering and time correlation in weakly perturbed atomic collisions and in strongly perturbed qubits
Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor factorization algorithm, Grover search algorithm, quantum Fourrier transformation, etc. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can me…
Quantum Key Distribution (QKD) is an approach for establishing symmetrical binary keys between distant users in an information-theoretically secure way. In this paper we provide an overview of existing solutions that integrate QKD within the most popular architecture for establishing secure communications in modern IP (Internet Protocol) networks - IPsec (Internet Protocol security). The provided overview can be used to further design the integration of QKD within the IPsec architecture striving for a standardized solution.
The occurrence of revivals of quantum entanglement between separated open quantum systems has been shown not only for dissipative non-Markovian quantum environments but also for classical environments in absence of back-action. While the phenomenon is well understood in the first case, the possibility to retrieve entanglement when the composite quantum system is subject to local classical noise has generated a debate regarding its interpretation. This dynamical property of open quantum systems assumes an important role in quantum information theory from both fundamental and practical perspecti…
The separability problem is one of the basic and emergent problems in the present and future quantum information processing. The latter focuses on information and computing based on quantum mechanics and uses quantum bits as its basic information units. In this paper, we present an overview of the progress in the separability problem in bipartite systems, more specifically in two quantum bits systems from the criterion based on the inequalities of Bell in $1964$ to the recent criteria of separability in 2018.
We review the literature about reaching agreement in quantum networks, also called quantum consensus. After a brief introduction to the key feature of quantum computing, allowing the reader with no quantum theory background to have minimal tools to understand, we report a formal definition of quantum consensus and the protocols proposed. Proposals are classified according to the quantum feature used to achieve agreement.
The last few decades have seen significant breakthroughs in the fields of deep learning and quantum computing. Research at the junction of the two fields has garnered an increasing amount of interest, which has led to the development of quantum deep learning and quantum-inspired deep learning techniques in recent times. In this work, we present an overview of advances in the intersection of quantum computing and deep learning by discussing the technical contributions, strengths and similarities of various research works in this domain. To this end, we review and summarise the different schemes…
In this Near Intermediate-Scale Quantum era, there are two types of near-term quantum devices available on cloud: superconducting quantum processing units (QPUs) based on the discrete variable model and linear optics (photonics) QPUs based on the continuous variable (CV) model. Quantum computation in the discrete variable model is performed in a finite dimensional quantum state space and the CV model in an infinite dimensional space. In implementing quantum algorithms, the CV model offers more quantum gates that are not available in the discrete variable model. CV-based photonic quantum comput…
In this review, after providing the basic physical concept behind quantum annealing (or adiabatic quantum computation), we present an overview of some recent theoretical as well as experimental developments pointing to the issues which are still debated. With a brief discussion on the fundamental ideas of continuous and discontinuous quantum phase transitions, we discuss the Kibble-Zurek scaling of defect generation following a ramping of a quantum many body system across a quantum critical point. In the process, we discuss associated models, both pure and disordered, and shed light on impleme…
A quantum memory or information processing device is subject to disturbance from its surrounding environment or inevitable leakage due to its contact with other systems. To tackle these problems, several control protocols have been proposed for quantum memory or storage. Among them, the fast-signal control or dynamical decoupling based on external pulse sequences provides a prevailing strategy aimed at suppressing decoherence and preventing the target systems from the leakage or diffusion process. In this paper, we review the applications of this protocol in protecting quantum memory under the…
Quantum computers are available to use over the cloud, but the recent explosion of quantum software platforms can be overwhelming for those deciding on which to use. In this paper, we provide a current picture of the rapidly evolving quantum computing landscape by comparing four software platforms---Forest (pyQuil), Qiskit, ProjectQ, and the Quantum Developer Kit (Q\#)---that enable researchers to use real and simulated quantum devices. Our analysis covers requirements and installation, language syntax through example programs, library support, and quantum simulator capabilities for each platf…
The aim of the present paper is twofold. First, to give the main ideas behind quantum computingand quantum information, a field based on quantum-mechanical phenomena. Therefore, a shortreview is devoted to (i) quantum bits or qubits (and more generally qudits), the analogues of theusual bits 0 and 1 of the classical information theory, and to (ii) two characteristics of quantummechanics, namely, linearity (which manifests itself through the superposition of qubits and theaction of unitary operators on qubits) and entanglement of certain multi-qubit states (a resourcethat is specific to quantum…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates information at a bounded speed) and translation-invariant (it acts everywhere the same). Quantum cellular automata provide a model/architecture for distributed quantum computation. More generally, they encompass most of discrete-space discrete-time quantum theory. We give an overview of their theory, with particular focus on structure results; computability and univ…
Measuring entanglement is a demanding task in the field of quantum computation and quantum information theory. Recently, some authors experimentally demonstrated an embedding quantum simulator, using it to efficiently measure two-qubit entanglement. Here, we are reviewing some measures of entanglement which are used for pure and mixed states. Furthermore, we have reported the efficient bipartite and multipartite entanglement measures.
QKD-Integrated Quantum Noise Stream Cipher: An Overview
Indian Institute of Technology Roorkee（印度技术学院鲁尔凯拉）；Tamagawa University（多摩川大学）；Northwestern University（西北大学）；Eindhoven University of Technology（埃因霍温理工大学）
Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can check whether quantum computers are indeed producing correct results. This task, known as quantum verification, has been highlighted as a significant challenge on the road to scalable quantum computing technology. We review the most significant approaches to quantum verification and compare them in terms of structure, complexity and required resources. We al…
Uncertainty relations involving complementary observables are one of the cornerstones of quantum mechanics. Aside from their fundamental significance, they play an important role in practical applications, such as detection of quantum correlations and security requirements in quantum cryptography. In continuous variable systems, the spectra of the relevant observables form a continnuum and this necessitates the coarse graining of measurements. However, these coarse-grained observables do not necessarily obey the same uncertainty relations as the original ones, a fact that can lead to false res…
I describe how real quantum annealers may be used to perform local (in state space) searches around specified states, rather than the global searches traditionally implemented in the quantum annealing algorithm. The quantum annealing algorithm is an analogue of simulated annealing, a classical numerical technique which is now obsolete. Hence, I explore strategies to use an annealer in a way which takes advantage of modern classical optimization algorithms, and additionally should be less sensitive to problem mis-specification then the traditional quantum annealing algorithm.
We give a short overview over recent developments on quantum graphs and outline the connection between general quantum graphs and so-called quantum random walks.
The approach to thermal equilibrium, or thermalization, in isolated quantum systems is among the most fundamental problems in statistical physics. Recent theoretical studies have revealed that thermalization in isolated quantum systems has several remarkable features, which emerge from quantum entanglement and are quite distinct from those in classical systems. Experimentally, well isolated and highly controllable ultracold quantum gases offer an ideal system to study the nonequilibrium dynamics in isolated quantum systems, triggering intensive recent theoretical endeavors on this fundamental …
To date, a conclusive detection of quantum speedup remains elusive. Recently, a team by Google Inc.~[V.~S.~Denchev {\em et al}., Phys.~Rev.~X {\bf 6}, 031015 (2016)] proposed a weak-strong cluster model tailored to have tall and narrow energy barriers separating local minima, with the aim to highlight the value of finite-range tunneling. More precisely, results from quantum Monte Carlo simulations, as well as the D-Wave 2X quantum annealer scale considerably better than state-of-the-art simulated annealing simulations. Moreover, the D-Wave 2X quantum annealer is $\sim 10^8$ times faster than s…
In this work, we provide an overview of circuits for quantum computing. We introduce gates used in quantum computation and then present resource cost measurements used to evaluate circuits made from these gates. We then illustrate how the gates shown are then combined into quantum circuits for basic arithmetic functions. Architectures for addition, subtraction, multiplication, and division are shown. We demonstrate how to calculate the resource costs of quantum circuits. We conclude this overview with by illustrating an application of the elementary quantum circuits for the image rotation oper…
Spontaneous localisation is a falsifiable dynamical mechanism which modifies quantum mechanics, and explains the absence of position superpositions in the macroscopic world. However, this is an ad hoc phenomenological proposal. Adler's theory of trace dynamics, working on a flat Minkowski space-time, derives quantum (field) theory, and spontaneous localisation, as a thermodynamic approximation to an underlying non-commutative matrix dynamics. We describe how to incorporate gravity into trace dynamics, by using ideas from Connes' non-commutative geometry programme. This leads us to a new quantu…
We present an overview of a programme to understand the low-energy physics of quantum Yang-Mills theory from a quantum-information perspective. Our setting is that of the hamiltonian formulation of pure Yang-Mills theory in the temporal gauge on the lattice. Firstly, inspired by recent constructions for $\mathbb{Z}/2\mathbb{Z}$ lattice gauge theory, in particular, Kitaev's toric code, we describe the gauge-invariant sector of hilbert space by introducing a primitive quantum gate: the quantum parallel transporter. We then develop a nonabelian generalisation of laplace interpolation to present a…
Quantum information technology based on solid state qubits has created much interest in converting quantum states from the microwave to the optical domain. Optical photons, unlike microwave photons, can be transmitted by fiber, making them suitable for long distance quantum communication. Moreover, the optical domain offers access to a large set of very well developed quantum optical tools, such as highly efficient single-photon detectors and long-lived quantum memories. For a high fidelity microwave to optical transducer, efficient conversion at single photon level and low added noise is need…
