Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain oracle function by just one query, instead of the $2^{n-1}+1$ queries required by classical means. The given algorithm for two qudits also solves efficiently the Bernstein-Vazirani problem. Entanglement does not occur at any step of the computation.
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 …
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…
This paper demonstrates the use of entanglement resources in quantum speedup by presenting an algorithm which is the generalization of an algorithm proposed by Goswami and Panigrahi [arXiv:1706.09489 (2017)]. We generalize the algorithm and show that it provides deterministic solutions having an advantage over classical algorithm. The algorithm answers the question of whether a given function is constant or balanced and whether two functions are equal or unequal. Finally, we experimentally verify the algorithm by using IBM's five-qubit quantum computer with a high fidelity.
A quantum algorithm to solve the parity problem is better than its most efficient classical counter- part with a separation that is polynomial in the number of queries. This was shown by E. Bernstein and U. Vazirani and was one of the earliest indications that the quantum information processing can outperform the classical one by a significant margin. The problem and its solution both is usually stated for a 2-level system since we generally work with bits/qubits. However, many works have been done generalizing known quantum computing techniques to higher level systems. Following this, we look…
Qudit toric codes are a natural higher-dimensional generalization of the well-studied qubit toric code. However standard methods for error correction of the qubit toric code are not applicable to them. Novel decoders are needed. In this paper we introduce two renormalization group decoders for qudit codes and analyze their error correction thresholds and efficiency. The first decoder is a generalization of a "hard-decisions" decoder due to Bravyi and Haah [arXiv:1112.3252]. We modify this decoder to overcome a percolation effect which limits its threshold performance for high dimensions. The s…
Generalizations of the classic Bell inequality to higher dimensional quantum systems known as qudits are reputed to exhibit a higher degree of robustness to noise, but such claims are based on one particular noise model. We analyze the violation of the Collins-Gisin-Linden-Massar-Popescu inequality subject to more realistic noise sources and their scaling with dimension. This analysis is inspired by potential Bell inequality experiments with superconducting resonator-based qudits. We find that the robustness of the inequality to noise generally decreases with increasing qudit dimension.
For qubits, Monte Carlo estimation of the average fidelity of Clifford unitaries is efficient -- it requires a number of experiments that is independent of the number $n$ of qubits and classical computational resources that scale only polynomially in $n$. Here, we identify the requirements for efficient Monte Carlo estimation and the corresponding properties of the measurement operator basis when replacing two-level qubits by $p$-level qudits. Our analysis illuminates the intimate connection between mutually unbiased measurements and the existence of unitaries that can be characterized efficie…
In the {\em distributed Deutsch-Jozsa promise problem}, two parties are to determine whether their respective strings $x,y\in\{0,1\}^n$ are at the {\em Hamming distance} $H(x,y)=0$ or $H(x,y)=\frac{n}{2}$. Buhrman et al. (STOC' 98) proved that the exact {\em quantum communication complexity} of this problem is ${\bf O}(\log {n})$ while the {\em deterministic communication complexity} is ${\bf Ω}(n)$. This was the first impressive (exponential) gap between quantum and classical communication complexity. In this paper, we generalize the above distributed Deutsch-Jozsa promise problem to determin…
Joint Center for Quantum Information and Computer Science, NIST/University of Maryland（量子信息与计算联合中心，美国国家标准与技术研究院/马里兰大学）；Joint Quantum Institute, NIST/University of Maryland（联合量子研究所，美国国家标准与技术研究院/马里兰大学）；Department of Physics, University of Maryland（马里兰大学物理系）；Centre for Quantum Technologies, National University of Singapore（新加坡国立大学量子技术中心）；Nanyang Quantum Hub, School of Physical and Mathematical Sciences, Nanyang Technological University（南洋理工大学理学院南洋量子枢纽）；Quantum Research Center, Technology Innovation Institute（技术创新研究所量子研究中心）；Institute for Infocomm Research (I 2 R), Agency for Science, Technology and Research (A*STAR)（科技研究局信息通信研究所）；Quantum Innovation Centre (Q.InC), Agency for Science, Technology and Research (A*STAR)（科技研究局量子创新中心）；Institute of High Performance Computing (IHPC), Agency for Science, Technology and Research (A*STAR)（科技研究局高性能计算研究所）
This note presents a simple and unified formulation of the most fundamental structures used in quantum information with qubits, arbitrary dimension qudits, and quantum continuous variables. This \emph{general quantum variables} construction provides a succinct language for formulating many results in quantum computation and information so that they are applicable in all dimensions. The structures included within this formalism include: a generalization to arbitrary dimension of the three Pauli operators, and the associated mutually unbiased bases; the Pauli and Clifford groups; many important …
Geometrical Bell Inequalities (GBIs) are the strongest known Bell inequalities for collections of qubits. However, their generalizations to other systems is not yet fully understood. We formulate GBIs for an arbitrary number $N$ of observers, each of which possesses a particle of an arbitrary dimension $d$. The whole $(d-1)$-parameter family of local observables with eigenbases unbiased to the computational basis is used, but it is immediate to use a discrete subset of them. We argue analytically for qutrits and numerically for other systems that the violations grows exponenetially with $N$. W…
We consider the problem of establishing entangled states of optimal singlet fraction and negativity between two remote parties for every use of a noisy quantum channel and trace-preserving LOCC under the assumption that the parties do not share prior correlations. We show that for a family of quantum channels in every finite dimension $d\geq3$, one-shot optimal singlet fraction and entanglement negativity are attained only with appropriate nonmaximally entangled states. We further show that the generalization of the formula that exactly computes one-shot optimal singlet fraction for qubit chan…
Hypergraph states, a generalization of graph states, constitute a large class of quantum states with intriguing non-local properties and have promising applications in quantum information science and technology. In this paper, we generalize hypergraph states to qudit hypergraph states, i.e., each vertex in the generalized hypergraph (multi-hypergraph) represents a $d$-level quantum system instead of a qubit. It is shown that multi-hypergraphs and $d$-level hypergraph states have a one-to-one correspondence. We prove that if one part of a multi-hypergraph is connected with the other part, the c…
I generalize the concept of balancedness to qudits with arbitrary dimension $d$. It is an extension of the concept of balancedness in New J. Phys. {\bf 12}, 075025 (2010) [1]. At first, I define maximally entangled states as being the stochastic states (with local reduced density matrices $\id/d$ for a $d$-dimensional local Hilbert space) that are not product states and show that every so-defined maximal genuinely multi-qudit entangled state is balanced. Furthermore, all irreducibly balanced states are genuinely multi-qudit entangled and are locally equivalent with respect to $SL(d)$ transform…
New inequalities for tomographic probability distributions and density matrices of qutrit states are obtained by means of generalization of qubit portrait method. The approach based on the qudit portrait method to get new entropic inequalities is proposed. It can be applied to the case of arbutrary nonnegative hermitian matrices including the density matrices of multipartite qudit states.
We use a categorical topological semantics to examine the Deutsch-Jozsa, hidden subgroup and single-shot Grover algorithms. This reveals important structures hidden by conventional algebraic presentations, and allows novel proofs of correctness via local topological operations, giving for the first time a satisfying high-level explanation for why these procedures work. We also investigate generalizations of these algorithms, providing improved analyses of those already in the literature, and a new generalization of the single-shot Grover algorithm.
Quantum superpositions of coherent states are produced both in microwave and optical domains, and are considered realizations of the famous "Schrödinger cat" state. The recent progress shows an increase in the number of components and the number of modes involved. Our work creates a theoretical framework for treatment of multicomponent two-mode Schrödinger cat states. We consider a class of single-mode states, which are superpositions of $N$ coherent states lying on a circle in the phase space. In this class we consider an orthonormal basis created by rotationally-invariant circular states (RI…
We analyze a class of 2-qudit circulant states. They define generalization of well known 2-qubit X-states. We formula the necessary and sufficient criteria for vanishing quantum discord. We illustrate our analysis by an important subclass of circulant states -- so called Bell diagonal states.
We define and study parafermion stabilizer codes which can be viewed as generalizations of Kitaev's one dimensional model of unpaired Majorana fermions. Parafermion stabilizer codes can protect against low-weight errors acting on a small subset of parafermion modes in analogy to qudit stabilizer codes. Examples of several smallest parafermion stabilizer codes are given. A locality preserving embedding of qudit operators into parafermion operators is established which allows one to map known qudit stabilizer codes to parafermion codes. We also present a local 2D parafermion construction that co…
We advocate the step change in properties of discrete $d$-level quantum systems, between $d=2$ and $d\geq 3$. Qubit systems, or multipartite systems containing qubit subsystem, are exceptional in their relative simplicity. One faces a step in complexity in valuating measures of quantum correlations for qutrits and then other higher dimensional qudits. There is a growing number of arguments leading to such conclusion: recently found no-go theorem for generalization of the Peres-Horodecki's PPT criterion \cite{sko}, change in geometry of state spaces of qubit and higher degree qudits (the so cal…
In this study, we develop a semi-analytical framework to solve generalized Jaynes-Tavis-Cummings Hamiltonians describing multi-qudit systems coupled via EM resonators. Besides the multi-level generalization we allow for an arbitrary number of resonators and/or modes, with nonidentical couplings to the qudits. Our method is based on generic excitation-number operators which commute with the respective Hamiltonians in the rotating wave approximation (RWA). The validity of the RWA is assessed explicitly. The formalism enables the study of eigenstates, eigenenergies and corresponding time evolutio…
Superconducting quantum circuits, such as the superconducting phase qubit, have multiple quantum states that can interfere with ideal qubit operation. The use of multiple frequency control pulses, resonant with the energy differences of the multi-state system, is theoretically explored. An analytical method to design such control pulses is developed, using a generalization of the Floquet method to multiple frequency controls. This method is applicable to optimizing the control of both superconducting qubits and qudits, and is found to be in excellent agreement with time-dependent numerical sim…
We propose a generalization of the Wasserstein distance of order 1 to the quantum states of $n$ qudits. The proposal recovers the Hamming distance for the vectors of the canonical basis, and more generally the classical Wasserstein distance for quantum states diagonal in the canonical basis. The proposed distance is invariant with respect to permutations of the qudits and unitary operations acting on one qudit and is additive with respect to the tensor product. Our main result is a continuity bound for the von Neumann entropy with respect to the proposed distance, which significantly strengthe…
Symmetry-enriched topological order and quasifractonic behavior in $\mathbb{Z}_N$ stabilizer codes
Institute of Theoretical Physics, Chinese Academy of Sciences（中国科学院理论物理研究所）；School of Physical Sciences, University of Chinese Academy of Sciences（中国科学院大学物理科学学院）
Heralded near-deterministic multi-qubit controlled phase gates with integrated error detection have recently been proposed by Borregaard et al. [Phys. Rev. Lett. 114, 110502 (2015)]. This protocol is based on a single four-level atom (a heralding quartit) and $N$ three-level atoms (operational qutrits) coupled to a single-resonator mode acting as a cavity bus. Here we generalize this method for two distant resonators without the cavity bus between the heralding and operational atoms. Specifically, we analyze the two-qubit controlled-Z gate and its multi-qubit-controlled generalization (i.e., a…
Geometric relations between separable and entangled two-qubit and two-qutrit quantum information states are studied. To characterize entanglement of two qubit states, we establish a relation between reduced density matrix and the concurrence. For the rebit states, the geometrical meaning of concurrence as double area of a parallelogram is found and for generic qubit states it is expressed by determinant of the complex Hermitian inner product metric, where reduced density matrix coincides with the inner product metric. In the case of generic two-qutrit state, for reduced density matrix we find …
We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Op- erations are performed on these by exchanging the anyons. One might argue that, in order to have as many simple single qubit operations as possible, the number of anyons per group should be maximized. However, we show that there is a maximal number of particles per qubit, namely 4, and more generally a maximal number of particles for qudits of dimension d. We also look at the possibility of having topological qubits for which o…
