Energy-constrained discrimination of unitaries, quantum speed limits and
a Gaussian Solovay-Kitaev theorem
- URL: http://arxiv.org/abs/2006.06659v3
- Date: Thu, 13 May 2021 14:42:49 GMT
- Title: Energy-constrained discrimination of unitaries, quantum speed limits and
a Gaussian Solovay-Kitaev theorem
- Authors: Simon Becker, Nilanjana Datta, Ludovico Lami, Cambyse Rouz\'e
- Abstract summary: We investigate the energy-constrained (EC) diamond norm distance between unitary channels acting on possibly infinite-dimensional quantum systems.
We prove that optimal EC discrimination between two unitary channels does not require the use of any entanglement.
We also employ EC diamond norms to study a novel type of quantum speed limits, which apply to pairs of quantum dynamical semigroups.
- Score: 13.286165491120467
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We investigate the energy-constrained (EC) diamond norm distance between
unitary channels acting on possibly infinite-dimensional quantum systems, and
establish a number of results. Firstly, we prove that optimal EC discrimination
between two unitary channels does not require the use of any entanglement.
Extending a result by Ac\'in, we also show that a finite number of parallel
queries suffices to achieve zero error discrimination even in this EC setting.
Secondly, we employ EC diamond norms to study a novel type of quantum speed
limits, which apply to pairs of quantum dynamical semigroups. We expect these
results to be relevant for benchmarking internal dynamics of quantum devices.
Thirdly, we establish a version of the Solovay--Kitaev theorem that applies to
the group of Gaussian unitaries over a finite number of modes, with the
approximation error being measured with respect to the EC diamond norm relative
to the photon number Hamiltonian.
Related papers
- Quantum Computation of Thermal Averages for a Non-Abelian $D_4$ Lattice
Gauge Theory via Quantum Metropolis Sampling [0.0]
We show the application of the Quantum Metropolis Sampling (QMS) algorithm to a toy gauge theory with discrete non-Abelian gauge group $D_4$ in (2+1)-dimensions.
arXiv Detail & Related papers (2023-09-13T17:05:03Z) - Quantum simulation of Maxwell's equations via Schr\"odingersation [27.193565893837356]
We present quantum algorithms for electromagnetic fields governed by Maxwell's equations.
The algorithms are based on the Schr"odingersation approach.
Instead of qubits, the quantum algorithms can also be formulated in the continuous variable quantum framework.
arXiv Detail & Related papers (2023-08-16T14:52:35Z) - Experimental super-Heisenberg quantum metrology with indefinite gate
order [8.812571938093827]
We present a protocol surpassing the Heisenberg limit by probing two groups of independent processes in a superposition of two causal orders.
Our results only require a single-photon probe with an initial energy that is independent of N.
Our experiment features the demonstration of indefinite causal order in a continuous-variable system.
arXiv Detail & Related papers (2023-03-30T08:39:42Z) - Quantum algorithms for grid-based variational time evolution [36.136619420474766]
We propose a variational quantum algorithm for performing quantum dynamics in first quantization.
Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
arXiv Detail & Related papers (2022-03-04T19:00:45Z) - Lattice Renormalization of Quantum Simulations [8.771066413050963]
We show that trotterized time-evolution operators can be related by analytic continuation to the Euclidean transfer matrix on an anisotropic lattice.
Based on the tools of Euclidean lattice field theory, we propose two schemes to determine Minkowski lattice spacings.
arXiv Detail & Related papers (2021-07-02T16:10:45Z) - Multipartite entanglement detection via projective tensor norms [1.2891210250935143]
We study a class of entanglement criteria based on the idea of applying local contractions to an input multipartite state.
We analyze the performance of this type of criteria on bipartite and multipartite systems.
We show that previously studied entanglement criteria, such as the realignment and the SIC POVM criteria, can be viewed inside this framework.
arXiv Detail & Related papers (2020-10-13T13:19:23Z) - Towards simulating 2D effects in lattice gauge theories on a quantum
computer [1.327151508840301]
We propose an experimental quantum simulation scheme to study ground state properties in two-dimensional quantum electrodynamics (2D QED) using existing quantum technology.
The proposal builds on a formulation of lattice gauge theories as effective spin models in arXiv:2006.14160.
We present two Variational Quantum Eigensolver (VQE) based protocols for the study of magnetic field effects, and for taking an important first step towards computing the running coupling of QED.
arXiv Detail & Related papers (2020-08-21T01:20:55Z) - Quantitative Propagation of Chaos for SGD in Wide Neural Networks [39.35545193410871]
In this paper, we investigate the limiting behavior of a continuous-time counterpart of the Gradient Descent (SGD)
We show 'propagation of chaos' for the particle system defined by this continuous-time dynamics under different scenarios.
We identify two under which different mean-field limits are obtained, one of them corresponding to an implicitly regularized version of the minimization problem at hand.
arXiv Detail & Related papers (2020-07-13T12:55:21Z) - The role of boundary conditions in quantum computations of scattering
observables [58.720142291102135]
Quantum computing may offer the opportunity to simulate strongly-interacting field theories, such as quantum chromodynamics, with physical time evolution.
As with present-day calculations, quantum computation strategies still require the restriction to a finite system size.
We quantify the volume effects for various $1+1$D Minkowski-signature quantities and show that these can be a significant source of systematic uncertainty.
arXiv Detail & Related papers (2020-07-01T17:43:11Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.