Three-Qubit State Preparation: Classification and Explicit Circuits

• URL: http://arxiv.org/abs/2603.00845v1
• Date: Sun, 01 Mar 2026 00:13:41 GMT
• Title: Three-Qubit State Preparation: Classification and Explicit Circuits
• Abstract summary: We group frequently encountered three-qubit pure states in quantum information into four classes and provide an explicit circuit for each class.<n>Compared with prior approaches, our circuits are designed for practical use.
• Score: 7.240656101116879
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a deterministic framework for preparing an arbitrary three-qubit pure state. To leverage entanglement structure in the state-preparation task, we classify three-qubit pure states into five types with respect to a $1|2$ bipartition. Given a target state specified by its amplitudes, we provide concrete criteria and concurrence-based tests that determine its type. For each type, we derive an explicit circuit template composed of elementary single-qubit rotations and CNOT gates, with gate parameters determined systematically from the Schmidt decomposition. The full construction is described step by step from the target amplitudes, with no procedural ambiguity. As an application, we further group frequently encountered three-qubit pure states in quantum information into four classes and provide an explicit circuit for each class. Compared with prior approaches, our circuits are designed for practical use: they admit a direct algorithmic instantiation, use only CNOT gates between adjacent qubits, and for certain classes achieve smaller gate counts and circuit depth.

Related papers

• Robust Device-Independent Certification of Boolean-Phase Gates [43.185722326013035]
  Device-independent certification of a quantum gate requires the input and output tests to identify the same reference qubits.<n>We develop a robust certification scheme for Boolean-phase gates.<n>We show how the algebraic structure of a gate can shift target-dependent information from quantum measurement design to classical processing of local outcomes.
  arXiv  Detail & Related papers  (2026-09-09T07:41:09Z)
• On the Experimental Determination of Nonlocal Characteristics of Two-Qubit Gates [0.3580891736370874]
  We construct two-qubit quantum circuits to measure the entangling power and gate typicality of two-qubit gates.<n>These circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors.
  arXiv  Detail & Related papers  (2026-07-13T02:15:56Z)
• Characterization of three-qubit controlled unitary gates of Schmidt rank three [0.0]
  We characterize three-qubit controlled unitary gates of Schmidt rank three.<n>We show that gates with Schmidt rank three can generate output states ranging from fully separable to maximal GHZ-class states.
  arXiv  Detail & Related papers  (2026-06-17T02:19:39Z)
• Efficient equivalence checking of Clifford-U circuits with shared single-qubit unitaries [5.016480897268685]
  We present an equivalence-checking method for circuits formed by arbitrary single-qubit layers interleaved with Clifford layers.<n>This pattern is common in variational quantum algorithms and Hamiltonian simulation via Trotter decomposition.<n>We prove the existence of an efficient classical algorithm that determines whether a pair of circuits with shared single-qubit layers are equivalent for every possible choice of the shared single-qubit unitaries.
  arXiv  Detail & Related papers  (2026-03-13T06:25:26Z)
• Matchgate circuit representation of fermionic Gaussian states: optimal preparation, approximation, and classical simulation [0.006396529661340102]
  We address the question of how to optimally create such states when using matchgate circuits acting on product states.<n>We present explicit algorithms whose constructions saturate these bounds, thereby proving their optimality.<n>Our results have direct applications to (approximate) state preparation and to disentangling procedures.
  arXiv  Detail & Related papers  (2026-03-05T21:06:06Z)
• Rethinking Circuit Completeness in Language Models: AND, OR, and ADDER Gates [35.90665719234101]
  We introduce three types of logic gates: AND, OR, and ADDER gates, and decompose the circuit into combinations of these logical gates.<n>We propose a framework that combines noising-based and denoising-based interventions, which can be easily integrated into existing circuit discovery methods.
  arXiv  Detail & Related papers  (2025-05-15T07:35:14Z)
• Data Complexity Measures for Quantum Circuits Architecture Recommendation [55.74527632797241]
  Quantum Parametric Circuits are constructed as an alternative to reduce the size of quantum circuits.<n> determining the optimal circuit for a given problem remains an open question.<n>In this work, a quantum circuit recommendation architecture for classification problems is proposed using database complexity measures.
  arXiv  Detail & Related papers  (2025-02-21T01:17:24Z)
• Optimization Driven Quantum Circuit Reduction [20.697821016522358]
  We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
  arXiv  Detail & Related papers  (2025-02-20T16:41:10Z)
• Measurement-Based Quantum Compiling via Gauge Invariance [1.1510009152620668]
  We introduce a new paradigm for quantum compiling directly converting any quantum circuit to a class of graph states, independently from its size. The graph state can be rebuilt from the circuit and the input by employing a set of graphical rules similar to the Feynman's ones. Compared to Measurement Calculus, the ancillary qubits are reduced by 50% on QFT and 75% on QAOA.
  arXiv  Detail & Related papers  (2024-11-19T13:09:49Z)
• Learning Classifiers of Prototypes and Reciprocal Points for Universal Domain Adaptation [79.62038105814658]
  Universal Domain aims to transfer the knowledge between datasets by handling two shifts: domain-shift and categoryshift. Main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known and then relying on the single threshold to distinguish unknown target samples.
  arXiv  Detail & Related papers  (2022-12-16T09:01:57Z)
• Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization [0.0]
  We present a construction for circuits with low gate count and depth. The circuits can be implemented on any quantum device with nearest-neighbor connectivity on a square-lattice. We find an upper bound for the circuit depth which is independent of the system size.
  arXiv  Detail & Related papers  (2022-11-21T09:29:07Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
  Kitaev's quantum double model based on a finite group $G$. We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
  arXiv  Detail & Related papers  (2022-05-04T08:10:36Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.