A unitary operator U=\sum u_{j,k} |k><j| is called diagonal when u_{j,k}=0 unless j=k. The definition extends to quantum computations, where j and k vary over the 2^n binary expressions for integers 0,1 ..., 2^n-1, given n qubits. Such operators do not affect outcomes of the projective measurement {<j| ; 0 <= j <= 2^n-1} but rather create arbitrary relative phases among the computational basis states {|j> ; 0 <= j <= 2^n-1}. These relative phases are often required in applications.
Constructing quantum circuits for diagonal computations using standard techniques requires either O(n^2 2^n) controlled-not gates and one-qubit Bloch sphere rotations or else O (n 2^n) such gates and a work qubit. This work provides a recursive, constructive procedure which inputs the matrix coefficients of U and outputs such a diagram containing 2^{n+1}-3 alternating controlled-not gates and one-qubit z-axis Bloch sphere rotations. Up to a factor of two, these circuits are the smallest possible. Moreover, should the computation U be a tensor of diagonal one-qubit computations of the form R_z(α)=e^{-i α/2}|0><0|+ e^{i α/2} |1><1|, then a cancellation of controlled-not gates reduces our circuit to that of an n-qubit tensor.
We give separability criteria for general multi-qubit states in terms of diagonal and anti-diagonal entries. We define two numbers which are obtained from diagonal and anti-diagonal entries, respectively, and compare them to get criteria. They give rise to characterizations of separability when all the entries are zero except for diagonal and anti-diagonal, like Greenberger-Horne-Zeilinger diagonal states. The criteria is strong enough to get nonzero volume of entanglement with positive partial transposes.
Diagonal quantum circuits are quantum circuits comprising only diagonal gates in the computational basis. In spite of a classical feature of diagonal quantum circuits in the sense of commutativity of all gates, their computational power is highly likely to outperform classical one and they are exploited for applications in quantum informational tasks. We review computational power of diagonal quantum circuits and their applications. We focus on the computational power of instantaneous quantum polynomial-time (IQP) circuits, which are a special type of diagonal quantum circuits. We then review …
We analytically prove the necessary and sufficient criterion for the full separability of three-qubit Greenberger-Horne-Zeilinger (GHZ) diagonal states. The corresponding entanglement is exactly calculable for some GHZ diagonal states and is tractable for the others using the relative entropy of entanglement. We show that the biseparable criterion and the genuine entanglement are determined only by the biggest GHZ diagonal element regardless of all the other smaller diagonal elements. We have completely solved the entanglement problems of three-qubit GHZ diagonal states.
We characterize the separability of three qubit GHZ diagonal states in terms of entries. This enables us to check separability of GHZ diagonal states without decomposition into the sum of pure product states. In the course of discussion, we show that the necessary criterion of Gühne for (full) separability of three qubit GHZ diagonal states is sufficient with a simpler formula. The main tool is to use entanglement witnesses which are tri-partite Choi matrices of positive bi-linear maps.
The characterization of genuine multiparticle entanglement is important for entanglement theory as well as experimental studies related to quantum information theory. Here, we completely characterize genuine multiparticle entanglement for four-qubit states diagonal in the cluster-state basis. In addition, we give a complete characterization of multiparticle entanglement for all five-qubit graph states mixed with white noise, for states diagonal in the basis corresponding to the five-qubit Y-shaped graph, and for a family of graph states with an arbitrary number of qubits.
We reduce the necessary and sufficient biseparable conditions of the four qubit cluster diagonal state to concise forms. Only 4 out of the 15 parameters are proved to be relevant in specifying the genuine entanglement of the state. Using the relative entropy of entanglement as the entanglement measure, we analytically find the genuine entanglement of all the four qubit cluster diagonal states. The formulas of the genuine entanglement are of five kinds, for seven different parameter regions of entanglement.
The concept of off-diagonal geometric phase (GP) has been introduced in order to recover interference information about the geometry of quantal evolution where the standard GPs are not well-defined. In this Letter, we propose a physical setting for realizing non-Abelian off-diagonal GPs. The proposed non-Abelian off-diagonal GPs can be implemented in a cyclic chain of four qubits with controllable nearest-neighbor interactions. Our proposal seems to be within reach in various nano-engineered systems and therefore opens up for first experimental test of the non-Abelian off-diagonal GP.
The Heisenberg exchange interaction is a natural method to implement non-local (i.e., multi-qubit) quantum gates in quantum information processing. We consider quantum circuits comprising of $(SWAP)^α$ gates, which are realized through the exchange interaction, and single-qubit gates. A universal two-qubit quantum circuit is constructed from only three $(SWAP)^α$ gates and six single-qubit gates. We further show that three $(SWAP)^α$ gates are not only sufficient, but necessary. Since six single-qubit gates are known to be necessary, our universal two-qubit circuit is optimal in terms of the n…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum circuits so that gates are applied only locally. The graph requires each qubit to interact with 4 other qubits and yet the time-overhead for implementing any n-qubit quantum circuit is 6 log n. Building a network of quantum computing nodes according to this graph enables the network to emulate a single monolithic device with minimal overhead.
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitary $t$-designs and present two quantum circuits that implement diagonal-unitary $2$-designs with the computational basis in $N$-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact di…
A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit. In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qu…
We describe quantum circuits generating four-qubit maximally entangled states, the amount of entanglement being quantified by using the absolute value of the Cayley hyperdeterminant as an entanglement monotone. More precisely, we show that this type of four-qubit entangled states can be obtained by the action of a family of CNOT circuits on some special states of the LU orbit of the state |0000 >.
We consider four-dimensional qudits as qubit pairs and their qudit Pauli operators as qubit Clifford operators. This introduces a nesting, $C_1^2 \subset C_2^4 \subset C_3^2$, where $C_n^m$ is the $n$th level of the $m$-dimensional qudit Clifford hierarchy. If we can convert between logical qubits and qudits, then qudit Clifford operators are qubit non-Clifford operators. Conversion is achieved by qubit fusion and qudit fission using stabilizer circuits that consume a resource state. This resource is a fused qubit stabilizer state with a fault-tolerant state preparation using stabilizer circui…
We explicitly construct a quantum circuit which exactly generates random three-qubit states. The optimal circuit consists of three CNOT gates and fifteen single qubit elementary rotations, parametrized by fourteen independent angles. The explicit distribution of these angles is derived, showing that the joint distribution is a product of independent distributions of individual angles apart from four angles.
The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuits have been demonstrated in some cases but generally require ancilla registers, which can dominate the qubit resources. In this paper, we point out a correspondence between Walsh functions and a basis for diagonal operators that gives a simple way to construct efficient circuits for diagonal unitaries without ancillas. This correspondence reduces the problem of constructing the minimal-depth circuit wi…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates. Additionally, we use the simulator to investigate errors based on different probability distributions and to investigate the robustness of different 2-qubit multiplier circuits in the presence of operational errors.
We propose a method of constructing the separability criteria for multipartite quantum states on the basis of entanglement witnesses. The entanglement witnesses are obtained by finding the maximal expectation values of Hermitian operators and then optimizing over all possible Hermitian operators. We derive a set of tripartite separability criteria for the four-qubit Greenberger--Horne--Zeilinger (GHZ) diagonal states. The derived criterion set contains four criteria that are necessary and sufficient for the tripartite separability of the highly symmetric four-qubit GHZ diagonal states; the cri…
We give a separability criterion for three qubit states in terms of diagonal and anti-diagonal entries. This gives us a complete characterization of separability when all the entries are zero except for diagonal and anti-diagonals. The criterion is expressed in terms of a norm arising from anti-diagonal entries. We compute this norm in several cases, so that we get criteria with which we can decide the separability by routine computations.
In this paper, we present Clifford+T gates based quantum circuit design of integer division having $n$ ancillary qubits. The proposed quantum circuit is based on restoring division algorithm. The proposed quantum circuit of integer division consists of (i) quantum circuitry of conditional addition operation, (ii) quantum circuitry of integer subtraction. To design ancillary and T-count optimized design of quantum integer division, the optimized quantum circuit design of integer conditional addition operation and integer subtraction are presented. The proposed quantum integer division circuitry…
Although near-term quantum computing devices are still limited by the quantity and quality of qubits in the so-called NISQ era, quantum computational advantage has been experimentally demonstrated. Moreover, hybrid architectures of quantum and classical computing have become the main paradigm for exhibiting NISQ applications, where low-depth quantum circuits are repeatedly applied. In order to further scale up the problem size solvable by the NISQ devices, it is also possible to reduce the number of physical qubits by "cutting" the quantum circuit into different pieces. In this work, we experi…
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 highly entangled states, but also for the corresponding quantum circuits creating these states. Simple quantum circuits for maximally (highly) entangled states are discovered for 3, 4, 5, and 6-qubit systems; and extension of the method to systems with more qubits is discussed. Among other results we have found explicit quantum circuits for maximally entangled…
We propose a theory of characterizing quantum circuits with qubit functional configurations. Any quantum circuit can be decomposed into alternating sequences of 1-qubit unitary gates and CNOT gates. Each CNOT sequence prepares the current quantum state into a layer of qubit functional configuration to specify the rule for the next 1-qubit unitary sequence on how to collectively modify the state vector entries. All the functional configuration layers on a quantum circuit define its type which can include many other circuits sharing the same configuration layers. Studying the functional configur…
With a two step optimization method of entanglement witness, we analytically propose a set of necessary and sufficient entanglement criteria for four qubit symmetric Greenberger-Horne-Zeilinger (GHZ) diagonal states. The criterion set contains four criteria. Two of them are linear with density matrix elements. The other two criteria are nonlinear with density matrix elements. The criterion set has a nest structure. A proper subset of the criteria is necessary and sufficient for the entanglement of a proper subset of the states. We illustrate the nest structure of criterion set with the general…
How to implement quantum oracle with limited resources raises concerns these days. We design two ancilla-adjustable and efficient algorithms to synthesize SAT-oracle, the key component in solving SAT problems. The previous work takes 2m-1 ancillary qubits and O(m) elementary gates to synthesize an m clauses oracle. The first algorithm reduces the number of ancillary qubits to 2\sqrt{m}, with at most an eightfold increase in circuit size. The number of ancillary qubits can be further reduced to 3 with a quadratic increase in circuit size. The second algorithm aims to reduce the circuit depth. B…
The present work is motivated by the question as to what aspect of correlation entailed by the two-qubit state serves as the appropriate quantitative resource for steering. To this end, considering Bell-diagonal states, suitable measures of simultaneous correlations in two and three complementary (mutually unbiased) bases are identified as the relevant resources for quantum steering. Quantitative relations between appropriate measures of quantum steering and the corresponding measures of simultaneous correlations in complementary bases are demonstrated which ensure that for two qubit steerable…
Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are several methods of simulation proposed by teams at Google and IBM. Here, we present a scheme of simulation which can extract a large amount of measurement outcomes within a short time, achieving a 64-qubit simulation of a universal random circuit of depth 22 using a 128-node cluster, and 56- and 42-qubit circuits on a single PC. We also estimate that a 72-qubit ci…
Simpler encoding and decoding networks are necessary for more reliable quantum error correcting codes (QECCs). The simplification of the encoder-decoder circuit for a perfect five-qubit QECC can be derived analytically if the QECC is converted from its equivalent one-way entanglement purification protocol (1-EPP). In this work, the analytical method to simplify the encoder-decoder circuit is introduced and a circuit that is as simple as the existent simplest circuits is presented as an example. The encoder-decoder circuit presented here involves nine single- and two-qubit unitary operations, o…
Understanding how a stabilizer circuit responds to different input is important to formulating an effective strategy for resource management. In this paper, we further investigate the many ways of using stabilizer operations to generate a single qubit output from a two-qubit state. In particular, by restricting the input to certain product states, we discover probabilistic operations capable of transforming stabilizer circuit outputs back into stabilizer circuit inputs. These secondary operations are ideally suited for recovery purposes and require only one extra resource ancilla to succeed. A…
Given an arbitrary single-qubit operation, an important task is to efficiently decompose this operation into an (exact or approximate) sequence of fault-tolerant quantum operations. We derive a depth-optimal canonical form for single-qubit quantum circuits, and the corresponding rules for exactly reducing an arbitrary single-qubit circuit to this canonical form. We focus on the single-qubit universal H,T basis due to its role in fault-tolerant quantum computing, and show how our formalism might be extended to other universal bases. We then extend our canonical representation to the family of S…
We consider recent works on the simulation of quantum circuits using the formalism of matrix product states and the formalism of contracting tensor networks. We provide simplified direct proofs of many of these results, extending an explicit class of efficiently simulable circuits (log depth circuits with 2-qubit gates of limited range) to the following: let C be any poly sized quantum circuit (generally of poly depth too) on n qubits comprising 1- and 2- qubit gates and 1-qubit measurements (with 2-qubit gates acting on arbitrary pairs of qubit lines). For each qubit line j let D_j be the num…
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 phases as their eigenvalues. We first show that a diagonal-unitary $t$-design generates a $O(1/2^N)$-approximate state $t$-design, where $N$ is the number of qubits. We then discuss a way of improving the degree of approximation by exploiting non-diagonal gates after applying a diagonal-unitary $t$-design. We also show that it is necessary and sufficient to …
Each platonic solid defines a single-qubit positive operator valued measure (POVM) by interpreting its vertices as points on the Bloch sphere. We construct simple circuits for implementing this kind of measurements and other simple types of symmetric POVMs on one qubit. Each implementation consists of a discrete Fourier transform and some elementary quantum operations followed by an orthogonal measurement in the computational basis.
It is known that the partial entanglement/separability violates distributive rules with respect to the operations of taking convex hull and intersection. In this note, we give criteria for three qubit partially entangled states arising from distributive rules, together with the corresponding witnesses. The criteria will be given in terms of diagonal and anti-diagonal entries. They actually characterize those partial entanglement completely when all the entries are zero except for diagonal and anti-diagonal entries. Important states like Greenberger-Horne-Zeilinger diagonal states fall down in …
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of quantum circuits because of their high error rate as compared with single-qubit gates. The controlled-not (CNOT) gate is the typical choice of a two-qubit gate for universal quantum circuit implementation together with the set of single-qubit gates. In this study, we construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT), which i…
We consider the implementation of two-qubit unitary transformations by means of CNOT gates and single-qubit unitary gates. We show, by means of an explicit quantum circuit, that together with local gates three CNOT gates are necessary and sufficient in order to implement an arbitrary unitary transformation of two qubits. We also identify the subset of two-qubit gates that can be performed with only two CNOT gates.
We try to minimize the number of qubits needed to factor an integer of n bits using Shor's algorithm on a quantum computer. We introduce a circuit which uses 2n+3 qubits and O(n^3 lg(n)) elementary quantum gates in a depth of O(n^3) to implement the factorization algorithm. The circuit is computable in polynomial time on a classical computer and is completely general as it does not rely on any property of the number to be factored. Keywords: Factorization, quantum circuits, modular arithmetics
We propose separability criteria for three-qubit states in terms of diagonal and anti-diagonal entries to detect entanglement with positive partial transposes. We report that the phases, that is, the angular parts of anti-diagonal entries, play a crucial role in determining whether a given three-qubit state is separable or entangled, and they must obey even an identity for separability in some cases. These criteria are strong enough to detect PPT (positive partial transpose) entanglement with nonzero volume. In several cases when all the entries are zero except for diagonal and anti-diagonal e…
We show that low-depth random quantum circuits can be efficiently simulated by a quantum teleportation-inspired algorithm. By using logical qubits to redirect and teleport the quantum information in quantum circuits, the original circuits can be renormalized to new circuits with a smaller number of logical qubits. We demonstrate the algorithm to simulate several random quantum circuits, including 1D-chain 1000-qubit 42-depth, 2D-grid 125*8-qubit 42-depth and 2D-Bristlecone 72-qubit 32-depth circuits. Our results present a memory-efficient method with a clear physical picture to simulate low-de…
Superconducting, flux-based qubits are promising candidates for the construction of a large scale quantum computer. We present an explicit quantum mechanical calculation of the coherent behavior of a flux based quantum bit in a noisy experimental environment such as an integrated circuit containing bias and control electronics. We show that non-thermal noise sources, such as bias current fluctuations and magnetic coupling to nearby active control circuits, will cause decoherence of a flux-based qubit on a timescale comparable to recent experimental coherence time measurements.
We propose a protocol to construct the 35 $f$-controlled phase gates of a three-qubit refined Deutsch-Jozsa (DJ) algorithm, by using single-qubit $σ_z$ gates, two-qubit controlled phase gates, and two-target-qubit controlled phase gates. Using this protocol, we discuss how to implement the three-qubit refined DJ algorithm with superconducting transmon qutrits resonantly coupled to a single cavity. Our numerical calculation shows that implementation of this quantum algorithm is feasible within the present circuit QED technique. The experimental realization of this algorithm would be an importan…
We consider a circuit-QED setup that allows the induction and control of non-Markovian dynamics of a qubit. Non-Markovianity is enforced over the qubit by means of its direct coupling to a bosonic mode which is controllably coupled to other qubit-mode system. We show that this configuration can be achieved in a circuit-QED setup consisting of two initially independent superconducting circuits, each formed by one charge qubit and one transmission-line resonator, which are put in interaction by coupling the resonators to a current-biased Josephson junction. We solve this problem exactly and then…
One of the important approaches to detect quantum entanglement is using linear entanglement witnesses EWs. In this paper, by determining the envelope of the boundary hyper-planes defined by a family of linear EWs, a set of powerful nonlinear optimal EWs is manipulated. These EWs enable us to detect some three qubits bound MUB (mutually unbiased bases) diagonal entangled states, i.e., the PPT (positive partial transpose) entangled states. Also, in some particular cases, the introduced nonlinear optimal EWs are powerful enough to separate the bound entangled regions from the separable ones. Fina…
In this paper, we investigate how quantum architectures affect the efficiency of the execution of the quantum Fourier transform (QFT) and linear transformations, which are essential parts of the stabilizer/Clifford group circuits. In particular, we show that in most common and realistic physical architectures including the linear nearest neighbor, two-dimensional lattice, and bounded degree graph (containing a chain of length n), n-qubit QFT and n-qubit stabilizer circuits can be parallelized to linear depth using no auxiliary qubits. We construct lower bounds that show the efficiency of our a…
This paper presents a highly efficient decomposition scheme and its associated Mathematica notebook for the analysis of complicated quantum circuits comprised of single/multiple qubit and qudit quantum gates. In particular, this scheme reduces the evaluation of multiple unitary gate operations with many conditionals to just two matrix additions, regardless of the number of conditionals or gate dimensions. This improves significantly the capability of a quantum circuit analyser implemented in a classical computer. This is also the first efficient quantum circuit analyser to include qudit quantu…
In the paper an approach is presented allowing to model quantum logic circuits by electronic gates for discrete spatially modulated electromagnetic signals. The designed circuitry is for modeling low scale quantum nets of general design and quantum devices based only on superposition principle of their work.
We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary gate if its measurement probabilities depend on the parameters of the gate. A 1-qubit unitary creates such a dependence onto the target qubit, and a CNOT gate copies all the dependences from the control qubit to the target qubit. The complete dependence picture of the output state details the connections qubits may have when being manipulated or measured. Com…
We present a circuit construction for a new fixed-frequency superconducting qubit and show how it can be scaled up to a grid with strictly local interactions. The circuit QED realization we propose implements $σ_z$-type coupling between a superconducting qubit and any number of $LC$ resonators. The resulting \textit{longitudinal coupling} is inherently different from the usual $σ_x$-type \textit{transverse coupling}, which is the one that has been most commonly used for superconducting qubits. In a grid of fixed-frequency qubits and resonators with a particular pattern of always-on interaction…
