Quantum Computational Supremacy

Abstract

The field of quantum algorithms aims to find ways to speed up the solution of computational problems by using a quantum computer. A key milestone in this field will be when a universal quantum computer performs a computational task that is beyond the capability of any classical computer, an event known as quantum supremacy. This would be easier to achieve experimentally than full-scale quantum computing, but involves new theoretical challenges. Here we present the leading proposals to achieve quantum supremacy, and discuss how we can reliably compare the power of a classical computer to the power of a quantum computer.

arXiv commentreview article originally appearing in a Nature Insight collection on "Quantum Software". 15 pages

References in corpus (37)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Simulation
• Improved Simulation of Stabilizer Circuits
• Quantum Computing with Very Noisy Devices
• Characterizing Quantum Supremacy in Near-Term Devices
• Universal Linear Optics
• Boson Sampling on a Photonic Chip
• Experimental Boson Sampling
• Experimental boson sampling in arbitrary integrated photonic circuits
• Photonic Boson Sampling in a Tunable Circuit
• Quantum Computation by Adiabatic Evolution
• Simulating quantum computation by contracting tensor networks
• Universal blind quantum computation
• Observation of Spatial Charge and Spin Correlations in the 2D Fermi-Hubbard Model
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Efficient experimental validation of photonic boson sampling against the uniform distribution
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• Experimental Scattershot Boson Sampling
• On the experimental verification of quantum complexity in linear optics
• Achieving quantum supremacy with sparse and noisy commuting quantum computations
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Quantum Sampling Problems, BosonSampling and Quantum Supremacy
• Instantaneous Quantum Computation
• Quantum computing and the entanglement frontier
• Sufficient Conditions for Efficient Classical Simulation of Quantum Optics
• Stringent and efficient assessment of Boson-Sampling devices
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• On the hardness of classically simulating the one clean qubit model
• Quantum Supremacy for Simulating A Translation-Invariant Ising Spin Model
• General rules for bosonic bunching in multimode interferometers
• Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
• Gaussian Noise Sensitivity and BosonSampling
• Retrieving the ground state of spin glasses using thermal noise: Performance of quantum annealing at finite temperatures
• Multi-photon boson-sampling machines beating early classical computers
• Threshold values of Random K-SAT from the cavity method
• Computational quantum-classical boundary of complex and noisy quantum systems

Cited by in corpus (347)

• Quantum Computing in the NISQ era and beyond
• Quantum computational advantage using photons
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum computational chemistry
• Superconducting Qubits: Current State of Play
• Integrated Photonic Quantum Technologies
• Trapped-Ion Quantum Computing: Progress and Challenges
• Parameterized quantum circuits as machine learning models
• Circuit-centric quantum classifiers
• Power of data in quantum machine learning
• Photonic quantum information processing: a review
• Toward the first quantum simulation with quantum speedup
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Random Quantum Circuits
• Theory of variational quantum simulation
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Transfer learning in hybrid classical-quantum neural networks
• Superconducting Quantum Computing: A Review
• A generative modeling approach for benchmarking and training shallow quantum circuits
• The Expressive Power of Parameterized Quantum Circuits
• Hybrid Quantum-Classical Convolutional Neural Networks
• Variational Quantum Monte Carlo Method with a Neural-Network Ansatz for Open Quantum Systems
• Towards real-world quantum networks: a review
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Microscopic control and detection of ultracold strontium in optical-tweezer arrays
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Variational Quantum State Diagonalization
• Quantum dots for photonic quantum information technology
• Onset of Random Matrix Behavior in Scrambling Systems
• Quantum generative adversarial learning in a superconducting quantum circuit
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Efficient classical simulation of random shallow 2D quantum circuits
• Gaussian Boson Sampling with Pseudo-Photon-Number Resolving Detectors and Quantum Computational Advantage
• Computational advantage of quantum random sampling
• Measuring the Capabilities of Quantum Computers
• IBM Quantum Computers: Evolution, Performance, and Future Directions
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Toward Scalable Boson Sampling with Photon Loss
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates
• Gaussian Boson Sampling using threshold detectors
• Efficient measure for the expressivity of variational quantum algorithms
• Measurement reduction in variational quantum algorithms
• Deep Reinforcement Learning for Quantum Gate Control
• Learning Robust and High-Precision Quantum Controls
• Quantum computing models for artificial neural networks
• Nishimori's cat: stable long-range entanglement from finite-depth unitaries and weak measurements
• Variational Quantum Reinforcement Learning via Evolutionary Optimization
• Predicting Research Trends with Semantic and Neural Networks with an application in Quantum Physics
• Gaussian Boson Sampling for perfect matchings of arbitrary graphs
• Quantum Machine Learning: from physics to software engineering
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Quantum Chaos is Quantum
• Quantum Indistinguishability by Path Identity: The awakening of a sleeping beauty
• Variational Quantum Unsampling on a Quantum Photonic Processor
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Scalable High-Performance Fluxonium Quantum Processor
• Regimes of classical simulability for noisy Gaussian boson sampling
• Calculation of the Green's function on near-term quantum computers
• Natural quantum reservoir computing for temporal information processing
• Enhancing Generative Models via Quantum Correlations
• Experimental statistical signature of many-body quantum interference
• Classical simulation of photonic linear optics with lost particles
• An end-to-end trainable hybrid classical-quantum classifier
• Quantum Assisted Simulator
• Neural-Network Decoders for Quantum Error Correction using Surface Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs
• Learning hard quantum distributions with variational autoencoders
• Nonstabilizerness via matrix product states in the Pauli basis
• How many qubits are needed for quantum computational supremacy?
• Experimental Gaussian Boson Sampling
• NISQ Computers: A Path to Quantum Supremacy
• Cryogenic operation of silicon photonic modulators based on DC Kerr effect
• Hamiltonian Simulation Algorithms for Near-Term Quantum Hardware
• Genome assembly using quantum and quantum-inspired annealing
• Resources for bosonic quantum computational advantage
• Demonstration of algorithmic quantum speedup
• Quantum approximate optimization with Gaussian boson sampling
• On the statistical complexity of quantum circuits
• Quantum advantages for Pauli channel estimation
• Dielectrics for Two-Dimensional Transition Metal Dichalcogenide Applications
• Iterative Quantum Assisted Eigensolver
• Simulating periodic systems on quantum computer
• Training Optimization for Gate-Model Quantum Neural Networks
• Tight bounds on the convergence of noisy random circuits to the uniform distribution
• Boundaries of quantum supremacy via random circuit sampling
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Classically-Verifiable Quantum Advantage from a Computational Bell Test
• Dynamical phase transitions in sampling complexity
• Reconfigurable continuously-coupled 3D photonic circuit for Boson Sampling experiments
• Complexity of frustration: a new source of non-local non-stabilizerness
• A quantum enhanced finite-time Otto cycle
• Efficient classical simulation of Clifford circuits with nonstabilizer input states
• ON states as resource units for universal quantum computation with photonic architectures
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• Neuromorphic scaling advantages for energy-efficient random walk computation
• Franck-Condon factors by counting perfect matchings of graphs with loops
• Variational Quantum Algorithm for Non-equilibrium Steady States
• Fermion Sampling: a robust quantum computational advantage scheme using fermionic linear optics and magic input states
• Critical behaviors of non-stabilizerness in quantum spin chains
• Application-Motivated, Holistic Benchmarking of a Full Quantum Computing Stack
• Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
• Witnessing genuine multi-photon indistinguishability
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Expressibility and trainability of parameterized analog quantum systems for machine learning applications
• Tensor network states in time-bin quantum optics
• Trainability barriers and opportunities in quantum generative modeling
• Optimizing High-Efficiency Quantum Memory with Quantum Machine Learning for Near-Term Quantum Devices
• Neural-network states for the classical simulation of quantum computing
• Magic in generalized Rokhsar-Kivelson wavefunctions
• Classical simulation of linear optics subject to nonuniform losses
• Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
• Dissipation as a resource for Quantum Reservoir Computing
• Transitions in Entanglement Complexity in Random Circuits
• Quantum Adiabatic Algorithm Design using Reinforcement Learning
• Anti-Zeno quantum advantage in fast-driven heat machines
• Measurement-Driven Phase Transition within a Volume-Law Entangled Phase
• Time-resolved boson sampling with photons of different colors
• Quantum Experiments and Hypergraphs: Multi-Photon Sources for Quantum Interference, Quantum Computation and Quantum Entanglement
• Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
• Quantum Architecture Search via Deep Reinforcement Learning
• Hybrid Quantum Investment Optimization with Minimal Holding Period
• Fast estimation of outcome probabilities for quantum circuits
• Efficient verification of Boson Sampling
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Quantum Differentially Private Sparse Regression Learning
• Simulability of Imperfect Gaussian and Superposition Boson Sampling
• Quantum State Optimization and Computational Pathway Evaluation for Gate-Model Quantum Computers
• Classically simulating near-term partially-distinguishable and lossy boson sampling
• Entanglement Accessibility Measures for the Quantum Internet
• Generalized Quantum Assisted Simulator
• Protecting Expressive Circuits with a Quantum Error Detection Code
• Dense Quantum Measurement Theory
• An adaptive algorithm for quantum circuit simulation
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
• Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
• Verifying commuting quantum computations via fidelity estimation of weighted graph states
• Quantum criticality using a superconducting quantum processor
• Quantum Circuit Design for Objective Function Maximization in Gate-Model Quantum Computers
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Robust Majorana magic gates via measurements
• Generating Haar-uniform Randomness using Stochastic Quantum Walks on a Photonic Chip
• Efficient classical simulation of noisy quantum computation
• Remote blind state preparation with weak coherent pulses in the field
• Automatically Differentiable Quantum Circuit for Many-qubit State Preparation
• Quantum computational supremacy in the sampling of bosonic random walkers on a one-dimensional lattice
• Holomorphic representation of quantum computations
• Interactive Protocols for Classically-Verifiable Quantum Advantage
• Experimental demonstration of quantum advantage for one-way communication complexity
• Hybrid Quantum-Classical Graph Convolutional Network
• Information processing at the speed of light
• Predicting excited states from ground state wavefunction by supervised quantum machine learning
• Non-linear Boson Sampling
• Quantum simulation of partially distinguishable boson sampling
• Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer
• Surpassing the Classical Limit in Magic Square Game with Distant Quantum Dots Coupled to Optical Cavities
• Implementing quantum algorithms on temporal photonic cluster states
• Quantum Dropout: On and Over the Hardness of Quantum Approximate Optimization Algorithm
• Qurzon: A Prototype for a Divide and Conquer Based Quantum Compiler
• Nonequilibrium dynamics in deconfined quantum critical point revealed by imaginary-time evolution
• Networked Quantum Services
• The Landscape of Academic Literature in Quantum Technologies
• Quantum Non-Local Nonstabilizerness
• A chip-scale polarization-spatial-momentum quantum SWAP gate in silicon nanophotonics
• Classical models may be a better explanation of the Jiuzhang 1.0 Gaussian Boson Sampler than its targeted squeezed light model
• Neural Quantum Embedding: Pushing the Limits of Quantum Supervised Learning
• Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features
• Quantum Schur Sampling Circuits can be Strongly Simulated
• Conditionally rigorous mitigation of multiqubit measurement errors
• Analytic Filter Function Derivatives for Quantum Optimal Control
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• Classical simulation of quantum circuits by half Gauss sums
• Simulating the Dynamics of Single Photons in BosonSampling Devices with Matrix Product States
• A Quantum N-Queens Solver
• Depth-efficient proofs of quantumness
• Highly efficient phase-tunable photonic thermal diode
• Mitigating errors by quantum verification and post-selection
• Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
• Quantum Convolutional Neural Network: A Hybrid Quantum-Classical Approach for Iris Dataset Classification
• Signatures of Many-Particle Interference
• Theory of Ergodic Quantum Processes
• Witnesses of coherence and dimension from multiphoton indistinguishability tests
• Theory of Noise-Scaled Stability Bounds and Entanglement Rate Maximization in the Quantum Internet
• A robust W-state encoding for linear quantum optics
• Optimizing spontaneous parametric down-conversion sources for boson sampling
• Digital quantum simulation of linear and nonlinear optical elements
• Volumetric Benchmarking of Error Mitigation with Qermit
• Decoherence of up to 8-qubit entangled states in a 16-qubit superconducting quantum processor
• Clifford recompilation for faster classical simulation of quantum circuits
• Quantum Advantage for the LOCAL Model in Distributed Computing
• Local disclosure of quantum memory in non-Markovian dynamics
• Efficient unitary paths and quantum computational supremacy: A proof of average-case hardness of Random Circuit Sampling
• Observation of exceptional point in a PT broken non-Hermitian system simulated using a quantum circuit
• Quantum verification of NP problems with single photons and linear optics
• Nonadaptive fault-tolerant verification of quantum supremacy with noise
• Controlling chaos in the quantum regime using adaptive measurements
• An Experimental Quantum Bernoulli Factory
• The principle of majorization: application to random quantum circuits
• Magic phase transition and non-local complexity in generalized $W$ State
• Postselected quantum hypothesis testing
• Modular Quantum-to-Quantum Bernoulli Factory in an Integrated Photonic Processor
• State Stabilization for Gate-Model Quantum Computers
• Polynomial scaling enhancement in ground-state preparation of Ising spin models via counter-diabatic driving
• Spin-chain-star systems: entangling multiple chains of spin qubits
• Advantage of Quantum Theory Over Non-classical Models of Communication
• Magic transition in measurement-only circuits
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• Correlation Measure Equivalence in Dynamic Causal Structures of Quantum Gravity
• A tensor network discriminator architecture for classification of quantum data on quantum computers
• Digital quantum simulation of beam splitters and squeezing with IBM quantum computers
• Minimal informationally complete measurements for probability representation of quantum dynamics
• Timestamp Boson Sampling
• Fiber Loop Quantum Buffer for Photonic Qubits
• Quantum supremacy and quantum phase transitions
• Generalized binomial state: Nonclassical features observed through various witnesses and a measure of nonclassicality
• Interplay of entanglement structures and stabilizer entropy in spin models
• The pair-flip model: a very entangled translationally invariant spin chain
• Cross-verification of independent quantum devices
• Certification of Gaussian Boson Sampling via graph theory
• Parametric Probabilistic Quantum Memory
• Improved Simulation of Quantum Circuits by Fewer Gaussian Eliminations
• Sufficient condition for universal quantum computation using bosonic circuits
• Quantum supremacy of the many-body fluctuations in the occupations of the excited particle states in a Bose-Einstein-condensed gas
• Theory of Quantum Gravity Information Processing
• Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight
• Symmetry Protected Quantum Computation
• Protocols for Trainable and Differentiable Quantum Generative Modelling
• Quantifying Quantum Computational Advantage on a Processor of Ultracold Atoms
• A quantum information theoretic analysis of reinforcement learning-assisted quantum architecture search
• Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
• Self-Adaptive Quantum Kernel Principal Components Analysis for Compact Readout of Chemiresistive Sensor Arrays
• The dilemma of quantum neural networks
• Entanglement and complexity of interacting qubits subject to asymmetric noise
• Variational certification of quantum devices
• Unextendible entangled bases and more nonlocality with less entanglement
• Faster Born probability estimation via gate merging and frame optimisation
• Fault-tolerant quantum speedup from constant depth quantum circuits
• A game of quantum advantage: linking verification and simulation
• Sample-efficient benchmarking of multi-photon interference on a boson sampler in the sparse regime
• Entanglement Scaling in Quantum Advantage Benchmarks
• Exact recursive calculation of circulant permanents: A band of different diagonals inside a uniform matrix
• Fidelity-dissipation relations in quantum gates
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• The Wave-Particle Duality in a Quantum Heat Engine
• Calculable lower bounds on the efficiency of universal sets of quantum gates
• Surface Code Design for Asymmetric Error Channels
• Higher-Order Nonclassicality in Photon Added and Subtracted Qudit States
• Quantum supremacy in driven quantum many-body systems
• Quantum advantage from energy measurements of many-body quantum systems
• Hierarchy of quantum operations in manipulating coherence and entanglement
• A variational quantum algorithm for tackling multi-dimensional Poisson equations with inhomogeneous boundary conditions
• Framework for Learning and Control in the Classical and Quantum Domains
• Efficient and quantum-adaptive machine learning with fermion neural networks
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation
• Navigating the noise-depth tradeoff in adiabatic quantum circuits
• The Inductive Bias of Quantum Kernels
• Forging quantum data: classically defeating an IQP-based quantum test
• Coherence Fraction in Grover Search Algorithm
• Higher-order nonclassical properties of a shifted symmetric cat state and a one-dimensional continuous superposition of coherent states
• In situ characterization of linear-optical networks in randomized boson sampling
• An Exact Link between Nonlocal Nonstabilizerness and Operator Entanglement
• Locality and entanglement of indistinguishable particles
• The superconducting circuit companion -- an introduction with worked examples
• Experimental linear optical computing of the matrix permanent
• Action in Hamiltonian Models Constructed by Yang-Baxter Equation: Entanglement and Measures of Correlation
• A New Fast Computation of a Permanent
• Quasidistribution of phases in Raman process with weak and strong pumps
• Distinguishing Phases via Non-Markovian Dynamics of Entanglement in Topological Quantum Codes under Parallel Magnetic Field
• Non-Randomness of Google's Quantum Supremacy Benchmark
• On-demand continuous-variable quantum entanglement source for integrated circuits
• The Hadamard gate cannot be replaced by a resource state in universal quantum computation
• Quantum Computing for Data Centric Engineering and Science
• Linear multiport photonic interferometers: loss analysis of temporally-encoded architectures
• A comparison between higher-order nonclassicalities of superposition engineered coherent and thermal states
• Voltage-amplified heat rectification in SIS junctions
• Quantum supremacy with analog quantum processors for material science and machine learning
• n-Qubit Operations on Sphere and Queueing Scaling Limits for Programmable Quantum Computer
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• Aircraft Loading Optimization: MemComputing the 5th Airbus Problem
• Matrix concentration inequalities and efficiency of random universal sets of quantum gates
• Wasserstein Complexity of Quantum Circuits
• Long-range Ising interactions mediated by $\lambda {\varphi }^4$ fields: probing the renormalisation of sound in crystals of trapped ions
• Giant shot noise in superconductor/ferromagnet junctions with orbital-symmetry-controlled spin-orbit coupling
• Universal framework for simultaneous tomography of quantum states and SPAM noise
• Postselected communication over quantum channels
• Qubit Optimized Quantum Implementation of SLIM
• High performance Boson Sampling simulation via data-flow engines
• Efficient fidelity estimation: Alternative derivation and related applications
• Quantum-soft QUBO Suppression for Accurate Object Detection
• Quantum Computing: an undergraduate approach using Qiskit
• Passive verification protocol for thermal graph states
• Quantum estimation bound of Gaussian matrix permanent
• Boson sampling with ultracold atoms in a programmable optical lattice
• Measurement-invisible quantum correlations in scrambling dynamics
• Improved Strong Simulation of Universal Quantum Circuits
• A Unified Framework for Quantum Supervised Learning
• Quantum simulations of complex systems
• Impact of the malicious input data modification on the efficiency of quantum spatial search
• Accelerating variational quantum algorithms with multiple quantum processors
• Detecting Entanglement Generating Circuits in Cloud-Based Quantum Computing
• Low overhead universality and quantum supremacy using only $Z$-control
• Fundamental solutions of heat equation on unitary groups establish an improved relation between $\epsilon$-nets and approximate unitary $t$-designs
• Noise tolerance via reinforcement: Learning a reinforced quantum dynamics
• Post-selected Classical Query Complexity
• Self-attention U-Net decoder for toric codes
• Symbolic quantum programming for supporting applications of quantum computing technologies
• Optimal quantum reservoir learning in proximity to universality
• Finding high-order Hadamard matrices by using quantum computers
• Information phases of partial projected ensembles generated from random quantum states and scrambling dynamics
• Decoding Quantum Search Advantage: The Critical Role of State Properties in Random Walks
• Generalized Cross-Entropy Benchmarking for Random Circuits with Ergodicity
• Measurement and control of a superconducting quantum processor with a fully-integrated radio-frequency system on a chip
• Suppressing decoherence in quantum state transfer with unitary operations
• Speedup in Classical Simulation of Gaussian Boson Sampling
• Quantum Algorithm for Online Convex Optimization
• Applying the Quantum Alternating Operator Ansatz to the Graph Matching Problem
• Rewindable Quantum Computation and Its Equivalence to Cloning and Adaptive Postselection
• Quantum fidelity kernel with a trapped-ion simulation platform
• Compressed sensing enhanced by quantum approximate optimization algorithm
• Quantum Sparse Coding and Decoding Based on Quantum Network
• On the Hardness of Measuring Magic
• Robust Stability of Uncertain Quantum Input-Output Networks
• Polynomial speedup in Torontonian calculation by a scalable recursive algorithm
• Validating multi-photon quantum interference with finite data
• Quantum Advantage with Timestamp Membosonsampling
• A Novel Bulk-Optics Scheme for Quantum Walk with High Phase Stability
• Global estimates of errors in quantum computation by the Feynman-Vernon formalism
• Comparing coherence measures for X states: Can quantum states be ordered based on quantum coherence?
• Optical Quantum Computing
• Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations
• Improved Weak Simulation of Universal Quantum Circuits by Correlated $L_1$ Sampling
• Quantum Learning Algorithms and Post-Quantum Cryptography
• Ability of entanglement and purity to help to detect systematic experimental errors
• Quantum Computation
• Qubit Geometry through Holomorphic Quantization
• Toward quantum scaling advantage in approximate optimization
• A New Scaling Function for QAOA Tensor Network Simulations
• Many-body thermal states on a quantum computer: a variational approach
• High-performance parallel classical scheme for simulating shallow quantum circuits
• Quantum Algorithms in Cybernetics
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
• Two Variations of Quantum Phase Estimation for Reducing Circuit Error Rates: Application to the Harrow--Hassidim--Lloyd Algorithm
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation
• Efficient classical simulation of cluster state quantum circuits with alternative inputs
• Teleportation-based squeezer for bosonic cluster states
• Resource complexity of Symmetry Protected Topological phases
• Hardness of efficiently generating ground states in postselected quantum computation
• Resourcefulness of non-classical continuous-variable quantum gates