Infinite-Dimensional Programmable Quantum Processors
- URL: http://arxiv.org/abs/2012.00736v2
- Date: Wed, 14 Jul 2021 17:44:02 GMT
- Title: Infinite-Dimensional Programmable Quantum Processors
- Authors: Martina Gschwendtner, Andreas Winter
- Abstract summary: A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state.
We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A universal programmable quantum processor uses program quantum states to
apply an arbitrary quantum channel to an input state. We generalize the concept
of a finite-dimensional programmable quantum processor to infinite dimension
assuming an energy constraint on the input and output of the target quantum
channels. By proving reductions to and from finite-dimensional processors, we
obtain upper and lower bounds on the program dimension required to
approximately implement energy-limited quantum channels. In particular, we
consider the implementation of Gaussian channels. Due to their practical
relevance, we investigate the resource requirements for gauge-covariant
Gaussian channels. Additionally, we give upper and lower bounds on the program
dimension of a processor implementing all Gaussian unitary channels. These
lower bounds rely on a direct information-theoretic argument, based on the
generalization from finite to infinite dimension of a certain replication lemma
for unitaries.
Related papers
- The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes.
Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
arXiv Detail & Related papers (2024-10-18T13:59:50Z) - Distributed Quantum Computation via Entanglement Forging and Teleportation [13.135604356093193]
Distributed quantum computation is a practical method for large-scale quantum computation on quantum processors with limited size.
In this paper, we demonstrate the methods to implement a nonlocal quantum circuit on two quantum processors without any quantum correlations.
arXiv Detail & Related papers (2024-09-04T08:10:40Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Universal Quantum Computing with Field-Mediated Unruh--DeWitt Qubits [0.0]
A set of universal quantum gates is a vital part of the theory of quantum computing.
UDW detectors in simple settings enable a collection of gates known to provide universal quantum computing.
arXiv Detail & Related papers (2024-02-15T18:19:45Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor.
We propose a universal gate set featuring a two-qudit cross-resonance entangling gate.
We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z) - The Hintons in your Neural Network: a Quantum Field Theory View of Deep
Learning [84.33745072274942]
We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles.
On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
arXiv Detail & Related papers (2021-03-08T17:24:29Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - Programmability of covariant quantum channels [0.0]
A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels.
We show how to remove redundancy in the program and prove that the resulting program register has minimum Hilbert space dimension.
arXiv Detail & Related papers (2020-12-01T18:27:00Z) - Fundamental limitations on distillation of quantum channel resources [0.0]
We establish universal limitations on the processing of both quantum states and channels.
We focus on the class of distillation tasks, either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels.
We obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication.
arXiv Detail & Related papers (2020-10-22T17:59:28Z) - Optimal universal programming of unitary gates [7.75406296593749]
A universal quantum processor is a device that takes as input a (quantum) program, containing an encoded unitary gate, and a (quantum) data register.
A fundamental open question is how the size of the smallest quantum program scales with the approximation error.
arXiv Detail & Related papers (2020-07-20T18:00:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.