Methods for Classically Simulating Noisy Networked Quantum Architectures
arXiv:1803.04167 · doi:10.1088/2058-9565/ab54a4
Abstract
As research on building scalable quantum computers advances, it is important to be able to certify their correctness. Due to the exponential hardness of classically simulating quantum computation, straight-forward verification through classical simulation fails. However, we can classically simulate small scale quantum computations and hence we are able to test that devices behave as expected in this domain. This constitutes the first step towards obtaining confidence in the anticipated quantum-advantage when we extend to scales which can no longer be simulated. Realistic devices have restrictions due to their architecture and limitations due to physical imperfections and noise. Here we extend the usual ideal simulations by considering those effects. We provide a general methodology for constructing realistic simulations emulating the physical system which will both provide a benchmark for realistic devices, and guide experimental research in the quest for quantum-advantage. We exemplify our methodology by simulating a networked architecture and corresponding noise-model; in particular that of the device developed in the Networked Quantum Information Technologies Hub (NQIT). For our simulations we use, with suitable modification, the classical simulator of of Bravyi and Gosset. The specific problems considered belong to the class of Instantaneous Quantum Polynomial-time (IQP) problems, a class believed to be hard for classical computing devices, and to be a promising candidate for the first demonstration of quantum-advantage. We first consider a subclass of IQP, defined by Bermejo-Vega et al, involving two-dimensional dynamical quantum simulators, before moving to more general instances of IQP, but which are still restricted to the architecture of NQIT.
arXiv comment55 pages, 16 figures
References in corpus (72)
- Quantum Computing in the NISQ era and beyond
- Concentrating Partial Entanglement by Local Operations
- Efficient classical simulation of slightly entangled quantum computations
- Measurement-based quantum computation with cluster states
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Quantum Error Correction for Quantum Memories
- Trapped-Ion Quantum Computing: Progress and Challenges
- Characterizing Quantum Supremacy in Near-Term Devices
- Quantum algorithms: an overview
- Randomized Benchmarking of Quantum Gates
- Reliable Quantum Computers
- On the Power of One Bit of Quantum Information
- Quantum Computational Supremacy
- Validating quantum computers using randomized model circuits
- Roads towards fault-tolerant universal quantum computation
- Scalable Noise Estimation with Random Unitary Operators
- Direct Fidelity Estimation from Few Pauli Measurements
- Positive Wigner functions render classical simulation of quantum computation efficient
- Efficient Classical Simulation of Continuous Variable Quantum Information Processes
- ProjectQ: An Open Source Software Framework for Quantum Computing
- A fault-tolerant one-way quantum computer
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Negative Quasi-Probability as a Resource for Quantum Computation
- Methodology for quantum logic gate constructions
- QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
- Improved classical simulation of quantum circuits dominated by Clifford gates
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
- Average-case complexity versus approximate simulation of commuting quantum computations
- Unconditionally verifiable blind computation
- QuEST and High Performance Simulation of Quantum Computers
- Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
- Efficient Distributed Quantum Computing
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- Achieving quantum supremacy with sparse and noisy commuting quantum computations
- No imminent quantum supremacy by boson sampling
- Instantaneous Quantum Computation
- Fast simulation of stabilizer circuits using a graph state representation
- Verification of quantum computation: An overview of existing approaches
- Exact synthesis of multiqubit Clifford+T circuits
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Overview and Comparison of Gate Level Quantum Software Platforms
- Asymptotically optimal approximation of single qubit unitaries by Clifford and T circuits using a constant number of ancillary qubits
- Parallelizing Quantum Circuits
- Robustness and device independence of verifiable blind quantum computing
- SimulaQron - A simulator for developing quantum internet software
- Architectures for quantum simulation showing a quantum speedup
- On the hardness of classically simulating the one clean qubit model
- Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
- Post hoc verification of quantum computation
- Post hoc verification with a single prover
- Direct certification of a class of quantum simulations
- On the qubit routing problem
- Completeness of the classical 2D Ising model and universal quantum computation
- Scalar Quantum Field Theories as a Benchmark for Near-Term Quantum Computers
- How to Verify a Quantum Computation
- Quantum++: A modern C++ quantum computing library
- Quantum interference as a resource for quantum speedup
- Modeling quantum noise for efficient testing of fault-tolerant circuits
- Minimally complex ion traps as modules for quantum communication and computing
- Circuit Transformations for Quantum Architectures
- qTorch: The Quantum Tensor Contraction Handler
- Unbiased Simulation of Near-Clifford Quantum Circuits
- Quantum circuits for maximally entangled states
- Comparison of a quantum error correction threshold for exact and approximate errors
- Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models
- Measurement-based classical computation
- Optimization of Lattice Surgery is NP-Hard
- QEngine: An open-source C++ Library for Quantum Optimal Control of Ultracold Atoms
- An introduction to boson-sampling
- Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation (Extended Abstract)
- Information Theoretically Secure Hypothesis Test for Temporally Unstructured Quantum Computation