Related papers: Efficient quantum algorithm to construct arbitrary…
Considering the unique energy level structure of the one-axis twisting Hamiltonian in combination with standard rotations, we propose the implementation of a rapid adiabatic passage scheme on the Dicke state basis. The method permits to…
Manipulating entanglement, which reflects non-local correlations in a quantum system and defines the complexity of describing its wave function, represents the extremely tough challenge in the fields of quantum computing, quantum…
The query model (or black-box model) has attracted much attention from the communities of both classical and quantum computing. Usually, quantum advantages are revealed by presenting a quantum algorithm that has a better query complexity…
We describe the first experimental realization of the Deutsch-Jozsa quantum algorithm to evaluate the properties of a 2-bit boolean function in the framework of one-way quantum computation. For this purpose a novel two-photon six-qubit…
We present an algorithm for measurement of $k$-local operators in a quantum state, which scales logarithmically both in the system size and the output accuracy. The key ingredients of the algorithm are a digital representation of the…
Finding the ground state of a Hamiltonian system is of great significance in many-body quantum physics and quantum chemistry. We propose an improved iterative quantum algorithm to prepare the ground state of a Hamiltonian. The crucial point…
The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on…
We propose a theoretical approach for entangling two Dicke states in a periodic modulated quantum system. By considering two qubit ensembles that are nonuniformly coupled to a common resonator, we can derive an effective Hamiltonian whose…
We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the…
We investigate the generation of quantum states and unitary operations that are ``random'' in certain respects. We show how to use such states to estimate the average fidelity, an important measure in the study of implementations of quantum…
We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…
Efficient state preparation is a challenging and important problem in quantum computing. In this work, we present a recursive state preparation algorithm that combines logarithmic-depth Dicke state circuits with Hamming weight encoders for…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
We propose to employ the amplification mechanism of Grover's search algorithm to efficiently prepare entangled states of an ensemble of qubits. The conditional change of sign employed in the algorithm can be implemented by the phase shift…
We discuss two qualities of quantum systems: various correlations existing between their subsystems and the distingushability of different quantum states. This is then applied to analysing quantum information processing. While quantum…
Many claims of computational advantages have been made for quantum computing over classical, but they have not been demonstrated for practical problems. Here, we present algorithms for solving time-dependent PDEs, with particular reference…
Recent progress in quantum optics has led to setups that are able to prepare high-dimensional quantum states for quantum information processing tasks. As such, it is of importance to benchmark the states generated by these setups in terms…
A method is presented to transfer a system of two-level atoms from a spin coherent state to a maximally spin squeezed Dicke state, relevant for quantum metrology and quantum information processing. The initial state is the ground state of…
Estimating ground state energies of many-body Hamiltonians is a central task in many areas of quantum physics. In this work, we give quantum algorithms which, given any $k$-body Hamiltonian $H$, compute an estimate for the ground state…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…