Related papers: Partition of 3-qubits using local gates
Several entanglement measures are used to define equivalence classes in the set of hypergraph states of three qubits. Our classifications reveal that (i) under local unitary transformations, hypergraph states of three qubits are split into…
Many quantum states arising in algorithms and physical systems occupy only a small, structured subset of the exponentially large Hilbert space, yet standard quantum state tomography fails to exploit this structure. We present an efficient…
We show how to perform measurement-based quantum computing on qudits (high-dimensional quantum systems) using alternative resource states beyond the cluster state. Estimating overheads for gate decomposition, we find that generalizing…
The group of transversal gates and the group of local symmetries are important features of quantum error correcting codes and pure quantum states, respectively; the former provides fault-tolerant operations on a code while the latter tells…
We investigate the topological quantum compilation of two-qubit operations within a system of Fibonacci anyons. Our primary goal is to generate gates that are approximately leakage-free and equivalent to the controlled-NOT (CNOT) gate up to…
Multipartite entanglement is an essential aspect of quantum systems, needed to execute quantum algorithms, implement error correction, and achieve quantum-enhanced sensing. In solid-state quantum registers such nitrogen-vacancy (NV) centers…
In this paper we continue to explore "hybrid" quantum circuit models in one-dimension with both unitary and measurement gates, focussing on the entanglement properties of wavefunction trajectories at long times, in the steady state. We…
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
We consider two measures of entanglement, the logarithmic negativity and the entanglement entropy, between regions of space in excited states of many-body systems formed by a finite number of particle excitations. In parts I and II of the…
Quantum algorithms often assume independent spin qubits to produce trivial $|\uparrow\rangle=|0\rangle$, $|\downarrow\rangle=|1\rangle$ mappings. This can be unrealistic in many solid-state implementations with sizeable magnetic…
A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical…
Entanglement is one of the most fundamental properties of quantum mechanics, and is the key resource for quantum information processing. Bipartite entangled states of identical particles have been generated and studied in several…
This paper presents a novel way to use the algebra of unit quaternions to express arbitrary roots or fractional powers of single-qubit gates, and to use such fractional powers as generators for algebras that combine these fractional input…
It is known from Schmidt decomposition that Schmidt number of nonlocal two-qubit quantum gates is 2 or 4. We identify conditions on geometrical points of a gate to have Schmidt number 2. A simple analysis reveals that Schmidt number 2…
In [Science 340, 1205, 7 June (2013)], via polytopes Michael Walter et al. proposed a sufficient condition detecting the genuinely entangled pure states. In this paper, assume that a state with six non-zero coefficients is not a trivially…
In tri-partite systems, there are three basic biseparability, $A$-$BC$, $B$-$CA$ and $C$-$AB$ biseparability according to bipartitions of local systems. We begin with three convex sets consisting of these basic biseparable states in the…
Minimizing the use of CNOT gates in quantum state preparation is a crucial step in quantum compilation, as they introduce coupling constraints and more noise than single-qubit gates. Reducing the number of CNOT gates can lead to more…
High-fidelity multi-qubit gates are a critical resource for near-term quantum computing, as they underpin the execution of both quantum algorithms and fault-tolerant protocols. The Toffoli gate (CCNOT), in particular, plays a central role…
We examine the geometric structure of qutrit state space by identifying the outcome probabilities of symmetric informationally complete (SIC) measurements with quantum states. We categorize the infinitely many qutrit SICs into eight SIC…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…