We propose a simpler and more efficient scheme for the implementation of the multi-valued Grover's quantum search. The multi-valued search generalizes the original Grover's search by replacing qubits with qudits --- quantum systems of $d$ discrete states. The qudit database is exponentially larger than the qubit database and thus it requires fewer particles to control. The Hadamard gate, which is the key elementary gate in the qubit implementation of Grover's search, is replaced by a $d$-dimensional (complex-valued) unitary matrix $F$, the only condition for which is to have a column of equal moduli elements irrespective of their phases; it can be realized through any physical interaction, which achieves an equal-weight superposition state. An example of such a transformation is the $d$-dimensional discrete Fourier transform, used in earlier proposals; however, its construction is much more costly than that of the far simpler matrix $F$. We present examples of how such a transform $F$ can be constructed in realistic qudit systems in a \emph{single} interaction step.
We consider the problem of time-optimal realization of the quantum Fourier transform gate for a single qudit with number of levels d from 3 to 8. As a qudit the quadrupole nucleus with spin I > 1/2 controlled by NMR is considered. We calculate the dependencies of the gate error on the duration of radio-frequency pulse obtained by numerical optimization using Krotov-based algorithm. It is shown that the dependences of minimum time of QFT gate implementation on qudit dimension are different for integer and half-integer spins.
Quantum state tomography (QST) is an essential tool for characterizing an unknown quantum state. Recently, QST has been performed for entangled qudits based on orbital angular momentum, time-energy uncertainty, and frequency bins. Here, we propose a QST for time-bin qudits, with which the number of measurement settings scales linearly with dimension $d$. Using the proposed scheme, we performed QST for a four-dimensional time-bin maximally entangled state with 16 measurement settings. We successfully reconstructed the density matrix of the entangled qudits, with which the average fidelity of th…
We show that a general linear transformation from one single photon qudit to another, the dimension of which can be either equal or unequal to that of the first one, can be implemented by linear optics. As an application of the scheme we elaborate a method to deterministically realize any finite-element Positive Operator Value Measure (POVM) on single photon signals, which is also generalizable to any quantum system in principle.
Entanglement plays a crucial role in quantum processes particularly those pertaining to quantum information and computation. An analytical expression for an entanglement measure defined in terms of success rate of Grover's search algorithm has been obtained for qutrit systems with real coefficients and the calculated results agree well with the conventional entropy based measure. The entanglement measure is further generalised for qudit (d-level) systems with real coefficients.
Quantum measurements play a fundamental role in quantum mechanics and quantum information processing, but it is not easy to implement generalized measurements, the most powerful measurements allowed by quantum mechanics. Here we propose a simple recipe for implementing generalized measurements on a qudit via quantum walks. With this recipe, any discrete quantum measurement can be implemented via a one-dimensional discrete quantum walk; the number of steps is only two times the number of measurement outcomes. As an illustration, we present a unified solution for implementing arbitrary symmetric…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a circuit decomposition of the QFT for hybrid qudits based on generalized Hadamard and generalized controlled-phase gates, which can be implemented using selective rotations in NMR. We experimentally implement the hybrid qudit QFT on an NMR quantum emulator, which uses four qubits to emulate a single qutrit coupled to two qubits.
We consider a mechanism to generate controllable qudit-qudit interactions in a charge-position paradigm for a quantum computer, through the use of auxiliary states. By controlling the tunneling rates onto these auxiliaries from the qudits proper, we can controllably switch the entangling operations. We consider a practical architecture in which to realize such a computer and examine the associated Hilbert space dimension.
Informationally complete (IC) positive operator-valued measures (POVMs) are generalized quantum measurements that offer advantages over the standard computational basis readout of qubits. For instance, IC-POVMs enable efficient extraction of operator expectation values, a crucial step in many quantum algorithms. POVM measurements are typically implemented by coupling one additional ancilla qubit to each logical qubit, thus imposing high demands on the device size and connectivity. Here, we show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimension…
We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of the dimension N with a certain probability. If the operation is unitary, the probability is in general 1/N^2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of t…
We describe criteria for implementation of quantum computation in qudits. A qudit is a d-dimensional system whose Hilbert space is spanned by states |0>, |1>,... |d-1>. An important earlier work of Mathukrishnan and Stroud [1] describes how to exactly simulate an arbitrary unitary on multiple qudits using a 2d-1 parameter family of single qudit and two qudit gates. Their technique is based on the spectral decomposition of unitaries. Here we generalize this argument to show that exact universality follows given a discrete set of single qudit Hamiltonians and one two-qudit Hamiltonian. The techn…
Autonomous quantum error correction utilizes the engineered coupling of a quantum system to a dissipative ancilla to protect quantum logical states from decoherence. We show that the Knill-Laflamme condition, stating that the environmental error operators should act trivially on a subspace, which then becomes the code subspace, is sufficient for logical qudits to be protected against Markovian noise. It is proven that the error caused by the total Lindbladian evolution in the code subspace can be suppressed up to very long times in the limit of large engineered dissipation, by explicitly deriv…
We discuss the implementation of quantum algorithms for lattice $Φ^4$ theory on circuit quantum electrodynamics (cQED) system. The field is represented on qudits in a discretized field amplitude basis. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates. Considering the set of universal gates formed by the single-qudit phase gate and the displacement gate, we address initial state preparation and single-qudit gate synthesis with variational methods.
Inequality constraints in variational quantum circuits with qudits
Pitaevskii BEC Center, CNR-INO and Dipartimento di Fisica, Università di Trento（特伦托大学物理系）；INFN-TIFPA, Trento Institute for Fundamental Physics and Applications（特伦托基础物理与应用研究所）；Honda Research Institute Europe GmbH（本田欧洲研究院）
Molecular Nanomagnets may enable the implementation of qudit-based quantum error-correction codes which exploit the many spin levels naturally embedded in a single molecule, a promising step towards scalable quantum processors. To fully realize the potential of this approach, a microscopic understanding of the errors corrupting the quantum information encoded in a molecular qudit is essential, together with the development of tailor-made quantum error correction strategies. We address these central points by first studying dephasing effects on the molecular spin qudit produced by the interacti…
By exploiting a symmetric scheme for coupling $N$ spin-1/2 constituents (the physical qubits) to states with total angular momentum $N/2-1$, we construct rotationally invariant logical qudits of dimension $d=N-1$. One can encode all qudit states, and realize all qudit measurements, by this construction. The rotational invariance of all relevant objects enables one to transmit quantum information without having aligned reference frames between the parties that exchange the qudits. We illustrate the method by explicit constructions of reference-frame-free qubits and qutrits and, for the qubit ca…
We present a quantum SWAP gate valid for quantum systems of an arbitrary dimension. The gate generalizes the CNOT implementation of the SWAP gate for qubits and keeps its most important properties, like symmetry and simplicity. We only use three copies of the same controlled qudit gate. This gate can be built with two standard higher-dimensional operations, the Quantum Fourier Transform and the d-dimensional version of the CZ gate.
Demonstration of subspace-search variational quantum eigensolver using photonic orbital angular momentum qudits
Korea Institute of Science and Technology (KIST)（韩国科学技术院）；Korea University of Science and Technology（韩国科学技术院）；Kyung Hee University（庆熙大学）；Gwangju Institute of Science and Technology（光州科学技术院）
One of the main challenges in quantum technologies is the ability to control individual quantum systems. This task becomes increasingly difficult as the dimension of the system grows. Here we propose a general setup for cyclic permutations $X_d$ in $d$ dimensions, a major primitive for constructing arbitrary qudit gates. Using orbital angular momentum states as a qudit, the simplest implementation of the $X_d$ gate in $d$ dimensions requires a single quantum sorter $S_d$ and two spiral phase plates. We then extend this construction to a generalised $X_d(p)$ gate to perform a cyclic permutation…
We demonstrate the relation between a global phase of the quantum gate and the layout of energy levels of its effective Hamiltonian required for implementing the gate for minimum time. By an example of the quantum Fourier transform gate for a qudit represented by a quadrupole nucleus with the spin I = 1, the effective Hamiltonians and minimum implementation times for different global phases are found. Using numerical optimal control methods, the problem of the global phase in searching for the optimal pulse shape is considered in detail for the quantum Fourier transform gate at I = 1, 3/2, 2, …
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…
In this work the quantum random walk search algorithm with walk coin constructed by generalized Householder reflection and phase multiplier has been studied. The coin register is one qudit with arbitrary dimension. Monte Carlo simulations, in combination with supervised machine learning, are used to find walk coins making the quantum algorithm more robust to deviations in the coin's parameters. By applying deep neural network we make prediction for the parameters of an optimal coin with arbitrary size and estimate the stability for such coin.
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well known that any single-qudit unitary can be decomposed into a sequence of Givens rotations on two-dimensional subspaces of the qudit state space. Using a coupling graph to represent physically allowed couplings between pairs of qudit states, we then show that the logical depth of the parallel gate sequence is equal to the height of an associated tree. The imp…
Measurement-device-independent (MDI) method is a way to solve all detector side-channel attacks in quantum key distribution (QKD). However, very little work has been done on experimentally feasible qudit-based MDI-QKD scheme although the famous (qudit-based) round-robin differential-phase-shift (RRDPS) scheme is vulnerable to attacks on uncharacterized detectors. Here we report a mother-of-all QKD protocol on which all provably secure qubit-based QKD schemes known to date including the RRDPS and the so-called Chau15 schemes are based. We also report an experimentally feasible MDI system via op…
Theoretical Quantum Information Processing (QIP) has matured from the use of qubits to the use of qudits (systems having states> 2). Where as most of the experimental implementations have been performed using qubits, little experimental work has been carried out using qudits as yet. In this paper we demonstrate experimental realization of a qutrit system by nuclear magnetic resonance (NMR), utilizing deuterium (spin-1) nuclei partially oriented in liquid crystalline phase. Preparation of pseudopure states and implementation of unitary operations are demonstrated in this single-qutrit system, u…
A new version of quantum hashing technique is developed wherein a quantum hash is constructed as a sequence of single-photon high-dimensional states (qudits). A proof-of-principle implementation of the high-dimensional quantum hashing protocol using orbital-angular momentum encoding of single photons is implemented. It is shown that the number of qudits decreases with increase of their dimension for an optimal ratio between collision probability and decoding probability of the hash. Thus, increasing dimension of information carriers makes quantum hashing with single photons more efficient.
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 …
Fault-Tolerant Resource Comparison of Qudit and Qubit Encodings for Diagonal Quadratic Operators
University of Liverpool（利物浦大学）；Fermi National Accelerator Laboratory（费米国家加速器实验室）；University of Trento（特伦托大学）；INFN-TIFPA Trento Institute of Fundamental Physics and Applications（意大利国家核物理研究所-特伦托基础物理与应用研究所）
A potential quantum internet would open up the possibility of realizing numerous new applications, including provably secure communication. Since losses of photons limit long-distance, direct quantum communication and widespread quantum networks, quantum repeaters are needed. The so-called PLOB-repeaterless bound [Pirandola et al., Nat. Commun. 8, 15043 (2017)] is a fundamental limit on the quantum capacity of direct quantum communication. Here, we analytically derive the quantum-repeater gain for error-corrected, one-way quantum repeaters based on higher-dimensional qudits for two different p…
We propose and demonstrate a quantum key distribution scheme in higher-order $d$-dimensional alphabets using spatial degrees of freedom of photons. Our implementation allows for the transmission of 4.56 bits per sifted photon, while providing improved security: an intercept-resend attack on all photons would induce an error rate of 0.47. Using our system, it should be possible to send more than a byte of information per sifted photon.
We study photon-mediated interactions between molecular spin qudits in the dispersive regime of operation. We derive from a microscopic model the effective interaction between molecular spins, including their crystal field anisotropy (i.e., the presence of non-linear spin terms) and their multi-level structure. Finally, we calculate the long time dynamics for a pair of interacting molecular spins using the method of multiple scales analysis. This allows to find the set of 2-qudit gates that can be realized for a specific choice of molecular spins and to determine the time required for their im…
The generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. Achieving such non-classical high-dimensional resources will potentially unlock enhanced capabilities for quantum cryptography, communication and computation. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based {\it transfer \& accumulate} mechanism involving coin and walker degrees of freedom. The choice of investigating quantum walks is motivated by their generality and versatili…
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…
In this paper, we prove that it is impossible to construct a convariant quantum feedback control instruments which aim to correct the channel noise imposed on an unknown qubit. The proof is based on the searching for the optimal quantum control protocol and it turns out there exist no better %\textit{Complete Positive Trace %Preserving}(CPTP) maps complete positive and covariant quantum operations which provide a higher fidelity than the trivial Identity operators. The generalization of the investigation to bipartite entangled pure state is also included.
We demonstrate, numerically, the possibility of manipulating the spin states of molecular nanomagnets with shaped microwave pulses designed with quantum optimal control theory techniques. The state-to-state or full gate transformations can be performed in this way in shorter times than using simple monochromatic resonant pulses. This enhancement in the operation rates can therefore mitigate the effect of decoherence. The optimization protocols and their potential for practical implementations are illustrated by simulations performed for a simple molecular cluster hosting a single Gd$^{3+}$ ion…
Graph states are generalized from qubits to collections of $n$ qudits of arbitrary dimension $D$, and simple graphical methods are used to construct both additive and nonadditive quantum error correcting codes. Codes of distance 2 saturating the quantum Singleton bound for arbitrarily large $n$ and $D$ are constructed using simple graphs, except when $n$ is odd and $D$ is even. Computer searches have produced a number of codes with distances 3 and 4, some previously known and some new. The concept of a stabilizer is extended to general $D$, and shown to provide a dual representation of an addi…
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)（科技研究局高性能计算研究所）
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 …
