Lloyd has considered the ultimate limitations physics places on quantum computers. He concludes in particular that for an ``ultimate laptop'' (a computer of one liter of volume and one kilogram of mass) the maximum number of operations per second is bounded by $10^{51}$. The limit is derived considering ordinary quantum mechanics. Here we consider additional limits that are placed by quantum gravity ideas, namely the use of a relational notion of time and fundamental gravitational limits that exist on time measurements. We then particularize for the case of an ultimate laptop and show that the maximum number of operations is further constrained to $10^{47}$ per second.
We discuss the potential and limitations of Gaussian cluster states for measurement-based quantum computing. Using a framework of Gaussian projected entangled pair states (GPEPS), we show that no matter what Gaussian local measurements are performed on systems distributed on a general graph, transport and processing of quantum information is not possible beyond a certain influence region, except for exponentially suppressed corrections. We also demonstrate that even under arbitrary non-Gaussian local measurements, slabs of Gaussian cluster states of a finite width cannot carry logical quantum …
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in current experiments, physical resource limitations like energy, volume or available bandwidth induce error rates that typically grow as the computer grows. Taking into account these constraints, we show that the amount of error correction can be opti- mized, leading to a maximum attainable computational accuracy. We find this maximum for generic situations where n…
A quantitative extension of the Wigner-Araki-Yanase theorem is obtained on the limitation on precise, non-disturbing measurements of observables which do not commute with additive conserved quantities, and applied to obtaining a limitation on the accuracy of quantum computing with computational bases which do not commute with angular momentum.
Hybrid adiabatic quantum computing for tomographic image reconstruction -- opportunities and limitations
Friedrich-Alexander Universität Erlangen-Nürnberg（埃尔朗根-纽伦堡弗里德里希-亚历山大大学）；Siemens Healthineers GmbH（西门子医疗有限公司）；Siemens Medical Solutions USA, Inc（美国西门子医疗解决方案公司）
Digital quantum computers provide a computational framework for solving the Schrödinger equation for a variety of many-particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed remarkable growth, notwithstanding the limitations of existing quantum hardware, especially as a tool for electronic structure computations in molecules. In this review, we provide a self-contained introduction to emerging algorithms for the simulation of Hamiltonian dynamics and eigenstates, with emphasis on their applications to the electronic structure in molec…
While adiabatic quantum computation (AQC) possesses some intrinsic robustness to noise, it is expected that a form of error control will be necessary for large scale computations. Error control ideas developed for circuit-model quantum computation do not transfer easily to the AQC model and to date there have been two main proposals to suppress errors during an AQC implementation: energy gap protection and dynamical decoupling. Here we show that these two methods are fundamentally related and may be analyzed within the same formalism. We analyze the effectiveness of such error suppression tech…
Autonomous Quantum Processing Unit: An Autonomous Thermal Computing Machine & its Physical Limitations
Atominstitut, TU Wien（维也纳工业大学原子研究所）；Vienna Center for Quantum Science and Technology, TU Wien（维也纳量子科学与技术中心）；Institute for Quantum Optics and Quantum Information (IQOQI), Austrian Academy of Sciences（奥地利科学院量子光学与量子信息研究所）
Secure delegated quantum computing allows a computationally weak client to outsource an arbitrary quantum computation to an untrusted quantum server in a privacy-preserving manner. One of the promising candidates to achieve classical delegation of quantum computation is classical-client remote state preparation ($RSP_{CC}$), where a client remotely prepares a quantum state using a classical channel. However, the privacy loss incurred by employing $RSP_{CC}$ as a sub-module is unclear. In this work, we investigate this question using the Constructive Cryptography framework by Maurer and Renner …
We present strictly efficient schemes for scalable measurement-based quantum computing using continuous-variable systems: These schemes are based on suitable non-Gaussian resource states, ones that can be prepared using interactions of light with matter systems or even purely optically. Merely Gaussian measurements such as optical homodyning as well as photon counting measurements are required, on individual sites. These schemes overcome limitations posed by Gaussian cluster states, which are known not to be universal for quantum computations of unbounded length, unless one is willing to scale…
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…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction (current techniques cannot correct all small errors). The initial state in the circuit model computation is obtained by applying potentially imprecise Hadamard gate operations whereas useful quantum computation requires a state with no uncertainty. We review some limitations of the circuit model and speculate on the question if a hierarchy of quantum-type co…
As we enter the era of useful quantum computers we need to better understand the limitations of classical support hardware, and develop mitigation techniques to ensure effective qubit utilisation. In this paper we discuss three key bottlenecks in near-term quantum computers: bandwidth restrictions arising from data transfer between central processing units (CPUs) and quantum processing units (QPUs), latency delays in the hardware for round-trip communication, and timing restrictions driven by high error rates. In each case we consider a near-term quantum algorithm to highlight the bottleneck: …
Reliable AI: Does the Next Generation Require Quantum Computing?
Ludwig-Maximilians-Universität München（慕尼黑大学）；Technical University of Munich（慕尼黑工业大学）；Munich Center for Quantum Science and Technology（慕尼黑量子科学与技术中心）；Munich Center for Machine Learning（慕尼黑机器学习中心）
Conservation laws limit the accuracy of physical implementations of elementary quantum logic gates. If the computational basis is represented by a component of spin and physical implementations obey the angular momentum conservation law, any physically realizable unitary operators with size less than n qubits cannot implement the controlled-NOT gate within the error probability 1/(4n^2), where the size is defined as the total number of the computational qubits and the ancilla qubits. An analogous limit for bosonic ancillae is also obtained to show that the lower bound of the error probability …
The point of building a quantum computer is that it allows to model living things with predictive power and gives the opportunity to control life. Its scaling means not just the improvement of the instrument part, but also, mainly, mathematical and software tools, and our understanding of the QC problem. The first principle of quantum modeling is the reduction of reality to finite-dimensional models similar to QED in optical cavities. The second principle is a strict limitation of the so-called Feynman principle, the number of qubits in the standard formulation of the QC. This means treating d…
