Related papers: Three-Qubit State Preparation: Classification and …
We undertake experimental detection of the entanglement present in arbitrary three-qubit pure quantum states on an NMR quantum information processor. Measurements of only four observables suffice to experimentally differentiate between the…
We study non-local properties of generic three-qubit pure states. First, we obtain the distributions of both the coefficients and the only phase in the five-term decomposition of Ac\'in et al. for an ensemble of random pure states generated…
There is an ongoing effort to quantify entanglement of quantum pure states for systems with more than two subsystems. We consider three approaches to this problem for three-qubit states: choosing a basis which puts the state into a standard…
We use concurrence as an entanglement measure and experimentally demonstrate the entanglement classification of arbitrary three-qubit pure states on a nuclear magnetic resonance (NMR) quantum information processor. Computing the concurrence…
We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to…
Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous…
The states of three-qubit systems split into two inequivalent types of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) type and the $W$ type. A state belonging to one of these classes can be stochastically…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
Understanding the structure of multi-qubit quantum states is essential for both quantum information research and education, yet intuitive visualization beyond the single-qubit Bloch sphere remains challenging. In this work, we propose a…
We prove for any pure three-quantum-bit state the existence of local bases which allow to build a set of five orthogonal product states in terms of which the state can be written in a unique form. This leads to a canonical form which…
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…
A qubit, or quantum bit, is conventionally defined as "a physical system for storing information that is capable of existing in either of two quantum states or in a superposition of both". In this paper, we examine the simple question of…
We present two scalable and entanglement-free methods for estimating the collective state of an n-qubit quantum computer. The first method consists of a fixed set of five quantum circuits-regardless of the number of qubits-that avoid the…
Numerical optimization methods such as hillclimbing and simulated annealing have been applied to search for highly entangled multi-qubit states. Here the genetic algorithm is applied to this optimization problem -- to search not only for…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…
The ability to fault-tolerantly prepare CAT states, also known as multi-qubit GHZ states, is an important primitive for quantum error correction. It is required for Shor-style syndrome extraction, and can also be used as a subroutine for…
In this paper we analyze the canonical forms into which any pure three-qubit state can be cast. The minimal forms, i.e. the ones with the minimal number of product states built from local bases, are also presented and lead to a complete…
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…
Constructing quantum circuits for efficient state preparation belongs to the central topics in the field of quantum information and computation. As the number of qubits grows fast, methods to derive large-scale quantum circuits are strongly…