相关论文: The f-conditioned Phase Transform

Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…

Two methods to change a quantum harmonic oscillator frequency without transitions in a finite time are described and compared. The first method, a transitionless-tracking algorithm, makes use of a generalized harmonic oscillator and a…

We investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in Ref.~\cite{Guo:2023ecc} that relates the…

We introduce a prime number generator in the form of a stochastic algorithm. The character of such algorithm gives rise to a continuous phase transition which distinguishes a phase where the algorithm is able to reduce the whole system of…

Here we show how to design phase-shifting algorithms (PSAs) for nonuniform phase-shifted fringe patterns using their frequency transfer function (FTF). Assuming that the nonuniform/nonlinear (NL) phase-steps are known, we introduce the…

A scheme is presented for realizing a quantum phase gate with three-level atoms, solid-state qubits--often called artificial atoms, or ions that share a quantum data bus such as a single mode field in cavity QED system or a collective…

We develop a comprehensive theory of phase for finite-dimensional quantum systems. The only physical requirement we impose is that phase is complementary to amplitude. To implement this complementarity we use the notion of mutually unbiased…

We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…

Quantum enhanced receivers are endowed with resources to achieve higher sensitivities than conventional technologies. For application in optical communications, they provide improved discriminatory capabilities for multiple non-orthogonal…

We present a quantum algorithm to simulate general finite dimensional Lindblad master equations without the requirement of engineering the system-environment interactions. The proposed method is able to simulate both Markovian and…

The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven…

Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to…

We describe a quantum algorithm that generalizes the quantum linear system algorithm [Harrow et al., Phys. Rev. Lett. 103, 150502 (2009)] to arbitrary problem specifications. We develop a state preparation routine that can initialize…

We present a new class of quantum phase transitions that refer neither to local order parameter and critical fluctuations nor to continuous symmetry breaking but are assigned by the step-wise change in topology of the multi-particle system…

We consider one-parameter families of quadratic-phase integral transforms which generalize the fractional Fourier transform. Under suitable regularity assumptions, we characterize the one-parameter groups formed by such transforms.…

We report an experimental demonstration of quantum Deutsch's algorithm by using linear-optical system. By employing photon's polarization and spatial modes, we implement all balanced and constant functions for quantum computer. The…

We examine several proposed schemes by Franson et al. for quantum logic gates based on non-local exchange interactions between two photons in a medium. In these schemes the presence of a {\em single} photon in a given mode is supposed to…

The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is…

We propose a simple quantum algorithm for implementing the diffusion step of grid-based Bayesian filters. The method encodes the advected state density and the process noise density into quantum registers and realizes diffusion using a…

Motivated by recent progress in the experimental development of quantum simulators based on Rydberg atoms, we introduce and investigate the dynamics of a class of $(1+1)$-dimensional quantum cellular automata. These non-equilibrium…