Many quantum algorithms make use of ancilla, additional qubits used to store temporary information during computation, to reduce the total execution time. Quantum computers will be resource-constrained for years to come so reducing ancilla requirements is crucial. In this work, we give a method to generate ancilla out of idle qubits by placing some in higher-value states, called qudits. We show how to take a circuit with many $O(n)$ ancilla and design an ancilla-free circuit with the same asymptotic depth. Using this, we give a circuit construction for an in-place adder and a constant adder both with $O(\log n)$ depth using temporary qudits and no ancilla.
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier transformed integers have appeared in the literature for two level qubits. Here we extend these techniques on multilevel qudits, as they may offer some advantages relative to qubits implementations. The arithmetic circuits presented can be used as basi…
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm can be extended to a $d$-ary (qudit) quantum system for utilizing the advantage of larger state space, which helps to reduce the run-time of the algorithm as compared to the traditional binary quantum systems. In a qudit quantum system, an $n$-qudit Toffoli gate plays a significant role in the accurate implementation of Grover's algorithm. In this article, a…
Quantum computing promises speedup of classical algorithms in the long term. Current hardware is unable to support this goal and programs must be efficiently compiled to use of the devices through reduction of qubits used, gate count and circuit duration. Many quantum systems have access to higher levels, expanding the computational space for a device. We develop higher level qudit communication circuits, compilation pipelines, and circuits that take advantage of this extra space by temporarily pushing qudits into these higher levels. We show how these methods are able to more efficiently use …
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as well as the NOT gate and multiply-controlled-Z gates, we describe a systematic approach to identifying the set of U(2) rotations required to implement each gate for any qudit of size N and with minimal use of an ancilla level. The qudit gates are analyzed in terms of the total rotation count and gate depth as the system scales with D. We apply the qudit-basi…
Bravyi and Gosset recently gave classical simulation algorithms for quantum circuits dominated by Clifford operations. These algorithms scale exponentially with the number of T-gate in the circuit, but polynomially in the number of qubits and Clifford operations. Here we extend their algorithm to qudits of odd prime dimensions. We generalize their approximate stabilizer rank method for weak simulation to qudits and obtain the scaling of the approximate stabilizer rank with the number of single-qudit magic states. We also relate the canonical form of qudit stabilizer states to Gauss sum evaluat…
This paper concerns the efficient implementation of quantum circuits for qudits. We show that controlled two-qudit gates can be implemented without ancillas and prove that the gate library containing arbitrary local unitaries and one two-qudit gate, CINC, is exact-universal. A recent paper (PRL 94 230502) describes quantum circuits for qudits which require O(d^n) two-qudit gates for state synthesis and O(d^{2n}) two-qudit gates for unitary synthesis, matching the respective lower bound complexities. In this work, we present the state synthesis circuit in much greater detail and prove that it i…
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…
It is important for performance studies in quantum technologies to analyze quantum circuits in the presence of noise. We introduce an error probability tensor, a tool to track generalized Pauli error statistics of qudits within quantum circuits composed of qudit Clifford gates. Our framework is compatible with qudit stabilizer quantum error-correcting codes. We show how the error probability tensor can be applied in the most general case, and we demonstrate an error analysis of bipartite qudit repeaters with quantum error correction. We provide an exact analytical solution of the error statist…
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 construct a classical algorithm that designs quantum circuits for algorithmic quantum simulation of arbitrary qudit channels on fault-tolerant quantum computers within a pre-specified error tolerance with respect to diamond-norm distance. The classical algorithm is constructed by decomposing a quantum channel into a convex combination of generalized extreme channels by optimization of a set of nonlinear coupled algebraic equations. The resultant circuit is a randomly chosen generalized extreme channel circuit whose run-time is logarithmic with respect to the error tolerance and quadratic wi…
Within the general context of the architecture in quantum computer design, this paper aims is to provide a general strategy to obtain a block-matrix representation of quantum gates applied to qubits placed in arbitrary positions over an arbitrary dimensional input state. The model is also extended to the framework of quantum computation with qudits. An application in the context of the quantum computational logic is provided.
The efficient decomposition of multi-controlled gates is a significant factor in quantum compiling, both in circuit depth and T-gate count. Recent work has demonstrated that qudits have the potential to reduce resource requirements from linear to logarithmic depth and to avoid fractional phase rotations. Here we argue, based on the scaling of decoherence in high-index states, that circuit depth is not the primary factor, and that both the choice of entangling gate and interaction network topology act together to determine the spread of errors and ultimate failure rate in a circuit. We further …
A qudit ($d$-level quantum systems) has a large Hilbert space and thus can be used to achieve many quantum information and communication tasks. Here, we propose a method to transfer arbitrary $d$-dimensional quantum states (known or unknown) between two superconducting qudits coupled to a single cavity. The state transfer can be performed fast because of employing resonant interactions only. In addition, quantum states can be deterministically transferred without measurement. Numerical simulations show that high-fidelity transfer of quantum states between two superconducting transmon qudits ($…
The SWAP gate has become an integral feature of quantum circuit architectures and is designed to permute the states of two qubits through the use of the well-known controlled-NOT gate. We consider the question of whether a two-qudit quantum circuit composed entirely from instances of the generalised controlled-NOT gate can be constructed to permute the states of two qudits. Arguing via the signature of a permutation, we demonstrate the impossibility of such circuits for dimensions $d \equiv 3$ (mod 4).
We propose the generalized controlled X (GCX) gate as the two-qudit elementary gate, and based on Cartan decomposition, we also give the one-qudit elementary gates. Then we discuss the physical implementation of these elementary gates and show that it is feasible with current technology. With these elementary gates many important qudit quantum gates can be synthesized conveniently. We provide efficient methods for the synthesis of various kinds of controlled qudit gates and greatly simplify the synthesis of existing generic multi-valued quantum circuits. Moreover, we generalize the quantum Sha…
Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalization leads to quantum computing with hybrid qudits where two or more qudits have different finite dimensions. Advantages of hybrid and d-valued gates (circuits) and their physical realizations have been studied in detail by Muthukrishnan and Stroud (Physical Review A, 052309, 2000), Daboul et al. (J. Phys. A: Math. Gen. 36 2525-2536, 2003), and Bartlett et al (Physical Review A, Vol.65, 052316, 2002). In both cases, a …
Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels
Institute for Advanced Study in Mathematics, Harbin Institute of Technology（哈尔滨工业大学高等研究院）；School of Mathematics, Harbin Institute of Technology（哈尔滨工业大学数学学院）
Manipulation of qudits in optical tables is a difficult and nonscalable task. The use of integrated optical circuits opens new possibilities for the generation, manipulation, and characterization of high dimensional states besides the ease of transmission of these states through an optical fiber. In this work we propose photonic circuits to perform minimum quantum state tomography of path qudits and show how to determine all the constituents parameters of these circuits (beam splitters and phase shifters). Our strategies were based on the symmetries of the involved POVMs (positive operator-val…
We show that the density-matrix states of noncomposite qudit systems satisfy entropic and information relations like the subadditivity condition, strong subadditivity condition, and Araki--Lieb inequality, which characterize hidden quantum correlations of observables associated with these indivisible systems. We derive these relations employing a specific map of the entropic inequalities known for density matrices of multiqudit systems to the inequalities for density matrices of single-qudit systems. We present the obtained relations in the form of mathematical inequalities for arbitrary Hermi…
Low depth measurement-based quantum computation with qudits ($d$-level systems) is investigated and a precise relationship between this powerful model and qudit quantum circuits is derived in terms of computational depth and size complexity. To facilitate this investigation a qudit `unbounded fan-out' circuit model, in which a qudit may be quantum-copied into an arbitrary number of ancillas in a single time-step, is introduced and shown to be capable of implementing interesting $n$-qudit unitaries in constant depth. A procedure for reducing the quantum computational depth in the measurement-ba…
The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental element in the circuit implementation of Shor's algorithm. We consider the problem of generalising the SWAP gate beyond the qubit setting. We show that quantum circuit architectures completely described by instances of the CNOT gate can not implement a transposition of a pair of qudits for dimensions $d \equiv 3 (mod 4)$. The task of constructing generalised …
Although many of works have been done in multivalued quantum logic synthesis, the question whether multivalued quantum circuits are more efficient than the conventional binary quantum circuits is still open. In this article we devote to the optimization of generic multivalued quantum circuits. The multivalued quantum Shannon decompositions (QSD) are improved so that the circuits obtained are asymptotically optimal for all dimensionality d. The syntheses of uniformly multifold controlled $R_y$ rotations are also optimized to make the circuits further simplified. Moreover, the theoretical lower …
Design of a large-scale quantum computer has paramount importance for science and technologies. We investigate a scheme for realization of quantum algorithms using noncomposite quantum systems, i.e., systems without subsystems. In this framework, $n$ artificially allocated "subsystems" play a role of qubits in $n$-qubits quantum algorithms. With focus on two-qubit quantum algorithms, we demonstrate a realization of the universal set of gates using a $d=5$ single qudit state. Manipulation for an ancillary level in the systems allows effective implementation of operators from ${\rm U}(4)$ group …
In this work, we propose three-dimensional photonic circuit designs that guarantee a considerable reduction in the complexity of circuits for the purpose of performing quantum state tomography of N-dimensional path qudits. The POVM (Positive Operator-Valued Measure) chosen in this work ensures that, for odd dimensions, such process is minimal. Our proposal consists of organizing the waveguides that form the circuit as a square array formed by N vertical sectors composed of N waveguides each, arranged in the vertical direction. Based on the symmetry of the chosen POVM, the interferometer acting…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis to a labelling related to the representation theory of the symmetric and unitary groups. If we desire to implement the Schur transform to an accuracy of epsilon, then our circuit construction uses a number of gates which is polynomial in n, d and log(1/epsilon). The important insights we use to perform this construction are the selection of the appropriate s…
Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP g…
Qudit extension of parameterized IQP circuits: A generative quantum machine learning approach to integer data
Parity Quantum Computing Germany GmbH（Parity量子计算德国有限公司）；Parity Quantum Computing GmbH（Parity量子计算有限公司）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）
Based on a microwave-photon quantum processor with two superconducting resonators coupled to one transmon qutrit, we construct the controlled-phase (c-phase) gate on microwave-photon-resonator qudits, by combination of the photon-number-dependent frequency-shift effect on the transmon qutrit by the first resonator and the resonant operation between the qutrit and the second resonator. This distinct feature provides us a useful way to achieve the c-phase gate on the two resonator qudits with a higher fidelity and a shorter operation time, compared with the previous proposals. The fidelity of ou…
We propose a scheme to realize a multiqubit tunable phase gate in a circuit QED setup where two resonators, each coupling with a qudit, are interconnected to a common qudit (d=4). In this proposal, only two levels of each qudit serve as the logical states and the other two levels are used for the gate realization. The proposal is efficient and simple because only a classical microwave pulse is needed, no matter how many qudits are involved, which significantly reduces experimental difficulty. In a nonresonant case, the tunable phase gate can be achieved readily, while under the resonant condit…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood constraint of qubit topology, the implementation of quantum algorithm rightly, is essential for moving information around in a quantum computer. Swapping of qubits using SWAP gate moves the quantum state between two qubits and solves the neighbourhood constraint of qubit topology. Though, one needs to decompose the SWAP gate into three CNOT gates to implement…
