相关论文: Criteria for Exact Qudit Universality

We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…

We construct a family of time-independent nearest-neighbor Hamiltonians coupling eight-state systems on a 1D ring that enables universal quantum computation. Hamiltonians in this family can achieve universality either by driving a…

We prove that universal quantum computation can be realized---using only linear optics and $\chi^{(2)}$ (three-wave mixing) interactions---in any $(n+1)$-dimensional qudit basis of the $n$-pump-photon subspace. First, we exhibit a strictly…

Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…

We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…

Qutrit offers the potential for enhanced quantum computation by exploiting an enlarged Hilbert space. However, the synthesis of high-fidelity and fast qutrit gates, particularly for single qutrit, remains an ongoing challenge, as it…

Quantum computation strongly relies on the realisation, manipulation and control of qubits. A central method for realizing qubits is by creating a double-well potential system with a significant gap between the first two eigenvalues and the…

We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one…

We say that collection of $n$-qudit gates is universal if there exists $N_0\geq n$ such that for every $N\geq N_0$ every $N$-qudit unitary operation can be approximated with arbitrary precision by a circuit built from gates of the…

To implement a set of universal quantum logic gates based on non-Abelian geometric phases, it is a conventional wisdom that quantum systems beyond two levels are required, which is extremely difficult to fulfil for superconducting qubits,…

Hilbert space dimension is a key resource for quantum information processing. A large Hilbert space is not only an essential requirement for quantum error correction, but it can also be advantageous for realizing gates and algorithms more…

An infinite dimensional system such as a quantum harmonic oscillator offers a potentially unbounded Hilbert space for computation, but accessing and manipulating the entire state space requires a physically unrealistic amount of energy.…

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates…

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-not (CNOT), are universal when assisted by arbitrary one-qubit gates, it has only…

We prove the STP=BQP conjecture of Freedman, Hastings and Shokrian-Zini [1], namely that the two-qubit singlet/triplet measurement is quantum computationally universal given only an initial ensemble of maximally mixed single qubits. This…

A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…

Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…

Qudits, generalizations of qubits to multi-level quantum systems, offer enhanced computational efficiency by encoding more information per lattice cell, avoiding costly swap operations and providing even exponential speedup in some cases.…

This dissertation explores quantum computation using qudits encoded into large spins, emphasizing the concept of quantum co-design to harness the unique capabilities of physical platforms for enhanced quantum information processing. First,…