Related papers: A Generalized Quantum Inner Product and Applicatio…
We calculate the quantum Cram\'er--Rao bound for the sensitivity with which one or several parameters, encoded in a general single-mode Gaussian state, can be estimated. This includes in particular the interesting case of mixed Gaussian…
We calculate the quantum Cram\'er--Rao bound for the sensitivity with which one or several parameters, encoded in a general single-mode Gaussian state, can be estimated. This includes in particular the interesting case of mixed Gaussian…
We describe a new viewpoint on canonical quantization of linear fields on a general curved background that encompasses and generalizes the standard treatment of canonical QFT given in textbooks. Our method permits the construction of pure…
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state…
We introduce two kinds of quantum algorithms to explore microcanonical and canonical properties of many-body systems. The first one is a hybrid quantum algorithm that, given an efficiently preparable state, computes expectation values in a…
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations. Using the "Sender-Receiver" model, we propose quantum algorithms for matrix operations such as matrix-vector product,…
Quantum computation is the suitable orthogonal encoding of possibly holistic functional properties into state vectors, followed by a projective measurement.
We present a new method to measure the work $w$ performed on a driven quantum system and to sample its probability distribution $P(w)$. The method is based on a simple fact that remained unnoticed until now: Work on a quantum system can be…
Recently, Lloyd and Montangero have made a brief research proposal on universal quantum computation in integrable systems. The main idea is to encode qubits into quantum action variables and build up quantum gates by the method of resonant…
We present a method that outputs a sequence of simple unitary operations to prepare a given quantum state that is a generalized coherent state. Our method takes as inputs the expectation values of some relevant observables on the state to…
Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as…
As quantum technologies advance, the ability to generate increasingly large quantum states has experienced rapid development. In this context, the verification and estimation of large entangled systems represents one of the main challenges…
This thesis explores the use of entangled states in quantum computation and quantum information science. Entanglement, a quantum phenomenon with no classical counterpart, has been identified as an important and quantifiable resource in many…
Differential equations are a powerful tool for evaluating Feynman integrals. Their solution is straightforward if a transformation to a canonical form is found. In this paper, we present an algorithm for finding such a transformation. This…
In part 1 of this paper some linear weighted generalized Fibonacci number summation identities were derived using the fact that the Fibonacci number is the residue of a rational function. In this part, using the same method, some quadratic…
Quantum computers can be used for supervised learning by treating parametrised quantum circuits as models that map data inputs to predictions. While a lot of work has been done to investigate practical implications of this approach, many…
In this paper we extend both standard fault tolerance theory and Kitaev's model for quantum computation, combining them so as to yield quantitative results that reveal the interplay between the two. Our analysis establishes a methodology…
In the present paper we consider the problem of description of an arbitrary generalized quantum measurement with outcomes in a measurable space. Analyzing the unitary invariants of a measuring process, we present the most general form of a…
This paper proposes a quantum circuit for computing the mean value from a given set of quantum states. The circuit consults a Quantum Random Access Memory to get the values of the set, and by using superposition, interference and…
An analytically derived 'integral operator' approach is introduced to estimate the expectation value of a quantum operator for an evolving state weighted with an exponential function. This allows to compute quantities useful in Nuclear…