相关论文: Classical simulation of noninteracting-fermion qua…
We offer an alternative to the conventional network formulation of quantum computing. We advance the analog approach to quantum logic gate/circuit construction. As an illustration, we consider the spatially extended NOT gate as the first…
We study the classical simulability of a polynomial-size quantum circuit $C_n$ on $n$ qubits followed by sparse classical post-processing (SCP) on $m$ bits, where $m \leq n \leq {\rm poly}(m)$. The SCP is described by a non-zero Boolean…
The structure and dynamics of quantum many-body systems are the result of a delicate interplay between underlying interactions, which leads to intricate entanglement structures. Despite this apparent complexity, symmetries emerge and have…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
We identify a broad class of physical processes in an optical quantum circuit that can be efficiently simulated on a classical computer: this class includes unitary transformations, amplification, noise, and measurements. This…
One-dimensional quantum systems admit duality relations that put hard core spinless bosons and fermions in one-to-one correspondence via Girardeau's mapping theorem. The simplest models of soft bosons interacting via zero-range potentials…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
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…
The possibility of interaction-free measurements and counterfactual computations is a striking feature of quantum mechanics pointed out around 20 years ago. We implement such phenomena in actual 5-qubit, 15-qubit and 20-qubit IBM quantum…
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a full quantum programming language in which entanglement, duplication, and recursion are all available. Our model comes with a…
Most modern classical processors support so-called von Neumann architecture with program and data registers. In present work is revisited similar approach to models of quantum processors. Deterministic programmable quantum gate arrays are…
Quantum simulation is a rapidly evolving tool with great potential for research at the frontiers of physics, and is particularly suited to be used in computationally intensive lattice simulations, such as problems with non-equilibrium. In…
A quantum simulator is a device engineered to reproduce the properties of an ideal quantum model. It allows the study of quantum systems that cannot be efficiently simulated on classical computers. While a universal quantum computer is also…
Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the…
With a focus on universal quantum computing for quantum simulation, and through the example of lattice gauge theories, we introduce rather general quantum algorithms that can efficiently simulate certain classes of interactions consisting…
Quantum Algebras (q-algebras) are used to describe interactions between fermions and bosons. Particularly, the concept of a su_q(2) dynamical symmetry is invoked in order to reproduce the ground state properties of systems of fermions and…
Classical simulations of quantum computations are vital for the future development of this emerging technology. To this end, decision diagrams have been proposed as a complementary technique which frequently allows to tackle the inherent…
Fermionic Gaussian circuits can be simulated efficiently on a classical computer, but become universal when supplemented with non-Gaussian operations. Similar to stabilizer circuits augmented with non-stabilizer resources, these…
We consider quantum spin chains with a hidden free fermionic structure, distinct from the Jordan-Wigner transformation and its generalizations. We express selected local operators with the hidden fermions. This way we can exactly solve the…
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qubit basis-changing gate -- commonly chosen to be the…