Related papers: Universal quantum computing based on magnetic doma…
Some two qubit interactions are singly sufficient for universal quantum computation but not without the use of an ancilla. Recent schemes for universal quantum computation have focused on hybrid physical systems using ancillae. In them, the…
The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…
Heisenberg spin chains can act as quantum wires transferring quantum states either perfectly or with high fidelity. Gaussian packets of excitations passing through dual rails can encode the two states of a logical qubit, depending on which…
In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
Large-scale fault-tolerant quantum computers of the future will likely be modular by necessity or by design. Modularity is inevitable if the substrate cannot support the desired error-correction code due to its planar geometry or…
We describe how continuous-variable abelian anyons, created on the surface of a continuous-variable analogue of Kitaev's lattice model can be utilized for quantum computation. In particular, we derive protocols for the implementation of…
The implementation of a universal quantum processor still poses fundamental issues related to error mitigation and correction, which demand to investigate also platforms and computing schemes alternative to the main stream. A possibility is…
A set of universal quantum gates is a vital part of the theory of quantum computing, but is absent in the developing theory of Relativistic Quantum Information (RQI). Yet, the Unruh--DeWitt (UDW) detector formalism can be elevated to…
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…
We present a class of hybrid classical systems using quantum co-processors and point out that unlike purely quantum computers, such hybrids can be both universal and Turing complete; we introduce such quantum-classical hybrids as…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We propose a method for implementation of an universal set of one- and two-quantum-bit gates for quantum computation in the system of two coupled electrons with constant non-diagonal exchange interaction. Suppression of the exchange…
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.
Fully convolutional networks are robust in performing semantic segmentation, with many applications from signal processing to computer vision. From the fundamental principles of variational quantum algorithms, we propose a feasible pure…
Quantum computing can be realized with numerous different hardware platforms and computational protocols. A highly promising approach to foster scalability is to apply a photonic platform combined with a measurement-induced quantum…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
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…
The surface code is currently the primary proposed method for performing quantum error correction. However, despite its many advantages, it has no native method to fault-tolerantly apply non-Clifford gates. Additional techniques are…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…