相关论文: Climbing Mount Scalable: Physical-Resource Require…
In this paper, we demonstrate the equivalence between the complex Hilbert space and real Kahler space formulations of quantum mechanics. Complex numbers play an important role in the traditional formulation of quantum mechanics in complex…
Quantum computers can potentially provide an unprecedented speed-up with respect to traditional computers. However, a significant increase in the number of quantum bits (qubits) and their performance is required to demonstrate such quantum…
By taking the need for quantum reference frames into account, it is shown that Hilbert-space factorization is a dissipative process requiring on the order of kT to reduce by one bit an observer's uncertainty in the provenance of a…
In measurement-based quantum computation (MBQC), a special highly-entangled state (called a resource state) allows for universal quantum computation driven by single-qubit measurements and post-measurement corrections. Physical realisations…
The characterization of quantum processes is a key tool in quantum information processing tasks for several reasons: on one hand, it allows to acknowledge errors in the implementations of quantum algorithms; on the other, it allows to…
Realizing a large-scale quantum computer requires hardware platforms that can simultaneously achieve universality, scalability, and fault tolerance. As a viable pathway to meeting these requirements, quantum computation based on…
We study the possibility to describe pure quantum states and evens with classical probability distributions and conditional probabilities and show that the distributions and/or conditional probabilities have to assume negative values,…
A computer, in order to perform a given computation, requires a certain amount of space (memory) and a certain amount of time (runtime). This leaves certain computations beyond reach due to technological limits on processing speed and…
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for…
Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…
In this paper we present a model of Riemannian loop quantum cosmology with a self-adjoint quantum scalar constraint. The physical Hilbert space is constructed using refined algebraic quantization. When matter is included in the form of a…
Geometric Algebra and Calculus are mathematical languages encoding fundamental geometric relations that theories of physics seem to respect. We propose criteria given which statistics of expressions in geometric algebra are computable in…
Over the last few decades, developments in the physical limits of computing and quantum computing have increasingly taught us that it can be helpful to think about physics itself in computational terms. For example, work over the last…
The parameters of a quantum system grow exponentially with the number of involved quantum particles. Hence, the associated memory requirement goes well beyond the limit of best classic computers for quantum systems composed of a few dozen…
Nowadays, quantum computing has reached the engineering phase, with fully-functional quantum processors integrating hundred of noisy qubits available. Yet -- to fully unveil the potential of quantum computing out of the labs and into…
A quantum theory in a finite-dimensional Hilbert space can be geometrically formulated as a proper Hamiltonian theory as explained in [2, 3, 7, 8]. From this point of view a quantum system can be described in a classical-like framework…
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…
Quantum computers promise to enhance machine learning for practical applications. Quantum machine learning for real-world data has to handle extensive amounts of high-dimensional data. However, conventional methods for measuring quantum…
General relativity and quantum mechanics are incompatible at the Planck scale. This contention can be examined if a quantum computer is set to operate at a rate that exceeds the classical limit of one operation per Planck volume-time, or…
We propose a measurement-based model for fault-tolerant quantum computation that can be realised with one-dimensional cluster states and fusion measurements only; basic resources that are readily available with scalable photonic hardware.…