相关论文: Poly-locality in quantum computing
We present a detailed study of the quantum site percolation problem on simple cubic lattices, thereby focussing on the statistics of the local density of states and the spatial structure of the single particle wavefunctions. Using the…
In quantum information processing (QIP), the quantum Fourier transform (QFT) has a plethora of applications [1] [2] [3]: Shor's algorithm and phase estimation are just a few well-known examples. Shor's quantum factorization algorithm, one…
Quantum non-locality is normally defined via violations of Bell's inequalities that exclude certain classical hidden variable theories from explaining quantum correlations. Another definition of non-locality refers to the wave-function…
We consider the class of multiple Fourier series associated with functions in the Dirichlet space of the polydisc. We prove that every such series is summable with respect to unrestricted rectangular partial sums, everywhere except for a…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
Modular localization is the concise conceptual formulation of causal localization in the setting of local quantum physics. Unlike QM it does not refer to individual operators but rather to ensembles of observables which share the same…
We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit $C$ acting on $n$ qubits, and any bit string $x\in\{0,1\}^n$, can compute the quantity $|< x |C|0^{\otimes n}>|^2$ to within any…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
Significant developments made in quantum hardware and error correction recently have been driving quantum computing towards practical utility. However, gaps remain between abstract quantum algorithmic development and practical applications…
We formulate a notion of group Fourier transform for a finite dimensional Lie group. The transform provides a unitary map from square integrable functions on the group to square integrable functions on a non-commutative dual space. We then…
We consider the mixed states of the bipartite quantum system with the first party a qubit and the second a qutrit. The group of local unitary transformations of the system, ignoring the overall phase factor, is the direct product G of SU(2)…
Is the universe computable? If yes, is it computationally a polynomial place? In standard quantum mechanics, which permits infinite parallelism and the infinitely precise specification of states, a negative answer to both questions is not…
Local integrals of motion play a central role in the understanding of many-body localization in many-body quantum systems in one dimension subject to a random external potential, but the question of how these local integrals of motion…
Many of the contemporary formulations of quantum mechanics describe the marginal probability distributions of entangled many-body systems in a non-local way. Unlike the non-locality of joint distributions, the non-locality of marginal…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…
In the first part of this paper we analyze possible quantum computational capacities due to quantum queries associated with equi-partitions of pure orthogonal states. Special emphasis is given to the parity of product states and to…
In this paper, we further investigate the local criterion and present a class of permutation polynomials and their compositional inverses over $ \mathbb{F}_{q^2}$. Additionally, we demonstrate that linearized polynomial over…
The Quantum Fourier Transform (QFT) is a fundamental component of many quantum computing algorithms. In this paper, we present an alternative method for factoring this transformation. Inspired by this approach, we introduce a new quantum…
Quantum nonlocality is revisited from a novel point of view by studying the problem of an originally classical particle immersed in the stochastic zero-point radiation field (zpf). The entire system is left to evolve until it reaches a…