Machine learning in quantum computing and communication provides intensive opportunities for revolutionizing the field of Physics, Mathematics, and Computer Science. There exists an aperture of understanding behind this interdisciplinary domain and a lack of core understanding renders an opportunity to explore the machine learning techniques for this domain. This paper gives a comprehensive review of state-of-the-art approaches in quantum computing and quantum communication in the context of Artificial Intelligence and machine learning models. The paper reviews the classical ML models that have been employed in various ways for quantum computation such as quantum error correction, quantum communication, quantum cryptography, and mapping quantum algorithms to the existing hardware. The paper also illustrates how the relevant current challenges can be transformed into future research avenues.
As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy: there exist pairs of discrete memoryless quantum channels, each of zero quantum capacity, which acquire positive quantum capacity when used together. Here we show that this "superactivation" phenomenon also occurs in the more realistic setting of optical channels with attenuation and Gaussian noise. This paves the way for its experimental realization and applic…
To resist decoherence from destroying the phase factor of qubit state, it is important to use decoherence-free states for processing, transmitting and storing quantum information in quantum computing and quantum communication. We propose a practical scheme using four atoms with decoherence-free states in a single-mode cavity to realize the entanglement and fundamental quantum logic gates. The transmission of quantum information can be made directly from one atom to another, in which the cavity is only virtually excited. The possible application and the experimental requirement of our proposal …
A workshop sponsored by NSF C-CR and organized by the Center for Discrete Math and Theoretical Computer Science (DIMACS) was held at Elmsford, New York, January 17-18, 2002 where we had several discussions that gave structure to this report. The workshop immediately followed the Fifth Annual Quantum Information Processing Workshop that was held January 14-17 at IBM Yorktown. This is the report from that workshop. The report recommends that the NSF Division of Computer-Communications Research (C-CR) develop a new initiative in "Theory of Quantum Computing and Communication" and describes severa…
We present an iterative algorithm that finds the optimal measurement for extracting the accessible information in any quantum communication scenario. The maximization is achieved by a steepest-ascent approach toward the extremal point, following the gradient uphill in sufficiently small steps. We apply it to a simple ad-hoc example, as well as to a problem with a bearing on the security of a tomographic protocol for quantum key distribution.
In the absence of any efficient classical schemes for verifying a universal quantum computer, the importance of limiting the required quantum resources for this task has been highlighted recently. Currently, most of efficient quantum verification protocols are based on cryptographic techniques where an almost classical verifier executes her desired encrypted quantum computation remotely on an untrusted quantum prover. In this work we present a new protocol for quantum verification by incorporating existing techniques in a non-standard composition to reduce the required quantum communications b…
In the model of quantum cloud computing, the server executes a computation on the quantum data provided by the client. In this scenario, it is important to reduce the amount of quantum communication between the client and the server. A possible approach is to transform the desired computation into a compressed version that acts on a smaller number of qubits, thereby reducing the amount of data exchanged between the client and the server. Here we propose quantum autoencoders for quantum gates (QAEGate) as a method for compressing quantum computations. We illustrate it in concrete scenarios of s…
On the Impact of Classical and Quantum Communication Networks Upon Modular Quantum Computing Architecture System Performance
Universitat Politècnica de Catalunya（加泰罗尼亚理工大学）；Delft University of Technology（代尔夫特理工大学）；Ecole Polytechnique Fédérale de Lausanne（洛桑联邦理工学院）；University of Siegen（锡根大学）；University of Catania（卡塔尼亚大学）；Equal1 Labs（Equal1实验室）；University College Dublin（都柏林大学学院）；Barcelona Supercomputing Center（巴塞罗那超级计算中心）；Qilimanjaro Quantum Tech（基利马扎罗量子技术）；Universitat Politècnica de València（瓦伦西亚理工大学）
In the context of NISQ computers - Noise Intermediate Scale Quantum, it is a consensus that the distribution of circuits among processing agents is a viable approach to get greater scalability with small machines. This approach can increase the combined computational power at the cost of dedicating qubits to get the communication between partitions. Then comes the challenge of reducing this cost of communication-based on efficient circuit partitioning strategies. In this context, this work aims to reduce the consumption of communication qubits generated during the physical partitioning of quan…
Recently, we have shown that for conditions under which the so-called light-shift imbalance induced blockade (LSIIB) occurs, the collective excitation of an ensemble of a multi-level atom can be treated as a closed two level system. In this paper, we describe how such a system can be used as a quantum bit (qubit) for quantum communication and quantum computing. Specifically, we show how to realize a C-NOT gate using the collective qubit and an easily accessible ring cavity, via an extension of the so-called Pellizzari scheme. We also describe how multiple, small-scale quantum computers realize…
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite of no-signaling, we obtain that non-local quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show …
Quantum computing architectures rely on classical electronics for control and readout. Employing classical electronics in a feedback loop with the quantum system allows to stabilize states, correct errors and to realize specific feedforward-based quantum computing and communication schemes such as deterministic quantum teleportation. These feedback and feedforward operations are required to be fast compared to the coherence time of the quantum system to minimize the probability of errors. We present a field programmable gate array (FPGA) based digital signal processing system capable of real-t…
In this invited paper, the authors discuss the exponential computing speed-up achievable by interconnecting quantum computers through a quantum internet. They also identify key future research challenges and open problems for quantum internet design and deployment.
We introduce the concept of directional coupling, i.e., the selective transfer of a state between adjacent quantum wires, in the context of quantum computing and short-distance communication. Our analysis rests upon a mathematical analogy between a dual-channel directional coupler and a composite spin system.
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing and quantum communication, will be possible. We review our proposed spin-quantum dot architecture for a quantum computer and review some recent results on a deterministic source of entanglement generated by coupling quantum dots. Addressing the feasibility of quantum communication with entangled electrons we consider a scattering set-up with an entangler and beam splitter where the current noise exhibits bunching behavior for …
German Research Center for Artificial Intelligence GmbH (DFKI)（德国人工智能研究中心）；University of Applied Sciences Zittau/Görlitz（齐陶/格利茨应用科学大学）；Fraunhofer Institute of Optronics, System Technologies and Image Exploitation - Advanced System Technology (IOSB-AST)（弗劳恩霍夫光学技术、系统技术和图像利用研究所 - 先进系统技术分部）；Forschungszentrum Juelich GmbH (FZJ)（于利希研究中心）
In this paper, we show recent results indicating that using electrical noise as information carrier offers outstanding potentials reminding of quantum informatics. One example is noise-based computing and logic that shows certain similarities to quantum logic. However, due to the lack of the collapse of wavefunction and due to the immediate accessibility of superposition components, the use of noise-based and quantum computers will probably be different. Another example is secure communications where, out of the unconditional security at idealistic situations, a practical security beyond known…
The noisy and lengthy nature of quantum communication hinders the development of distributed quantum computing. The inefficient design of existing compilers for distributed quantum computing worsens the situation. Previous compilation frameworks couple communication hardware with the implementation of expensive remote gates. However, we discover that the efficiency of quantum communication, especially collective communication, can be significantly boosted by decoupling communication resources from remote operations, that is, the communication hardware would be used only for preparing remote en…
A two-party quantum communication process with classical inputs and outcomes can be simulated by replacing the quantum channel with a classical one. The minimal amount of classical communication required to reproduce the statistics of the quantum process is called its communication complexity. In the case of many instances simulated in parallel, the minimal communication cost per instance is called the asymptotic communication complexity. Previously, we reduced the computation of the asymptotic communication complexity to a convex minimization problem. In most cases, the objective function doe…
