相关论文: Fermionic quantum cellular automata and generalize…
We provide numerical evidence that the quantum Fourier transform can be efficiently represented in a matrix product operator with a size growing relatively slowly with the number of qubits. Additionally, we numerically show that the tensors…
It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two-state, five-neighbor cellular automata which have 1/f-type…
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…
In this work, we investigate the computational aspects of asynchronous cellular automata (ACAs), a modification of cellular automata in which cells update independently, following an asynchronous schedule. We introduce flip automata…
In this paper we study a generalized model named one-way general quantum finite automata} (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
Common wisdom says that the entanglement of fermionic systems can be low in the second quantization formalism but is extremely large in the first quantization. Hence Matrix Product State (MPS) methods based on moderate entanglement have…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
The boundary operator is a linear operator that acts on a collection of high-dimensional binary points (simplices) and maps them to their boundaries. This boundary map is one of the key components in numerous applications, including…
We present a ``natural finitization'' of the fermionic q-series (certain generalizations of the Rogers-Ramanujan sums) which were recently conjectured to be equal to Virasoro characters of the unitary minimal conformal field theory (CFT)…
We investigate the possibility to have electron-pairs in dephasing-free subspace (DFS), by means of the quantum-dot cellular automata (QCA) and single-spin rotations, to carry out a high-fidelity and deterministic universal quantum…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…
Quantum-dot cellular automata (QCAs) offer a diffusive computing paradigm with picosecond transmission speed, making them an ideal candidate for moving diffusive computing to real-world applications. By implementing a trainable associative…
We review and extend the composite fermion theory for semiconductor quantum dots in high magnetic fields. The mean-field model of composite fermions is unsatisfactory for the qualitative physics at high angular momenta. Extensive numerical…
Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for…
We study general quantum integrable Hamiltonians linear in a coupling constant and represented by finite NxN real symmetric matrices. The restriction on the coupling dependence leads to a natural notion of nontrivial integrals of motion and…
In this paper is presented an abstract theory of quantum processors and controllers, special kind of quantum computational network defined on a composite quantum system with two parts: the controlling and controlled subsystems. Such…
As well as arising naturally in the study of non-intersecting random paths, random spanning trees, and eigenvalues of random matrices, determinantal point processes (sometimes also called fermionic point processes) are relatively easy to…
In the spirit of the generalized one-particle density matrix for fermions, we introduce generalized one- and two-particle density matrices to state representability conditions up to second order for boson systems without assuming particle…
We introduce a transformation which allows the fermionization of operators of any one-dimensional spin-chain. This fermionization procedure is independent of any eventual integrable structure and is compatible with it. We illustrate this…