Related papers: Quantum Simulations Based on Parameterized Circuit…
In this paper, we describe a parameterized quantum circuit that can be considered as convolutional and pooling layers for graph neural networks. The circuit incorporates the parameterized quantum Fourier circuit where the qubit connections…
The barren plateau phenomenon, where the gradients of parametrized quantum circuits become vanishingly small, poses a significant challenge in quantum machine learning. While previous studies attempted to explain the barren plateau…
Developing methods to accurately characterize and mitigate the impact of noise is crucial for enhancing the fidelity of quantum simulations on Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we present a circuit…
Pseudo-unitary circuits are recurring in both S-matrix theory and analysis of No-Go theorems. We propose a matrix and diagrammatic representation for the operation that maps S-matrices to T-matrices and, consequently, a unitary group to a…
Over a decade ago, it was demonstrated that quantum computing has the potential to revolutionize numerical linear algebra by enabling algorithms with complexity superior to what is classically achievable, e.g., the seminal HHL algorithm for…
We provide a new algorithm that translates a unitary matrix into a quantum circuit according to the G=KAK theorem in Lie group theory. With our algorithm, any matrix decomposition corresponding to type-AIII KAK decompositions can be derived…
We propose an algorithm for variational quantum algorithms (VQAs) to optimize the structure of parameterized quantum circuits (PQCs) efficiently. The algorithm optimizes the PQC structure on-the-fly in VQA by sequentially replacing a…
The emergence of the Barren Plateau phenomenon poses a significant challenge to quantum machine learning. While most Barren Plateau analyses focus on single-qubit rotation gates, the gradient behavior of Parameterized Quantum Circuits built…
We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in…
Quantum algorithms are usually described as monolithic circuits, becoming large at modest input size. Near-term quantum architectures can only manage a small number of qubits. We develop an automated method to distribute quantum circuits…
We define syntax and semantics of quantum circuits, allowing measurement gates and classical channels. We define circuit-based quantum algorithms and prove that, semantically, any such algorithm is equivalent to a single measurement that…
Whether parameterized quantum circuits (PQCs) can be systematically constructed to be both trainable and expressive remains an open question. Highly expressive PQCs often exhibit barren plateaus, while several trainable alternatives admit…
To assess whether a gate-based quantum algorithm can be executed successfully on a noisy intermediate-scale quantum (NISQ) device, both complexity and actual value of quantum resources should be considered carefully. Based on quantum phase…
A longstanding computational challenge is the accurate simulation of many-body particle systems. Especially for deriving key characteristics of high-impact but complex systems such as battery materials and high entropy alloys (HEA). While…
A quantum computing simulation provides the opportunity to explore the behaviors of quantum circuits, study the properties of quantum gates, and develop quantum computing algorithms. Simulating quantum circuits requires geometric time and…
We propose a method for quantum computation which uses control of spin-orbit coupling in a linear array of single electron quantum dots. Quantum gates are carried out by pulsing the exchange interaction between neighboring electron spins,…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
We show that any quantum circuit of treewidth $t$, built from $r$-qubit gates, requires at least $\Omega(\frac{n^{2}}{2^{O(r\cdot t)}\cdot \log^4 n})$ gates to compute the element distinctness function. Our result generalizes a…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
Error mitigation is essential for near-term quantum devices, and two promising techniques are universal frame randomization and Randomized Compilation. These methods insert random twirling gates into a circuit to reduce errors while…