相关论文: Emergent Bifurcations in Quantum Circuit Stability…

Quantum vortices with more than a single circulation quantum are usually unstable and decay into clusters of smaller vortices. One way to prevent the decay is to place the vortex at the centre of a convergent (draining) fluid flow, which…

In conventional circuit-based quantum computing architectures, the standard gate set includes arbitrary single-qubit rotations and two-qubit entangling gates. This choice is not always aligned with the native operations available in certain…

Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffiths phases, but can be used as a resource as we show here: to…

Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy…

The conventional paradigm of quantum computing is discrete: it utilizes discrete sets of gates to realize bitstring-to-bitstring mappings, some of them arguably intractable for classical computers. In parameterized quantum approaches, the…

An understanding of quantum theory in terms of new, underlying descriptions capable of explaining the existence of non-classical correlations, non-commutativity of measurements and other unique and counter-intuitive phenomena remains still…

Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…

Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups…

We theoretically study the influence of frequency uncertainties on the operation of a Kerr-cat qubit. As the mean photon number increases, Kerr-cat qubits provide an increasing level of protection against phase errors induced by unknown…

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…

Two level quantum mechanical systems like spin 1/2 particles lend themselves as a natural qubit implementation. However, encoding a single qubit in several spins reduces the resources necessary for qubit control and can protect from…

We show that the bipartite separability of a pure qubit state hinges critically on the combinatorial structure of its computational-basis support. Using Boolean cube geometry, we introduce a taxonomy that distinguishes support-guaranteed…

The current noisy intermediate-scale quantum (NISQ) era is characterized by substantial errors and noise, which limit the practical feasibility of deep, many-qubit circuits. To address these constraints, quantum circuit cutting has emerged…

Quantum computing leverages quantum mechanics to achieve computational advantages over classical hardware, but the use of third-party quantum compilers in the Noisy Intermediate-Scale Quantum (NISQ) era introduces risks of intellectual…

In this work, we report on a novel quantum gate approximation algorithm based on the application of parametric two-qubit gates in the synthesis process. The utilization of these parametric two-qubit gates in the circuit design allows us to…

We describe explicitly how entanglement between quantum mechanical subsystems can lead to emergent gauge symmetry in a classical limit. We first provide a precise characterisation of when it is consistent to treat a quantum subsystem…

We study deterministic and quantum dynamics from a constructive "finite" point of view, since the introduction of a continuum, or other actual infinities in physics poses serious conceptual and technical difficulties, without any need for…

We show that the Variational Quantum-Classical Simulation algorithm admits a finite circuit depth scaling collapse when targeting the critical point of the transverse field Ising chain. The order parameter only collapses on one side of the…

In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a…

Quantum gates (unitary gates) on physical systems are usually implemented by controlling the Hamiltonian dynamics. When full descriptions of the Hamiltonians parameters is available, the set of implementable quantum gates is easily…