English
Related papers

Related papers: Non-Resonant Effects in Implementation of Quantum …

200 papers

We propose a quantum mechanical approach to noise in resonant tunneling structures, that can be applied in the whole range of transport regimes, from completely coherent to completely incoherent. In both limiting cases, well known results…

Condensed Matter · Physics 2009-10-28 G. Iannaccone , M. Macucci , B. Pellegrini

Quantum signal processing (QSP) is a powerful toolbox for the design of quantum algorithms and can lead to asymptotically optimal computational costs. Its realization on noisy quantum computers without fault tolerance, however, is…

Quantum Physics · Physics 2023-09-28 Yuta Kikuchi , Conor Mc Keever , Luuk Coopmans , Michael Lubasch , Marcello Benedetti

Implementing a quantum algorithm on a NISQ device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various factors contributing to the depth and width as well as to the…

Quantum Physics · Physics 2020-09-25 Frank Leymann , Johanna Barzen

Many researchers have been heavily investigated on quantum phase estimation (QPE) algorithms to find the unknown phase, since QPE is the core building block of the most quantum algorithms such as the Shor's factoring algorithm, quantum…

Quantum Physics · Physics 2019-03-19 Hamed Mohammadbagherpoor , Young-Hyun Oh , Anand Singh , Xianqing Yu , Andy J. Rindos

It is proved on the example of electron spin resonance (ESR) studies of anthracites, that by strong electron-photon and electron-phonon interactions the formation of the coherent system of the resonance phonons takes place. The acoustic…

Quantum Physics · Physics 2015-01-29 Dmitri Yerchuck , Vyacheslav Stelmakh , Yauhen Yerchak , Alla Dovlatova

Quantum phase estimation (QPE) is one of the core algorithms for quantum computing. It has been extensively studied and applied in a variety of quantum applications such as the Shor's factoring algorithm, quantum sampling algorithms and the…

We analyze quantum computers which perform Shor's factoring algorithm, paying attention to asymptotic properties as the number L of qubits is increased. Using numerical simulations and a general theory of the stabilities of many-body…

Quantum Physics · Physics 2009-11-10 Akihisa Ukena , Akira Shimizu

In recent years, advancements in quantum chip technology, such as Willow, have contributed to reducing quantum computation error rates, potentially accelerating the practical adoption of quantum computing. As a result, the design of quantum…

Cryptography and Security · Computer Science 2025-10-23 Abel C. H. Chen

We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which…

Quantum Physics · Physics 2007-05-23 Felix M Lev

Mechanical degrees of freedom are natural candidates for continuous-variable quantum information processing and bosonic quantum simulations. These applications, however, require the engineering of squeezing and nonlinearities in the quantum…

Quantum Physics · Physics 2023-12-27 Stefano Marti , Uwe von Lüpke , Om Joshi , Yu Yang , Marius Bild , Andraz Omahen , Yiwen Chu , Matteo Fadel

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical…

Noise and decoherence due to spurious two-level systems (TLS) located at material interfaces is a long-standing issue in solid state quantum technologies. Efforts to mitigate the effects of TLS have been hampered by a lack of surface…

We study numerically the influence of non-resonant effects on the dynamics of a single $\pi$-pulse quantum CONTROL-NOT (CN) gate in a macroscopic ensemble of fo ur-spin molecules at room temperature. The four nuclear spins in each molecule…

Quantum Physics · Physics 2007-05-23 G. P. Berman , A. R. Bishop , G. D. Doolen , G. V. Lopez , V. I. Tsifrinovich

Quantum annealing aims to solve combinatorial optimization problems mapped on to Ising interactions between quantum spins. A critical factor that limits the success of a quantum annealer is its sensitivity to noise, and intensive research…

Quantum Physics · Physics 2019-01-29 Shruti Puri , Christian Kraglund Andersen , Arne L. Grimsmo , Alexandre Blais

We propose how to achieve chiral photon blockade by spinning a nonlinear optical resonator. We show that by driving such a device at a fixed direction, completely different quantum effects can emerge for the counter-propagating optical…

Quantum Physics · Physics 2024-06-04 Yunlan Zuo , Ya-Feng Jiao , Xun-Wei Xu , Adam Miranowicz , Le-Man Kuang , Hui Jing

We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g. Grover's algorithm does not fall into this class). Our…

Computational Complexity · Computer Science 2015-03-20 Richard J. Lipton , Kenneth W. Regan , Atri Rudra

Recently, Cai showed that Shor's quantum factoring algorithm fails to factor large integers when the algorithm's quantum Fourier transform (QFT) is corrupted by a vanishing level of random noise on the QFT's precise controlled rotation…

Quantum Physics · Physics 2025-09-16 Jin-Yi Cai , Ben Young

The numerical emulation of quantum physics and quantum chemistry often involves an intractable number of degrees of freedom and admits no known approximation in general form. In practice, representing quantum-mechanical states using…

We investigate the performance of quantum parameter estimation based on a qubit probe in a dissipative bosonic environment beyond the traditional paradigm of weak-coupling and rotating-wave approximations. By making use of an exactly…

Quantum Physics · Physics 2021-10-18 Wei Wu , Chuan Shi

Shor's algorithm is one of the most significant quantum algorithms. Shor's algorithm can factor large integers with a certain success probability in polynomial time. However, Shor's algorithm requires an unbearable amount of qubits in the…

Quantum Physics · Physics 2024-12-16 Ligang Xiao , Daowen Qiu , Le Luo , Paulo Mateus
‹ Prev 1 3 4 5 6 7 10 Next ›