Related papers: Partial and complete qubit estimation using a sing…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
We address quantum estimation in situations where one has at disposal data from the measurement of an incomplete set of observables and some a priori information on the state itself. By expressing the a priori information in terms of a bias…
A novel operational method for estimating the efficiency of quantum state tomography protocols is suggested. It is based on a-priori estimation of the quality of an arbitrary protocol by means of universal asymptotic fidelity distribution…
Quantum process tomography is a useful tool for characterizing quantum processes. This task is essential for the development of different areas, such as quantum information processing. In this work, we present a protocol for selective…
Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…
We propose a method for the tomographic reconstruction of qubit states for a general class of solid state systems in which the Hamiltonians are represented by spin operators, e.g., with Heisenberg-, $XXZ$-, or XY- type exchange…
It has recently been shown that it is possible to represent the complete quantum state of any system as a phase-space quasi-probability distribution (Wigner function) [Phys Rev Lett 117, 180401]. Such functions take the form of expectation…
We experimentally demonstrate a programmable single-qubit quantum gate. This device applies a unitary phase shift operation to a data qubit with the value of the phase shift being fully determined by the state of a program qubit. Our linear…
Understanding quantum systems is of significant importance for assessing the performance of quantum hardware and software, as well as exploring quantum control and quantum sensing. An efficient representation of quantum states enables…
We investigate the multiparameter quantum estimation and quantum thermodynamics properties of a gravitational cat state (gravcat) system composed of two interacting massive particles confined in double-well potentials. The system is…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
Reconstructing the state of a complex quantum system represents a pivotal task for all quantum information applications, both for characterization purposes and for verification of quantum protocols. Recent technological developments have…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…
Multipartite entanglement tomography, namely the quantum Fisher information (QFI) calculated with respect to different collective operators, allows to fully characterize the phase diagram of the quantum Ising chain in a transverse field…
Multiparameter quantum estimation theory aims to determine simultaneously the ultimate precision of all parameters contained in the state of a given quantum system. Determining this ultimate precision depends on the quantum Fisher…
Block-encodings have become one of the most common oracle assumptions in the circuit model. I present an algorithm that uses von Neumann's measurement procedure to measure a phase, using time evolution on a block-encoded Hamiltonian as a…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…
We provide a new quantum algorithm that efficiently determines the quality of a least-squares fit over an exponentially large data set by building upon an algorithm for solving systems of linear equations efficiently (Harrow et al., Phys.…
Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a…