Related papers: Implementing quantum algorithms on temporal photon…
The identification of an unknown quantum gate is a significant issue in quantum technology. In this paper, we propose a quantum gate identification method within the framework of quantum process tomography. In this method, a series of pure…
Quantum state tomography is an integral part of quantum computation and offers the starting point for the validation of various quantum devices. One of the central tasks in the field of state tomography is to reconstruct with high fidelity,…
Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
We propose efficient algorithms for classically simulating fermionic linear optics operations applied to non-Gaussian initial states. By gadget constructions, this provides algorithms for fermionic linear optics with non-Gaussian…
In this paper, we propose two strategies for decreasing the error of arbitrary single-mode Gaussian transformations implemented using one-way quantum computation on a four-node linear cluster state. We show that it is possible to minimize…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
Modeling composite systems of spins or electrons coupled to bosonic modes is of significant interest for many fields of applied quantum physics and chemistry. A quantum simulation can allow for the solution of quantum problems beyond…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
A new implementation of the topological cluster state quantum computer is suggested, in which the basic elements are linear optics, measurements, and a two-dimensional array of quantum dots. This overcomes the need for non-linear devices to…
Measurement-based quantum computation with continuous variables in an optical setup shows the great promise towards implementation of large-scale quantum computation, where the time-domain multiplexing approach enables us to generate the…
The quest for improved sampling methods to solve statistical mechanics problems of physical and chemical interest proceeds with renewed efforts since the invention of the Metropolis algorithm, in 1953. In particular, the understanding of…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…
The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using…
In order to achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very…
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…
Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or…