Related papers: Universal quantum computation using fractal symmet…
We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In…
Quantum computation can be performed by encoding logical qubits into the states of two or more physical qubits, and controlling a single effective exchange interaction and possibly a global magnetic field. This "encoded universality"…
Decoherence in realistic quantum platforms motivates a mixed-state notion of topological phases of matter, including average symmetry-protected topological (ASPT) phases. Alongside this progress, generalized symmetries--notably…
Quantum computers promise to perform computations beyond the reach of modern computers with profound implications for scientific research. Due to remarkable technological advances, small scale devices are now becoming available for use. One…
We investigate how to carry out universal quantum computation deterministically with free electrons in decoherence-free subspace by using polarizing beam splitters, charge detectors, and single-spin rotations. Quantum information in our…
Measurement-based quantum computation (MQC) is a leading paradigm for building a quantum computer. Cluster states being used in this context act as one-way quantum computers. Here, we consider Z-states as a type of highly entangled states…
Quantum computing is rapidly advancing toward cloud-based services, raising significant concerns about the privacy and security of computations outsourced to untrusted quantum servers. Universal Blind Quantum Computation (UBQC) protocols…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…
This paper provides necessary and sufficient conditions for constructing a universal quantum computer over continuous variables. As an example, it is shown how a universal quantum computer for the amplitudes of the electromagnetic field…
We introduce group surface codes, which are a natural generalization of the $\mathbb{Z}_2$ surface code, and equivalent to quantum double models of finite groups with specific boundary conditions. We show that group surface codes can be…
We study the quantum criticality at finite temperature for three two-dimensional (2D) $JQ_3$ models using the first principle nonperturbative quantum Monte Carlo calculations (QMC). In particular, the associated universal quantities are…
We propose and fully analyze the simplest technique to date to generate light-based universal quantum computing resources, namely 2D, 3D and, in general, n-hypercubic cluster states. The technique uses two standard optical components:…
Cluster states with higher-dimensional lattices that cannot be physically embedded in three-dimensional space have important theoretical interest in quantum computation and quantum simulation of topologically ordered condensed-matter…
We demonstrate that the spin-2 Affleck-Kennedy-Lieb-Tasaki (AKLT) state on the square lattice is a universal resource for the measurement-based quantum computation. Our proof is done by locally converting the AKLT to two-dimensional random…
Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several…
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in…
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…
One-way quantum computation is a promising approach to achieving universal, scalable, and fault-tolerant quantum computation. However, a main challenge lies in the creation of universal, scalable three-dimensional cluster states. Here, an…
We introduce a class of hybrid quantum circuits, with random unitaries and projective measurements, which host long-range order in the area law entanglement phase of the steady state. Our primary example is circuits with unitaries…