Related papers: Non-Hermitian Computers Need No Complex Numbers
It is well known that the unitary evolution of a closed $M-$level quantum system can be generated by a non-Hermitian Hamiltonian $H$ with real spectrum. Its Hermiticity can be restored via an amended inner-product metric $\Theta$. In…
We develop relativistic non-Hermitian quantum theory and its application to neutrino physics in a strong magnetic field. It is well known, that one of the fundamental postulates of quantum theory is the requirement of Hermiticity of…
In principle, non-Hermitian quantum equations of motion can be formulated using as a starting point either the Heisenberg's or the Schr\"odinger's picture of quantum dynamics. Here it is shown in both cases how to map the algebra of…
This work focuses on reducing the physical cost of implementing quantum algorithms when using the state-of-the-art fault-tolerant quantum error correcting codes, in particular, those for which implementing the T gate consumes vastly more…
In this work we intend to study a class of time-dependent quantum systems with non-Hermitian Hamiltonians, particularly those whose Hermitian counterpart are important for the comprehension of posed problems in quantum optics and quantum…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
We present a simple but general framework for constructing quantum circuits that implement the multiply-controlled unitary $\text{Select}(H) \equiv \sum_\ell |\ell\rangle\langle\ell|\otimes H_\ell$, where $H = \sum_\ell H_\ell$ is the…
We study the computation power of lattices composed of two dimensional systems (qubits) on which translationally invariant global two-qubit gates can be performed. We show that if a specific set of 6 global two qubit gates can be performed,…
Matrix powering is a fundamental computational primitive in linear algebra. It has widespread applications in scientific computing and engineering, and underlies the solution of time-homogeneous linear ordinary differential equations,…
It is imperative that useful quantum computers be very difficult to simulate classically; otherwise classical computers could be used for the applications envisioned for the quantum ones. Perfect quantum computers are unarguably…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
Over the past decade classical optical systems with gain or loss, modelled by non-Hermitian parity-time symmetric Hamiltonians, have been deeply investigated. Yet, their applicability to the quantum domain with number-resolved photonic…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
One of the postulates of quantum mechanics is that the Hamiltonian is Hermitian, as this guarantees that the eigenvalues are real. Recently there has been an interest in asking if $H^\dagger = H$ is a necessary condition, and has lead to…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement…
We demonstrate, that artificial neural networks (ANN) can be trained to emulate single or multiple basic quantum operations. In order to realize a quantum state, we implement a novel "quantumness gate" that maps an arbitrary matrix to the…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…