Experimental characterization of quantum processes: a selective and
efficient method in arbitrary finite dimension
- URL: http://arxiv.org/abs/2011.08228v1
- Date: Mon, 16 Nov 2020 19:14:56 GMT
- Title: Experimental characterization of quantum processes: a selective and
efficient method in arbitrary finite dimension
- Authors: Quimey Pears Stefano, Ignacio Perito, Juan Jos\'e Miguel Varga, Lorena
Reb\'on, Claudio Iemmi
- Abstract summary: We show how to implement an algorithm to selectively and efficiently estimate any parameter characterizing a quantum process in a non-prime power dimension.
We conducted for the first time an experimental verification of the algorithm in a Hilbert space of dimension $d=6$.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The temporal evolution of a quantum system can be characterized by quantum
process tomography, a complex task that consumes a number of physical resources
scaling exponentially with the number of subsystems. An alternative approach to
the full reconstruction of a quantum channel allows selecting which coefficient
from its matrix description to measure, and how accurately, reducing the amount
of resources to be polynomial. The possibility of implementing this method is
closely related to the possibility of building a complete set of mutually
unbiased bases (MUBs) whose existence is known only when the dimension of the
Hilbert space is the power of a prime number. However, an extension of the
method that uses tensor products of maximal sets of MUBs, has been introduced
recently. Here we explicitly describe how to implement this algorithm to
selectively and efficiently estimate any parameter characterizing a quantum
process in a non-prime power dimension, and we conducted for the first time an
experimental verification of the method in a Hilbert space of dimension $d=6$.
That is the small space for which there is no known a complete set of MUBs but
it can be decomposed as a tensor product of two other Hilbert spaces of
dimensions $D_1=2$ and $D_2=3$, for which a complete set of MUBs is known. The
$6$-dimensional states were codified in the discretized transverse momentum of
the photon wavefront. The state preparation and detection stages are
dynamically programmed with the use of only-phase spatial light modulators, in
a versatile experimental setup that allows to implement the algorithm in any
finite dimension.
Related papers
- Multi-stage tomography based on eigenanalysis for high-dimensional dense unitary quantum processes [2.5966580648312223]
Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a quantum process.
We consider unitary, possibly dense (i.e. without sparsity constraints) processes, which corresponds to isolated systems.
We first propose two-stage methods and we then extend them to dichotomic methods, whose number of stages increases with the considered state space dimension.
arXiv Detail & Related papers (2024-07-18T14:18:23Z) - Quantum Realization of the Finite Element Method [0.0]
This paper presents a quantum algorithm for the solution of second-order linear elliptic partial differential equations discretized by $d$-linear finite elements.
A BPX preconditioner transforms the linear system into a sufficiently well-conditioned one, making it amenable to quantum computation.
We detail the design and implementation of a quantum circuit capable of executing our algorithm, and present simulator results that support the quantum feasibility of the finite element method.
arXiv Detail & Related papers (2024-03-28T15:44:20Z) - A conservative hybrid physics-informed neural network method for
Maxwell-Amp\`{e}re-Nernst-Planck equations [22.81295238376119]
The proposed hybrid algorithm provides an automated means to determine a proper approximation for dummy variables.
The original method is validated for 2-dimensional problems.
The proposed method can be readily generalised to cases with one spatial dimension.
arXiv Detail & Related papers (2023-12-10T13:58:41Z) - Dilation theorem via Schr\"odingerisation, with applications to the
quantum simulation of differential equations [29.171574903651283]
Nagy's unitary dilation theorem in operator theory asserts the possibility of dilating a contraction into a unitary operator.
In this study, we demonstrate the viability of the recently devised Schr"odingerisation approach.
arXiv Detail & Related papers (2023-09-28T08:55:43Z) - Accelerating Quantum Optimal Control of Multi-Qubit Systems with
Symmetry-Based Hamiltonian Transformations [3.0126004742841253]
We present a novel, computationally efficient approach to accelerate quantum optimal control calculations of large multi-qubit systems.
Our approach reduces the Hamiltonian size of an $n$-qubit system from 2n by 2n to O(n by n) or O((2n / n) by (2n / n) under Sn or Dn symmetry.
arXiv Detail & Related papers (2023-09-12T00:08:17Z) - Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices.
Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured.
We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
arXiv Detail & Related papers (2023-06-15T18:23:55Z) - Avoiding barren plateaus in the variational determination of geometric
entanglement [0.0]
We introduce a method capable of avoiding the barren plateau phenomenon in the variational determination of the geometric measure of entanglement for a large number of qubits.
We analytically demonstrate that the local functions can be efficiently estimated and optimized.
In particular, the method allows for escaping from barren plateaus induced by hardware noise or global functions defined on high-dimensional systems.
arXiv Detail & Related papers (2023-04-26T08:58:50Z) - Automated detection of symmetry-protected subspaces in quantum
simulations [0.0]
We introduce two classical algorithms, which efficiently compute and elucidate features of symmetry-protected subspaces.
These algorithms lend themselves to the post-selection of quantum computer data, optimized classical simulation of quantum systems, and the discovery of previously hidden symmetries in quantum mechanical systems.
arXiv Detail & Related papers (2023-02-16T21:17:48Z) - Quantum Goemans-Williamson Algorithm with the Hadamard Test and
Approximate Amplitude Constraints [62.72309460291971]
We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits.
Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit.
We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
arXiv Detail & Related papers (2022-06-30T03:15:23Z) - 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) - Bosonic field digitization for quantum computers [62.997667081978825]
We address the representation of lattice bosonic fields in a discretized field amplitude basis.
We develop methods to predict error scaling and present efficient qubit implementation strategies.
arXiv Detail & Related papers (2021-08-24T15:30:04Z)
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.