8 pages. Presented at the 13th Symposium on Theoretical Aspects of Computer Science, Grenoble, 22 February 1996. Will appear in the proceedings, Lecture Notes in Computer Science, Springer-Verlag. Standard LaTeX. Requires llncs.sty (included)
Classical and quantum information are very different. Together they can perform feats that neither could achieve alone, such as quantum computing, quantum cryptography and quantum teleportation. Some of the applications range from helping to preventing spies from reading private communications. Among the tools that will facilitate their implementation, we note quantum purification and quantum error correction. Although some of these ideas are still beyond the grasp of current technology, quantum cryptography has been implemented and the prospects are encouraging for small-scale prototypes of quantum computation devices before the end of the millennium.
We use the benefits and components of classical computers every day. However, there are many types of problems which, as they grow in size, their computational complexity grows larger than classical computers will ever be able to solve. Quantum computing (QC) is a computation model that uses quantum physical properties to solve such problems. QC is at the early stage of large-scale adoption in various industry domains to take advantage of the algorithmic speed-ups it has to offer. It can be applied in a variety of areas, such as computer science, mathematics, chemical and biochemical engineeri…
Here we review some of the recent developments in Quantum Optics. After a brief introduction to the historical development of the subject, we discuss some of the modern aspects of quantum optics including atom field interactions, quantum state engineering, metamaterials and plasmonics, optomechanical systems, PT (Parity-Time) symmetry in quantum optics as well as quasi-probability distributions and quantum state tomography. Further, the recent developments in topological photonics is briefly discussed. The potent role of the subject in the development of our understanding of quantum physics an…
As the popularity of quantum computing continues to grow, quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis of resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing. This paper is a first-of…
Quantum computing technologies are advancing, and the class of addressable problems is expanding. Together with the emergence of new ventures and government-sponsored partnerships, these trends will help lower the barrier for new technology adoption and provide stability in an uncertain market. Until then, quantum computing presents an exciting testbed for different strategies in an emerging market.
Blind quantum computing is a new secure quantum computing protocol where a client who does not have any sophisticated quantum technlogy can delegate her quantum computing to a server without leaking any privacy. It is known that a client who has only a measurement device can perform blind quantum computing [T. Morimae and K. Fujii, Phys. Rev. A {\bf87}, 050301(R) (2013)]. It has been an open problem whether the protocol can enjoy the verification, i.e., the ability of client to check the correctness of the computing. In this paper, we propose a protocol of verification for the measurement-only…
Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness) and the correctness of the computation is verifiable by the client in spite of her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states, and the protocol where the client needs only the ability of single-qu…
Quantum Weighted Moving Average for Predicting Limit Order Book Trends
National University of Singapore（新加坡国立大学）；ETH Zürich（苏黎世联邦理工学院）；Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Department of Information Technology and Electrical Engineering, ETH Zürich（苏黎世联邦理工学院信息技术与电气工程系）；School of Computing, National University of Singapore（新加坡国立大学计算机学院）
We present a concise but complete conceptual treatment of quantum computing implemented with Cavity Quantum Electrodynamics (CQED. The paper is intended as a brief overview for professionals who are coming over to the field from other areas and who may have not discussed the concepts behind quantum computing during their technical training.
A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu quant-ph/0203034 and solves an Turing-incomputable problem. For the proposed model and problem, a simulation of its behavior is made. Furthermore, it is demonstrated that ISWHM is a universal quantum computation model.
Quantum computing has seen tremendous progress in the past years. However, due to limitations in scalability of quantum technologies, it seems that we are far from constructing universal quantum computers for everyday users. A more feasible solution is the delegation of computation to powerful quantum servers on the network. This solution was proposed in previous studies of Blind Quantum Computation, with guarantees for both the secrecy of the input and of the computation being performed. In this work, we further develop this idea of computing over encrypted data, to propose a multiparty deleg…
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.
We show a method for implementing universal quantum computing using of a singlet and triplets of nanowire double quantum dots coupled to a one-dimensional transmission line resonator. This method is attractive for both quantum computing and quantum control with inhibition of spontaneous emission, enhanced spin qubit lifetime, strong coupling and quantum nondemolition measurements of spin qubits. We analyze the performance and stability of all required operations and emphasize that all techniques are feasible with current experimental technology.
Quantum computing gates are proposed to apply on trapped ions in decoherence-free states. As phase changes due to time evolution of components with different eigenenergies of quantum superposition are completely frozen, quantum computing based on this model would be perfect. Possible application of our scheme in future ion-trap quantum computer is discussed.
A Comment on the paper "Quantum waveguide array generator for performing Fourier transforms: Alternate route to quantum computing" by R. Akis and D.K. Ferry, Appl. Phys. Lett. 79, 2823 (2001). The authors reply in Appl. Phys. Lett. 80, 2420 (2002).
A heavy focus for optical quantum computing is the introduction of error-correction, and the minimisation of resource requirements. We detail a complete encoding and manipulation scheme designed for linear optics quantum computing, incorporating scalable operations and loss-tolerant architecture.
We give a survey of some of the recent progress made in deploying quantum and classical communications over a shared fiber, focusing in particular on results obtained using continuous-variable QKD.
A Survey on Quantum Machine Learning: Current Trends, Challenges, Opportunities, and the Road Ahead
eBrain Lab, Division of Engineering, New York University Abu Dhabi（eBrain实验室，工程系，纽约大学阿布扎克分校）；Center for Quantum and Topological Systems (CQTS), NYUAD Research Institute, New York University Abu Dhabi（量子与拓扑系统中心（CQTS），NYUAD研究机构，纽约大学阿布扎克分校）
We investigate the behavior of genuine multiparticle entanglement, as quantified by the generalized geometric measure, in gapless-to-gapped quantum transitions of one- and two-dimensional quantum spin models. The investigations are performed in the exactly solvable one-dimensional $XY$ models, as well as two-dimensional frustrated $J_{1}-J_{2}$ models, including the Shastry-Sutherland model. The generalized geometric measure shows non-monotonic features near such transitions in the frustrated quantum systems. We also compare the features of the generalized geometric measure near the quantum cr…
Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and intermediate-scale systems are on the horizon, capable of calculating numeric results or simulating physical systems far beyond what humans can do by hand. However, to be commercially viable, they must surpass what our wildly successful, highly advanced classical computers can already do. At the same time, those classical computers continue to advance, but those …
This is an expository talk written for the Bourbaki Seminar. After a brief introduction, Section 1 discusses in the categorical language the structure of the classical deterministic computations. Basic notions of complexity icluding the P/NP problem are reviewed. Section 2 introduces the notion of quantum parallelism and explains the main issues of quantum computing. Section 3 is devoted to four quantum subroutines: initialization, quantum computing of classical Boolean functions, quantum Fourier transform, and Grover's search algorithm. The central Section 4 explains Shor's factoring algorith…
Quantum Computing (QC) refers to an emerging paradigm that inherits and builds with the concepts and phenomena of Quantum Mechanic (QM) with the significant potential to unlock a remarkable opportunity to solve complex and computationally intractable problems that scientists could not tackle previously. In recent years, tremendous efforts and progress in QC mark a significant milestone in solving real-world problems much more efficiently than classical computing technology. While considerable progress is being made to move quantum computing in recent years, significant research efforts need to…
This is a very brief introduction to quantum computing and quantum information theory, primarily aimed at geometers. Beyond basic definitions and examples, I emphasize aspects of interest to geometers, especially connections with asymptotic representation theory. Proofs of most statements can be found in standard references.
We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our perspectives on quantum computation, we study quantum computing in one-dimensional nonrelativistic system with delta-function interaction, where the two-body scattering matrix satisfies the factorisation equation (the quantum Yang--Baxter equation) and acts as a parametric two-body quantum gate. We conclude by comparing quantum computing via the factorisable scatterin…
Quantum computing is a good way to justify difficult physics experiments. But until quantum computers are built, do computer scientists need to know anything about quantum information? In fact, quantum computing is not merely a recipe for new computing devices, but a new way of looking at the world that has been astonishingly intellectually productive. In this article, I'll talk about where quantum computing came from, what it is, and what we can learn from it.
Quantum computing represents a paradigm shift for computation requiring an entirely new computer architecture. However, there is much that can be learned from traditional classical computer engineering. In this paper, we describe the Parallel Research Kernels (PRK), a tool that was very useful for designing classical parallel computing systems. The PRK are simple kernels written to expose bottlenecks that limit classical parallel computing performance. We hypothesize that an analogous tool for quantum computing, Quantum Research Kernels (QRK), may similarly aid the co-design of software and ha…
We present a brief overview of the current theoretical and experimental progresses in the study of quantum dot-based quantum computing schemes, then focus on the spin-based varieties, which are generally regarded as the most scalable because of the relatively long coherence times of electron and nuclear spins. Reviewed topics include spin coherence, spin interaction, spin detection, and the current status of the experimental studies of spin-based quantum computing.
A new paradigm of quantum computing, namely, soft quantum computing, is proposed for nonclassical computation using real world quantum systems with naturally occurring environment-induced decoherence and dissipation. As a specific example of soft quantum computing, we suggest a quantum neural network, where the neurons connect pairwise via the "controlled Kraus operations", hoping to pave an easier and more realistic way to quantum artificial intelligence and even to better understanding certain functioning of the human brain. Our quantum neuron model mimics as much as possible the realistic n…
Notwithstanding interest and excitement building around quantum computing in the last decades, a concise statement saying where this computing can truly help is still missing. As it is shown in the present paper, equal cost of computation for truth and falsity of experimental quantum propositions (required in order to infer a conclusion from a premise) cannot be achieved with classical computing. On the other hand, this equality might be realized with quantum parallel computing provided that the efficiency of such computing can be greater than 1.
One of the biggest concerns among cybersecurity professionals these days is the hype around quantum computing, its incomprehensible power, and its implications. The advancement in quantum computing has the potential to revolutionize our daily lives, but it can also completely break down the Internet as we know it. Mathematicians and physicists have developed algorithms based on quantum computing, which can change the Internet security paradigm. This article discusses quantum computing key concepts, with a special focus on quantum Internet, quantum key distribution, and related challenges.
This paper explores the interactions between knot theory and quantum computing. On one side, knot theory has been used to create models of quantum computing, and on the other, it is a source of computational problems. Knot theory is often used to introduce topological idea to people without a formal mathematical background, and we are building on this tradition to discuss some of the deeper ideas of quantum computing.
Measurement-based quantum computing enables universal quantum computing with only adaptive single-qubit measurements on certain many-qubit states, such as the graph state, the Affleck-Kennedy-Lieb-Tasaki (AKLT) state, and several tensor-network states. Finding new resource states of measurement-based quantum computing is a hard task, since for a given state there are exponentially many possible measurement patterns on the state. In this paper, we consider the problem of deciding, for a given state and a set of unitary operators, whether there exists a way of measurement-based quantum computing…
We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation errors grow exponentially with the number of qubits in the computer while for the other the growth is polynomial. Certain similarity between classical and quantum computing errors is also discussed.
Universitá di Firenze（佛罗伦萨大学）；LENS（欧洲非线性光谱实验室）；QSTAR（QSTAR研究中心）；CNR-INO（意大利国家研究委员会国家光学研究所）
Here we will give a perspective on new possible interplays between Machine Learning and Quantum Physics, including also practical cases and applications. We will explore the ways in which machine learning could benefit from new quantum technologies and algorithms to find new ways to speed up their computations by breakthroughs in physical hardware, as well as to improve existing models or devise new learning schemes in the quantum domain. Moreover, there are lots of experiments in quantum physics that do generate incredible amounts of data and machine learning would be a great tool to analyze …
Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm. Factoring integers. NP-complete problems.
