Related papers: A QCA Layout Design Methodology. Part I
Note: This preprint has been superseded by arXiv:1806.04318. Recent advances in nanotechnology have enabled researchers to control individual quantum mechanical objects with unprecedented accuracy, opening the door for both quantum and…
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…
Variational quantum algorithms, which utilize Parametrized Quantum Circuits (PQCs), are promising tools to achieve quantum advantage for optimization problems on near-term quantum devices. Their PQCs have been conventionally constructed…
There have been several non-axiomatic approaches taken to define Quantum Cellular Automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic definitions. In this work we show that any QCA can be put into the form…
Parameterized quantum circuits (PQCs) play an essential role in the application of variational quantum algorithms (VQAs) in noisy intermediate-scale quantum (NISQ) devices. The PQCs are a leading candidate to achieve a quantum advantage in…
Quantum Approximation Optimization Algorithm (QAOA) is a highly advocated variational algorithm for solving the combinatorial optimization problem. One critical feature in the quantum circuit of QAOA algorithm is that it consists of…
Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
Quantum finite automata (QFAs) literature offers an alternative mathematical model for studying quantum systems with finite memory. As a superiority of quantum computing, QFAs have been shown exponentially more succinct on certain problems…
A scalable quantum information processing architecture based on silicon metal-oxide-semiconductor technology is presented, combining quantum hardware elements from planar and 3D silicon-on-insulator technologies. This architecture is…
The Quantum Approximate Optimization Algorithm (QAOA) is a promising variational algorithm for solving combinatorial optimization problems on near-term devices. However, as the number of layers in a QAOA circuit increases, which is…
We provide a short review of the progress made in the past decade with functional QCD in the description of the phase structure of QCD. We summarise the most important technical aspects of the framework, discuss strategies for truncations…
Quantum walks on lattices can give rise to one-particle relativistic wave equations in the long-wavelength limit. In going to multiple particles, quantum cellular automata (QCA) are natural generalizations of quantum walks. In one spatial…
Quantum process tomography (QPT) is a fundamental task to characterize the dynamics of quantum systems. In contrast to standard QPT, ancilla-assisted process tomography (AAPT) framework introduces an extra ancilla system such that a single…
We formulate a new concept for computing with quantum cellular automata composed of arrays of nanostructured superconducting devices. The logic states are defined by the position of two trapped flux quanta (vortices) in a 2x2…
Quantum state preparation (QSP) is a fundamental task in quantum computing and quantum information processing. It is critical to the execution of many quantum algorithms, including those in quantum machine learning. In this paper, we…
It is NP-complete to find non-negative factors $W$ and $H$ with fixed rank $r$ from a non-negative matrix $X$ by minimizing $\|X-WH^\top\|_F^2$. Although the separability assumption (all data points are in the conical hull of the extreme…
Quantum computing QC emulation is crucial for advancing QC applications, especially given the scalability constraints of current devices. FPGA-based designs offer an efficient and scalable alternative to traditional large-scale platforms,…
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to their classical counterparts. Here, we demonstrate an…
Quantum computing (QC) architectures utilizing classical or coherent resources with Gaussian transformations are classically simulable as an indicator of the lack of QC power. Simple optical set-ups utilizing wave-particle duality and…