As the first useful Quantum Computers will be quantum simulators, here the minimum number of qubits necessary for the solution of the Schroedinger equation in simple test problems is evaluated. From the present preliminary results it appears that it is possible to realize a useful quantum simulator with a register of only 10-15 qbits. The intrinsic sensitivity to some errors appears to be moderate without the need of error correcting methods. At present there is at least some indication that the amplitude errors are more dangerous than phase and decoherence errors. So corrections limited to amplitude errors may be very useful.
We introduce an error mitigation framework that mitigates errors in a quantum circuit using circuit cutting. Our framework can be implemented in polynomial time for a wide variety of quantum circuits. Our technique involves cutting the circuit in such a way that we run the circuit that needs to be executed on the quantum hardware whereas the error mitigation circuit is run on a simulator. We perform error mitigation qubit by qubit and then provide a way to combine the different probabilities from each of the individual qubit error mitigation runs such that the full circuit is error mitigated. …
We study an analog quantum simulator coupled to a reservoir with a known spectral density. The reservoir perturbs the quantum simulation by causing decoherence. The simulator is used to measure an operator average, which cannot be calculated using any classical means. Since we cannot predict the result, it is difficult to estimate the effect of the environment. Especially, it is difficult to resolve whether the perturbation is small or if the actual result of the simulation is in fact very different from the ideal system we intend to study. Here, we show that in specific systems a measurement …
We show how an experimentally realized set of operations on a single trapped ion is sufficient to simulate a wide class of Hamiltonians of a spin-1/2 particle in an external potential. This system is also able to simulate other physical dynamics. As a demonstration, we simulate the action of an $n$-th order nonlinear optical beamsplitter. Two of these beamsplitters can be used to construct an interferometer sensitive to phase shifts in one of the interferometer beam paths. The sensitivity in determining these phase shifts increases linearly with $n$, and the simulation demonstrates that the us…
Quantum performance simulators can provide practical metrics for the effectiveness of executing theoretical quantum information processing protocols on physical hardware. In this work we present a scheme to simulate the performance of fault tolerant quantum computation by automating the tracking of common fault paths for error propagation through a circuit and quantifying the fidelity of each qubit throughout the computation. Our simulation tool outputs the expected execution time, required number of qubits and the final error rate of running common fault tolerant protocols on a universal hard…
Analog quantum simulation is expected to be a significant application of near-term quantum devices. Verification of these devices without comparison to known simulation results will be an important task as the system size grows beyond the regime that can be simulated classically. We introduce a set of experimentally-motivated verification protocols for analog quantum simulators, discussing their sensitivity to a variety of error sources and their scalability to larger system sizes. We demonstrate these protocols experimentally using a two-qubit trapped-ion analog quantum simulator and numerica…
Quantum simulators are widely seen as one of the most promising near-term applications of quantum technologies. However, it remains unclear to what extent a noisy device can output reliable results in the presence of unavoidable imperfections. Here we propose a framework to characterize the performance of quantum simulators by linking the robustness of measured quantum expectation values to the spectral properties of the output observable, which in turn can be associated with its macroscopic or microscopic character. We show that, under general assumptions and on average over all states, imper…
One of the key applications for quantum computers will be the simulation of other quantum systems that arise in chemistry, materials science, etc, in order to accelerate the process of discovery. It is important to ask: Can this be achieved using near future quantum processors, of modest size and under imperfect control, or must it await the more distant era of large-scale fault-tolerant quantum computing? Here we propose a variational method involving closely integrated classical and quantum coprocessors. We presume that all operations in the quantum coprocessor are prone to error. The impact…
Let L be a language decided by a constant-round quantum Arthur-Merlin (QAM) protocol with negligible soundness error and all but possibly the last message being classical. We prove that if this protocol is zero knowledge with a black-box, quantum simulator S, then L in BQP. Our result also applies to any language having a three-round quantum interactive proof (QIP), with all but possibly the last message being classical, with negligible soundness error and a black-box quantum simulator. These results in particular make it unlikely that certain protocols can be composed in parallel in order to …
A Quantum Computer is a new type of computer which can efficiently solve complex problems such as prime factorization. A quantum computer threatens the security of public key encryption systems because these systems rely on the fact that prime factorization is computationally difficult. Errors limit the effectiveness of quantum computers. Because of the exponential nature of quantum com puters, simulating the effect of errors on them requires a vast amount of processing and memory resources. In this paper we describe a parallel simulator which accesses the feasibility of quantum computers. We …
By using quantum mechanical effects, quantum computers promise significant speedups in solving problems intractable for conventional computers. However, despite recent progress they remain limited in scaling and availability-making quantum software and hardware development heavily reliant on quantum simulators running on conventional hardware. However, most of those simulators mimic perfect quantum computers and, hence, ignore the fragile nature of quantum mechanical effects which frequently yield to decoherence errors in real quantum devices. Considering those errors during the simulation is …
We investigate the relative volume of parent Hamiltonians having a target ground state up to some fixed error $ε$, a quantity which sets a benchmark on the performance of quantum simulators. For vanishing error, this relative volume is of measure zero, whereas for a generic $ε$ we show that it increases with the dimension of the Hilbert space. We also address the volume of parent Hamiltonians when they are restricted to be local. For translationally invariant Hamiltonians, we provide an upper bound to their relative volume. Finally, we estimate numerically the relative volume of parent Hamilto…
AD-NEGF: An End-to-End Differentiable Quantum Transport Simulator for Sensitivity Analysis and Inverse Problems
Tianjin University（天津大学）；Noah’s Ark Lab, Huawei（华为诺亚方舟实验室）；University College London（伦敦大学学院）；Institute of Physics, Chinese Academy of Sciences（中国科学院物理研究所）
We use NMR quantum simulators to study antiferromagnetic Ising spin chains undergoing quantum phase transitions. Taking advantage of the sensitivity of the systems near criticality, we detect the critical points of the transitions using a direct measurement of the Loschmidt echo. We test our simulators for spin chains of even and odd numbers of spins, and compare the experimental results to theoretical predictions.
With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, the simulation methods using parallel processing are required. We have developed a general-purpose simulator for quantum computing on the parallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We have performed Shor's factoriz…
We have developed a software library that simulates noisy quantum logic circuits. We represent quantum states by their density matrices in the Pauli basis, and incorporate possible errors in initialisation, logic gates, memory and measurement using simple models. Our quantum simulator is implemented as a new backend on IBM's open-source Qiskit platform. In this document, we provide its description, and illustrate it with some simple examples.
Here we demonstrate quantum teleportation through hypergraph states, which are the generalization of graph states, and due to their non-local entanglement properties, it allows us to perform quantum teleportation. Here we design some hypergraph states useful for quantum teleportation and process the schemes for quantum teleportation of single-qubit and two-qubit arbitrary states via three-uniform three-qubit and four-qubit hypergraph states respectively. We explicate the experimental realization of quantum teleportation of both single and two-qubit arbitrary states. Then we run our quantum cir…
We demonstrate quantum many-body state reconstruction from experimental data generated by a programmable quantum simulator, by means of a neural network model incorporating known experimental errors. Specifically, we extract restricted Boltzmann machine (RBM) wavefunctions from data produced by a Rydberg quantum simulator with eight and nine atoms in a single measurement basis, and apply a novel regularization technique to mitigate the effects of measurement errors in the training data. Reconstructions of modest complexity are able to capture one- and two-body observables not accessible to exp…
Large quantum simulators, with sufficiently many qubits to be impossible to simulate classically, become hard to experimentally validate. We propose two tests of a quantum simulator with Heisenberg interaction in a linear chain of spins. In the first, we propagate half of a singlet state through a chain of spin with a ferromagnetic interaction and subsequently recover the state with an antiferromagnetic interaction. The antiferromagnetic interaction is intrinsic to the system while the ferromagnetic one can be simulated by a sequence of time-dependent controls of the antiferromagnetic interact…
The use of classical computers to simulate quantum computing has been successful in aiding the study of quantum algorithms and circuits that are too complex to examine analytically. Current implementations of quantum computing simulators are limited to two-level quantum systems. Recent advances in high-dimensional quantum computing systems have demonstrated the viability of working with multi-level superposition and entanglement. These advances allow an agile increase in the number of dimensions of the system while maintaining quantum entanglement, achieving higher encoding of information and …
Quantum-mechanical phenomena are playing an increasing role in information processing, as transistor sizes approach the nanometer level, and quantum circuits and data encoding methods appear in the securest forms of communication. Simulating such phenomena efficiently is exceedingly difficult because of the vast size of the quantum state space involved. A major complication is caused by errors (noise) due to unwanted interactions between the quantum states and the environment. Consequently, simulating quantum circuits and their associated errors using the density matrix representation is poten…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates. Additionally, we use the simulator to investigate errors based on different probability distributions and to investigate the robustness of different 2-qubit multiplier circuits in the presence of operational errors.
Quantum simulation elucidates properties of quantum many-body systems by mapping its Hamiltonian to a better-controlled system. Being less stringent than a universal quantum computer, noisy small- and intermediate-scale quantum simulators have successfully demonstrated qualitative behavior such as phase transition, localization and thermalization which are insensitive to imperfections in the engineered Hamiltonian. For more complicated features like quantum information scrambling, higher controllability will be desired to simulate both the forward and the backward time evolutions and to diagno…
Universal quantum simulation may provide insights into those many-body systems that cannot be described classically, and that cannot be efficiently simulated with current technology. The Trotter formula, which decomposes a desired unitary time evolution of the simulator into a stroboscopic sequence of repeated elementary evolutions, is a key algorithmic component which makes quantum simulation of dynamics tractable. The Trotter number $n$ sets the timescale on which a computer running this algorithm is switched from one elementary evolution to another. In the ideal case, the precision of the s…
Selective information transfer in spin ring networks by energy landscape shaping control has the property that the error 1-prob, where prob is the transfer success probability, and the sensitivity of the error to spin coupling uncertainties are statistically increasing across a family of controllers of increasing error. The need for a statistical Hypothesis Testing of a concordant trend is made necessary by the noisy behavior of the sensitivity versus the error as a consequence of the optimization of the controllers in a challenging error landscape. Here, we examine the concordant trend betwee…
Classical simulation of quantum computers will continue to play an essential role in the progress of quantum information science, both for numerical studies of quantum algorithms and for modeling noise and errors. Here we introduce the latest release of Intel Quantum Simulator (IQS), formerly known as qHiPSTER. The high-performance computing (HPC) capability of the software allows users to leverage the available hardware resources provided by supercomputers, as well as available public cloud computing infrastructure. To take advantage of the latter platform, together with the distributed simul…
In the current drive to quantum-simulate evermore complex gauge-theory phenomena, it is necessary to devise schemes allowing for the control and suppression of unavoidable gauge-breaking errors on different experimental platforms. Although there have been several successful approaches to tackle coherent errors, comparatively little has been done in the way of decoherence. By numerically solving the corresponding Bloch--Redfield equations, we show that the recently developed method of \textit{linear gauge protection} suppresses the growth of gauge violations due to $1/f^β$ noise as $1/V^β$, whe…
The sensitivity of classical and quantum sensing is impaired in a noisy environment. Thus, one of the main challenges facing sensing protocols is to reduce the noise while preserving the signal. State of the art quantum sensing protocols that rely on dynamical decoupling achieve this goal under the restriction of long noise correlation times. We implement a proof-of-principle experiment of a protocol to recover sensitivity by using an error correction for photonic systems that does not have this restriction. The protocol uses a protected entangled qubit to correct a single error. Our results s…
Despite the pristine abilities of analog quantum simulators to study quantum dynamics, possibilities to detect currents are sparse. Here, we propose a flexible non-invasive technique to measure currents in quantum many-body systems by weakly coupling the system to an ancilla, followed by a measurement of the ancilla population. We numerically benchmark the scheme at the example of interacting bosons in a Harper-Hofstadter optical-lattice ladder, and discuss potential experimental error sources. The highly flexible protocol can be used with both hard-core and soft-core bosons as well as fermion…
Spinor Bose-Einstein condensate as an analog simulator of molecular bending vibrations
Universitat Autònoma de Barcelona（巴塞罗那自治大学）；ICFO - Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology（ICFO-光子科学研究所，巴塞罗那科学技术研究院）；Universitat de València-CSIC（瓦伦西亚大学-CSIC）
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular $S$ and $T$ matrices. In particular, we employ a nuclear magnetic resonance quantum simulator to study the properties of three topologically ordered matter phases described by the string-net mo…
Nascent platforms for programmable quantum simulation offer unprecedented access to new regimes of far-from-equilibrium quantum many-body dynamics in (approximately) isolated systems. Here, achieving precise control over quantum many-body entanglement is an essential task for quantum sensing and computation. Extensive theoretical work suggests that these capabilities can enable dynamical phases and critical phenomena that exhibit topologically-robust methods to create, protect, and manipulate quantum entanglement that self-correct against large classes of errors. However, to date, experimental…
