English
Related papers

Related papers: Efficient quantum circuits for high-dimensional re…

200 papers

A method is developed to construct irreducible representations(irreps) of the quantum supergroup $U_q(C(n+1))$ in a systematic fashion. It is shown that every finite dimensional irrep of this quantum supergroup at generic $q$ is a…

High Energy Physics - Theory · Physics 2009-10-22 R. B. Zhang

We propose a realizable architecture using one-dimensional transmission line resonators to reach the strong coupling limit of cavity quantum electrodynamics in superconducting electrical circuits. The vacuum Rabi frequency for the coupling…

Mesoscale and Nanoscale Physics · Physics 2007-05-23 S. M. Girvin , Ren-Shou Huang , Alexandre Blais , Andreas Wallraff , R. J. Schoelkopf

Qudits naturally correspond to multi-level quantum systems, which offer an efficient route towards quantum information processing, but their reliability is contingent upon quantum error correction capabilities. In this paper, we present a…

Quantum Physics · Physics 2024-10-04 Robert Frederik Uy , Dorian A. Gangloff

The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this algorithm depends crucially on the ability to…

We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…

Quantum Physics · Physics 2009-04-21 Stephen P. Jordan

This work presents an optimization-based scalable quantum neural network framework for approximating $n$-qubit unitaries through generic parametric representation of unitaries, which are obtained as product of exponential of basis elements…

Quantum Physics · Physics 2024-01-17 Rohit Sarma Sarkar , Bibhas Adhikari

We study quantum systems with even numbers N of levels that are completely state-controlled by unitary transformations generated by Lie algebras isomorphic to sp(N) of dimension N(N+1)/2. These Lie algebras are smaller than the respective…

Quantum Physics · Physics 2009-11-13 R. Cabrera , C. Rangan , W. E. Baylis

Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…

We describe an alternative approach to quantum computation that is ideally suited for today's sub-threshold-fidelity qubits, and which can be applied to a family of hardware models that includes superconducting qubits with tunable coupling.…

Quantum Physics · Physics 2011-03-17 Andrei Galiautdinov , Michael R. Geller

Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically…

Quantum Physics · Physics 2026-04-21 Aditya Sodhani , Keshab K. Parhi

Using the circulant symmetry of a Hamiltonian describing three qubits, we realize the quantum Fourier transform. This symmetry allows us to construct a set of eigenvectors independently on the magnitude of physical parameters involved in…

Quantum Physics · Physics 2023-04-05 Mouhcine Yachi , Radouan Hab-arrih , Ahmed Jellal

For years, the quantum/reversible circuit community has been convinced that: a) the addition of auxiliary qubits is instrumental in constructing a smaller quantum circuit; and, b) the introduction of quantum gates inside reversible circuits…

Quantum Physics · Physics 2011-08-01 Dmitri Maslov , Mehdi Saeedi

Although near-term quantum computing devices are still limited by the quantity and quality of qubits in the so-called NISQ era, quantum computational advantage has been experimentally demonstrated. Moreover, hybrid architectures of quantum…

Two different algorithms are presented for generating a quantum circuit realization of a matrix representing a permutation on $2^n$ letters. All circuits involve $n$ qubits and only use multi--controlled Toffoli gates. The first algorithm…

Quantum Physics · Physics 2025-12-16 Jason Hanson

Quantum Supremacy is a demonstration of a computation by a quantum computer that can not be performed by the best classical computer in a reasonable time. A well-studied approach to demonstrating this on near-term quantum computers is to…

Quantum Physics · Physics 2025-09-22 Julien Codsi , John van de Wetering

As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we…

We present quantum circuits with a brick wall structure using the optimal number of parameters and two-qubit gates to parametrize $SU(2^n)$, and provide evidence that these circuits are universal for $n\leq 5$. For this, we successfully…

Quantum Physics · Physics 2025-11-24 David Wierichs , Korbinian Kottmann , Nathan Killoran

Digital quantum simulators are among the most appealing applications of a quantum computer. Here we propose a universal, scalable, and integrated quantum computing platform based on tunable nonlinear electromechanical nano-oscillators. It…

Quantum Physics · Physics 2018-06-20 F. Tacchino , A. Chiesa , M. D. LaHaye , S. Carretta , D. Gerace

Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as…

Quantum Physics · Physics 2019-08-05 Mark Steudtner , Stephanie Wehner

Unitary transformations are the fundamental building blocks of gates and operations in quantum information processing allowing the complete manipulation of quantum systems in a coherent manner. In the case of photons, optical elements that…

Quantum Physics · Physics 2020-01-30 Florian Brandt , Markus Hiekkamäki , Frédéric Bouchard , Marcus Huber , Robert Fickler
‹ Prev 1 3 4 5 6 7 10 Next ›