The power of one qumode for quantum computation

Abstract

Although quantum computers are capable of solving problems like factoring exponentially faster than the best-known classical algorithms, determining the resources responsible for their computational power remains unclear. An important class of problems where quantum computers possess an advantage is phase estimation, which includes applications like factoring. We introduce a new computational model based on a single squeezed state resource that can perform phase estimation, which we call the power of one qumode. This model is inspired by an interesting computational model known as deterministic quantum computing with one quantum bit (DQC1). Using the power of one qumode, we identify that the amount of squeezing is sufficient to quantify the resource requirements of different computational problems based on phase estimation. In particular, it establishes a quantitative relationship between the resources required for factoring and DQC1. For example, we find the squeezing required to factor has an exponential scaling whereas no squeezing (i.e., a coherent state) is already sufficient to solve the hardest problem in DQC1.

8 pages, 2 figures

References in corpus (5)

• Quantum algorithm for solving linear systems of equations
• Experimental quantum computing without entanglement
• On the role of entanglement and correlations in mixed-state quantum computation
• Optimal phase measurements with pure Gaussian states
• Computation with Unitaries and One Pure Qubit

Cited by in corpus (25)

• Quantum machine learning over infinite dimensions
• Continuous-Variable Instantaneous Quantum Computing is hard to sample
• Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations
• Finite-time quantum entanglement in propagating squeezed microwaves
• Interpretable Quantum Advantage in Neural Sequence Learning
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Selected topics of quantum computing for nuclear physics
• Finite-error metrological bounds on the multi-parameter Hamiltonian estimation
• Classical and quantum regression analysis for the optoelectronic performance of NTCDA/p-Si UV photodiode
• Continuous-variable assisted thermal quantum simulation
• Time complexity analysis of quantum difference methods for linear high dimensional and multiscale partial differential equations
• Witnessing quantum resource conversion within deterministic quantum computation using one pure superconducting qubit
• Quantum algorithms for training Gaussian Processes
• Saturation of Thermal Complexity of Purification
• Realizing quantum linear regression with auxiliary qumodes
• Measurement-Based Linear Optics
• Active Learning of Quantum System Hamiltonians yields Query Advantage
• Client-friendly continuous-variable blind and verifiable quantum computing
• Universal Continuous Variable Quantum Computation Without Cooling
• Quantum simulation of discrete linear dynamical systems and simple iterative methods in linear algebra via Schrodingerisation
• Toward Mixed Analog-Digital Quantum Signal Processing: Quantum AD/DA Conversion and the Fourier Transform
• Inverse iteration quantum eigensolvers assisted with a continuous variable
• Towards quantum simulation of spin systems using continuous variable quantum devices
• Co-Designing Spectral Transformation Oracles with Hybrid Oscillator-Qubit Quantum Processors: From Algorithms to Compilation
• Non-destructively probing the thermodynamics of quantum systems with qumodes