相关论文: Quantum Holonomies for Quantum Computing
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 computation is a novel way of information processing which allows, for certain classes of problems, exponential speedups over classical computation. Various models of quantum computation exist, such as the adiabatic, circuit and…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Holonomic quantum computation uses non-Abelian geometric phases to realize error resilient quantum gates. Nonadiabatic holonomic gates are particularly suitable to avoid unwanted decoherence effects, as they can be performed at high speed.…
We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…
Geometric phases induced in quantum evolutions have built-in noise-resilient characters, and thus can find applications in many robust quantum manipulation tasks. Here, we propose a feasible and fast scheme for universal quantum computation…
We demonstrate how Quantum Cognition Machine Learning (QCML) encodes data as quantum geometry. In QCML, features of the data are represented by learned Hermitian matrices, and data points are mapped to states in Hilbert space. The quantum…
We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach that is shown to allow for universal quantum computing. The variational quantum circuit consists of tunable…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…
Quantum control in large dimensional Hilbert spaces is essential for realizing the power of quantum information processing. For closed quantum systems the relevant input/output maps are unitary transformations, and the fundamental challenge…
Bosonic codes utilize the infinite-dimensional Hilbert space of harmonic oscillators to encode quantum information, offering a hardware-efficient approach to quantum error correction. Designing these codes requires precise geometric…
Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast,…
In holonomic quantum computation, single-qubit gates are performed using driving protocols that trace out closed loops on the Bloch sphere, making them robust to certain pulse errors. However, dephasing noise that is transverse to the…
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.…
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
Quantum computation with quantum gates induced by geometric phases is regarded as a promising strategy in fault tolerant quantum computation, due to its robustness against operational noises. However, because of the parametric restriction…