Related papers: Quantum state preparation and one qubit logic from…
We provide an efficient and general route for preparing non-trivial quantum states that are not adiabatically connected to unentangled product states. Our approach is a hybrid quantum-classical variational protocol that incorporates a…
We investigate protocols for generating a state $t$-design by using a fixed separable initial state and a diagonal-unitary $t$-design in the computational basis, which is a $t$-design of an ensemble of diagonal unitary matrices with random…
State preparation protocols ideally require as minimal operations as possible, in order to be implemented in near-term, potentially noisy quantum devices. Motivated by long range interactions (LRIs) intrinsic to many present-day…
Quantum walks have by now been realized in a large variety of different physical settings. In some of these, particularly with trapped ions, the walk is implemented in phase space, where the corresponding position states are not orthogonal.…
Universal quantum computers require entanglement and non-stabilizerness, a resource known as \textit{quantum magic}. Here, we introduce a protocol that prepares magic steady states by leveraging non-Hermitian dynamics, which, contrary to…
A quantum computing algorithm for rhythm generation is presented, which aims to expand and explore quantum computing applications in the arts, particularly in music. The algorithm maps quantum random walk trajectories onto a rhythmspace --…
We propose a protocol for coherently transferring non-Gaussian quantum states from optical field to a mechanical oscillator. The open quantum dynamics and continuous-measurement process, which can not be treated by the…
Implementing quantum operations in the form of natural Hamiltonian dynamics is desirable, since they almost require no external control or feedback. In this work, we propose a NISQ-friendly quantum-classical hybrid approach to designing a…
We investigate non-Gaussian states of light as ancillary inputs for generating nonlinear transformations required for quantum computing with continuous variables. We consider a recent proposal for preparing a cubic phase state, find the…
The conventional method for generating entangled states in qubit systems relies on applying precise two-qubit entangling gates alongside single-qubit rotations. However, achieving high-fidelity entanglement demands high accuracy in…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite…
We study a qubit undergoing Landau-Zener transitions enabled by the coupling to a circuit-QED mode. Summing an infinite-order perturbation series, we determine the exact nonadiabatic transition probability for the qubit, being independent…
Despite the fact that a complete theoretical description of critical phenomena in connection with phase transitions has been well-established through the renormalization group theory, the microscopic nature of the phase transitions remains…
A scheme is presented for realizing a quantum phase gate with three-level atoms, solid-state qubits--often called artificial atoms, or ions that share a quantum data bus such as a single mode field in cavity QED system or a collective…
We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We…
Implementing quantum algorithms is essential for quantum computation. We study the implementation of three quantum algorithms by performing homodyne measurements on a two-dimensional temporal continuous-variable cluster state. We first…
We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits…
We describe a qubit encoded in continuous quantum variables of an rf superconducting quantum interference device. Since the number of accessible states in the system is infinite, we may protect its two-dimensional subspace from small errors…