相关论文: Easy Control over Fermionic Computations
A compelling application of quantum computers with thousands of qubits is quantum simulation. Simulating fermionic systems is both a problem with clear real-world applications and a computationally challenging task. In order to simulate a…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
This paper aims to establish second order necessary conditions for optimal control in quantum stochastic systems. We employ a variational approach, analogous to methods in classical stochastic control, to analyze systems governed by quantum…
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…
The establishment of a scalable scheme for quantum computing with addressable and long-lived qubits would be a scientific watershed, harnessing the laws of quantum physics to solve classically intractable problems. The design of many…
We point out that fermionic unitary operators which anticommute among themselves appear in various situations in quantum field theories with anomalies in the Hamiltonian formalism. To illustrate, we give multiple derivations of the fact…
Quantum computing promises substantial speedups by exploiting quantum mechanical phenomena such as superposition and entanglement. Corresponding design methods require efficient means of representation and manipulation of quantum…
We study a fermionic atom optics counterpart of parametric down-conversion with photons. This can be realized through dissociation of a Bose-Einstein condensate of molecular dimers consisting of fermionic atoms. We present a theoretical…
The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are…
Understanding the computational complexity of quantum states is a central challenge in quantum many-body physics. In qubit systems, fermionic Gaussian states can be efficiently simulated on classical computers and hence can be employed as a…
We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and…
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
Fermionic Linear Optics (FLO) is a restricted model of quantum computation which in its original form is known to be efficiently classically simulable. We show that, when initialized with suitable input states, FLO circuits can be used to…
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum…
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in…
Dynamic properties of fermionic systems, like contollability, reachability, and simulability, are investigated in a general Lie-theoretical frame for quantum systems theory. Observing the parity superselection rule, we treat the fully…
Major players in the global aerospace industry are shifting their focus toward achieving net carbon-neutral operations by 2050. A considerable portion of the overall carbon emission reduction is expected to come from new aircraft…
We introduce and review briefly the phenomenon of quantum annealing and analog computation. The role of quantum fluctuation (tunneling) in random systems with rugged (free) energy landscapes having macroscopic barriers are discussed to…
Fermionic atoms in optical lattices provide a native implementation of Fermi-Hubbard (FH) models that can be used as analog quantum simulators of many-body fermionic systems. Recent experimental advances include the time-dependent local…
We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduce the concept of a quantum dictionary as a summation of…