Related papers: The f-conditioned Phase Transform

We suggest the improvement of description methods for quantum phase gate implementation in the cavity of QED configuration. Qubits are encoded into two lowest Fock state. Three qubit phase transformation is resulted from the interaction…

Quantum information processing has been one of the pillars of the new information age. In this sense, the control and processing of quantum information plays a fundamental role, and computers capable of manipulating such information have…

Quantum annealing is a powerful alternative model for quantum computing, which can succeed in the presence of environmental noise even without error correction. However, despite great effort, no conclusive proof of a quantum speedup…

The fractional Fourier transform (FrFT), a fundamental operation in physics that corresponds to a rotation of phase space by any angle, is also an indispensable tool employed in digital signal processing for noise reduction. Processing of…

An algorithm is proposed which transfers the quantum information of a wave function (analogue signal) into a register of qubits (digital signal) such that $n$ qubits describe the amplitudes and phases of $2^n$ points of a sufficiently…

We present a novel approach to quantum algorithms, by taking advantage of modular values, i.e., complex and unbounded quantities resulting from specific post-selected measurement scenarios. Our focus is on the problem of ascertaining…

The dynamics at the critical-point of a general first-order quantum phase transition in a finite system is examined, from an algebraic perspective. Suitable Hamiltonians are constructed whose spectra exhibit coexistence of states…

Phase estimation is one of the most important facets of quantum metrology, with applications in sensing, microscopy, and quantum computation. When estimating a phase shift in a lossy medium, there is an upper bound on the attainable…

The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A semi-classical argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase…

This paper generalizes both the binary Deutsch-Jozsa and Grover algorithms to $n$-valued logic using the quantum Fourier transform. Our extended Deutsch-Jozsa algorithm is not only able to distinguish between constant and balanced Boolean…

We provide a new efficient adaptive algorithm for performing phase estimation that does not require that the user infer the bits of the eigenphase in reverse order; rather it directly infers the phase and estimates the uncertainty in the…

We present a full quantum treatment of a five-level atomic system coupled to two quantum and two classical light fields. The two quantum fields undergo a cross-phase modulation induced by electro-magnetically induced transparency. The…

The characterization of quantum phase transitions is a fundamental task for the understanding of quantum phases of matter, with a number of potential applications in quantum technologies. In this work, we use digital quantum simulation as a…

We present an algorithm to analyze numerically the bounce solution of first-order phase transitions. Our approach is well suited to treat phase transitions with several fields. The algorithm consists of two parts. In the first part the…

Quantum amplitude amplification and quantum phase estimation are two fundamental quantum algorithms. All known quantum algorithms are derived from these two algorithms. Even the adiabatic quantum algorithms can also be efficiently simulated…

This paper introduces a robust and scalable framework for implementing nested affine transformations in quantum circuits. Utilizing Hadamard-supported conditional initialization and block encoding, the proposed method systematically applies…

We introduce a stochastic algorithm that acts as a prime number generator. The dynamics of such algorithm gives rise to a continuous phase transition which separates a phase where the algorithm is able to reduce a whole set of integers into…

We present a simple scheme to implement the Deutsch-Jozsa algorithm based on two-atom interaction in a thermal cavity. The photon-number-dependent parts in the evolution operator are canceled with the strong resonant classical field added.…

- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…

Deutsch-Jozsa algorithm has been implemented via a quantum adiabatic evolution by S. Das et al. [Phys. Rev. A 65, 062310 (2002)]. This adiabatic algorithm gives rise to a quadratic speed up over classical algorithms. We show that a modified…