Related papers: A Universal Quantum Circuit Design for Periodical …
In this paper, we present the experimental realization of multi-qubit gates $% \Lambda_n(not) $ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
We introduce a discrete Q-function of N qubit system projected into the space of symmetric measurements as a tool for analyzing general properties of quantum systems in the macroscopic limit. For known states the projected Q-function helps…
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
The $n$-time correlation function is pivotal for establishing connections between theoretical predictions and experimental observations of a quantum system. Conventional methods for computing $n$-time correlation functions on quantum…
Elucidating a connection with nonlinear Fourier analysis, we extend a well known algorithm in quantum signal processing to represent measurable signals by square summable sequences. Each coefficient of the sequence is Lipschitz continuous…
By encoding a qudit in a harmonic oscillator and investigating the infinite limit, we give an entirely new realization of continuous-variable quantum computation. The generalized Pauli group is generated by number and phase operators for…
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit…
Finite-capacity single-server queues with general service-time distributions form the backbone of numerous real-world systems, yet classical simulation of performance metrics such as blocking probabilities and delay becomes computationally…
Photons are a natural resource in quantum information, and the last decade showed significant progress in high-quality single photon generation and detection. Furthermore, photonic qubits are easy to manipulate and do not require…
In order to evaluate, validate, and refine the design of new quantum algorithms or quantum computers, researchers and developers need methods to assess their correctness and fidelity. This requires the capabilities of quantum circuit…
To build a general-purpose quantum computer, it is crucial for the quantum devices to implement classical boolean logic. A straightforward realization of quantum boolean logic is to use auxiliary qubits as intermediate storage. This…
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for translation of bigger unitary gates into elementary quantum operations,…
Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, which are typically easily implementable, and two-qubit entangling gates, whose faithful implementation remains one of the…
All-to-all interactions arise naturally in many areas of theoretical physics and across diverse experimental quantum platforms, motivating a systematic study of their information-processing power. Assuming each pair of qubits interacts with…
Today's quantum computers operate with a binary encoding that is the quantum analog of classical bits. Yet, the underlying quantum hardware consists of information carriers that are not necessarily binary, but typically exhibit a rich…
In this work, we propose a framework in the form of a Python package, specifically designed for the analysis of Quantum Machine Learning models. This framework is based on the PennyLane simulator and facilitates the evaluation and training…
Wiring diagrams are given for a quantum algorithm processor in CMOS to compute, in parallel, all divisors of an n-bit integer. Lines required in a wiring diagram are proportional to n. Execution time is proportional to the square of n.
Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…