Related papers: A dynamical implementation of canonical second qua…
This is a self-contained and hopefully readable account on the method of creation and annihilation operators (also known as the Fock space representation or the "second quantization" formalism) for non-relativistic quantum mechanics of many…
The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…
A binary mapping from Fock space of bosonic state to qubits is given. Based on the binary mapping, we construte an algorithm of qubitization of bosons with complexity O(log(N)). As an example, the algorithm of qubitization of bosons in…
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements.…
The first prototypes of quantum computers sparked interest in quantum computing and the basic principles of quantum mechanics. The education project on the physical bases of quantum computing is part of this context, based on the…
Dissipation and irreversibility are central to most physical processes, yet they lead to non-unitary dynamics that are challenging to realise on quantum processors. High-order operator splitting is an attractive approach for simulating…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
While many classical algorithms rely on Laplace transforms, it has remained an open question whether these operations could be implemented efficiently on quantum computers. In this work, we introduce the Quantum Laplace Transform (QLT),…
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…
A new model of a Quantum Automaton (QA), working with qubits is proposed. The quantum states of the automaton can be pure or mixed and are represented by density operators. This is the appropriated approach to deal with measurements and…
To simulate a fermionic system on a quantum computer, it is necessary to encode the state of the fermions onto qubits. Fermion-to-qubit mappings such as the Jordan-Wigner and Bravyi-Kitaev transformations do this using $N$ qubits to…
Quantum computing has been increasingly applied in nuclear physics. In this work, we combine quantum computing with the complex scaling method to address the resonance problem. Due to the non-Hermiticity introduced by complex scaling,…
The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…
Quantum process characterization is a fundamental task in quantum information processing, yet conventional methods, such as quantum process tomography, require prohibitive resources and lack scalability. Here, we introduce an efficient…
Quantum simulation promises to address many challenges in fields ranging from quantum chemistry to material science, and high-energy physics, and could be implemented in noisy intermediate-scale quantum devices. A challenge in building good…
A universal quantum simulator would enable efficient simulation of quantum dynamics by implementing quantum-simulation algorithms on a quantum computer. Specifically the quantum simulator would efficiently generate qubit-string states that…
The variational quantum eigensolver is one of the most promising algorithms for near-term quantum computers. It has the potential to solve quantum chemistry problems involving strongly correlated electrons, which are otherwise difficult to…
Recently it has been shown that time-optimal quantum computation is attained by using the Cartan decomposition of a unitary matrix. We extend this approach by noting that the unitary group is compact. This allows us to reduce the execution…