相关论文: Efficient Quantum Circuits for Schur and Clebsch-G…

We present a possible candidate of construction of a scalable, uniform and universal quantum network, which is built from quantum gates to elements of quantum circuit, again to quantum subnetworks and finally to an entire quantum network.…

Shor's algorithm for integer factorization offers an exponential speedup over classical methods but remains impractical on Noisy Intermediate Scale Quantum (NISQ) hardware due to the need for many coherent qubits and very deep circuits.…

Due to the scarcity of quantum computing resources, researchers and developers have very limited access to real quantum computers. Therefore, judicious planning and utilization of quantum computer runtime are essential to ensure smooth…

We study the electrodynamics of generic charged particles (bosons, fermions, relativistic or not) constrained to move on an infinite plane. An effective gauge theory in 2+1 dimensional spacetime which describes the real electromagnetic…

Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that…

We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall…

We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as…

This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on…

Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that…

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be…

We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…

Khrushchev's formula is the cornerstone of the so called Khrushchev theory, a body of results which has revolutionized the theory of orthogonal polynomials on the unit circle. This formula can be understood as a factorization of the Schur…

This report continues the discussion of unitary error bases and quantum codes begun in "Non-binary Unitary Error Bases and Quantum Codes". Nice error bases are characterized in terms of the existence of certain characters in a group. A…

Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows…

Random quantum circuits continue to inspire a wide range of applications in quantum information science and many-body quantum physics, while remaining analytically tractable through probabilistic methods. Motivated by an interest in…

Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row…

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to $d$-dimensional quantum units or qudits…

Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm…

We discuss the realization of a universal set of ultrafast single- and two-qubit operations with superconducting quantum circuits and investigate the most relevant physical and technical limitations that arise when pushing for faster and…

Quantum circuit model is the most popular paradigm for implementing complex quantum computation. Based on Cartan decomposition, we show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and…