Quantum computaton from a quantum logical perspective

2007 ◽  
Vol 7 (4) ◽  
pp. 281-296
Author(s):  
J. Bub
Keyword(s):  
Hilbert Space ◽  
Boolean Logic ◽  
Final State ◽  
Hidden Subgroup Problem ◽  
Factorization Algorithm ◽  
Global Properties ◽  
Disjunctive Property ◽  
Subgroup Problem ◽  
Logical Perspective ◽  
Special Case

It is well-known that Shor's factorization algorithm, Simon's period-finding algorithm, and Deutsch's original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the information-processing in the three algorithms are presented from a different perspective, in terms of the way in which the algorithms exploit the non-Boolean quantum logic represented by the projective geometry of Hilbert space. From this quantum logical perspective, the XOR algorithm appears directly as a special case of Simon's algorithm, and all three algorithms can be seen as exploiting the non-Boolean logic represented by the subspace structure of Hilbert space in a similar way. Essentially, a global property of a function (such as a period, or a disjunctive property) is encoded as a subspace in Hilbert space representing a quantum proposition, which can then be efficiently distinguished from alternative propositions, corresponding to alternative global properties, by a measurement (or sequence of measurements) that identifies the target proposition as the proposition represented by the subspace containing the final state produced by the algorithm.

Functional Quantum Theory of Free Relativistic Fermi Fields

1970 ◽  
Vol 25 (5) ◽  
pp. 575-586
Author(s):  
H. Stumpf
Keyword(s):  
Hilbert Space ◽  
Quantum Theory ◽  
Physical Interpretation ◽  
Functional Equations ◽  
Dirac Field ◽  
Functional Hilbert Space ◽  
Free Fermi ◽  
Special Case ◽  
Relativistic Fermi

Functional quantum theory of free Fermi fields is treated for the special case of a free Dirac field. All other cases run on the same pattern. Starting with the Schwinger functionals of the free Dirac field, functional equations and corresponding many particle functionals can be derived. To establish a functional quantum theory, a physical interpretation of the functionals is required. It is provided by a mapping of the physical Hilbert space into an appropriate functional Hilbert space, which is introduced here. Mathematical details, especially the problems connected with anticommuting functional sources are treated in the appendices.

Quantum solution to the hidden subgroup problem for Poly-Near-Hamiltonian groups

2004 ◽  
Vol 4 (3) ◽  
pp. 229-235
Author(s):  
D. Gavinsky
Keyword(s):  
Quantum Computing ◽  
Efficient Algorithm ◽  
Abelian Groups ◽  
Hidden Subgroup Problem ◽  
Subgroup Problem ◽  
Hamiltonian Groups ◽  
Quantum Solution

The Hidden Subgroup Problem (HSP) has been widely studied in the context of quantum computing and is known to be efficiently solvable for Abelian groups, yet appears to be difficult for many non-Abelian ones. An efficient algorithm for the HSP over a group \f G\ runs in time polynomial in \f{n\deq\log|G|.} For any subgroup \f H\ of \f G, let \f{N(H)} denote the normalizer of \f H. Let \MG\ denote the intersection of all normalizers in \f G (i.e., \f{\MG=\cap_{H\leq G}N(H)}). \MG\ is always a subgroup of \f G and the index \f{[G:\MG]} can be taken as a measure of ``how non-Abelian'' \f G is (\f{[G:\MG] = 1} for Abelian groups). This measure was considered by Grigni, Schulman, Vazirani and Vazirani, who showed that whenever \f{[G:\MG]\in\exp(O(\log^{1/2}n))} the corresponding HSP can be solved efficiently (under certain assumptions). We show that whenever \f{[G:\MG]\in\poly(n)} the corresponding HSP can be solved efficiently, under the same assumptions (actually, we solve a slightly more general case of the HSP and also show that some assumptions may be relaxed).

An improved query for the hidden subbroup problem

2014 ◽  
Vol 14 (5&6) ◽  
pp. 467-492
Author(s):  
Asif Shakeel
Keyword(s):  
Abelian Group ◽  
Standard Method ◽  
Finite Abelian Group ◽  
Quantum Algorithms ◽  
Success Probability ◽  
Hidden Subgroup Problem ◽  
Subgroup Identification ◽  
Subgroup Problem ◽  
Query Algorithms

The Hidden Subgroup Problem (HSP) is at the forefront of problems in quantum algorithms. In this paper, we introduce a new query, the \textit{character} query, generalizing the well-known phase kickback trick that was first used successfully to efficiently solve Deutsch's problem. An equal superposition query with $\vert 0 \rangle$ in the response register is typically used in the ``standard method" of single-query algorithms for the HSP. The proposed character query improves over this query by maximizing the success probability of subgroup identification under a uniform prior, for the HSP in which the oracle functions take values in a finite abelian group. We apply our results to the case when the subgroups are drawn from a set of conjugate subgroups and obtain a success probability greater than that found by Moore and Russell.

Quantum measurements for hidden subgroup problems with optimal sample complexity

2008 ◽  
Vol 8 (3&4) ◽  
pp. 345-358
Author(s):  
M. Hayashi ◽  
A. Kawachi ◽  
H. Kobayashi
Keyword(s):  
Log P ◽  
Sample Complexity ◽  
Arbitrary Group ◽  
Hidden Subgroup Problem ◽  
Optimal Sample ◽  
Subgroup Problem ◽  
Good Measurement ◽  
Hidden Subgroups ◽  
Decision Version ◽  
Candidate Set

One of the central issues in the hidden subgroup problem is to bound the sample complexity, i.e., the number of identical samples of coset states sufficient and necessary to solve the problem. In this paper, we present general bounds for the sample complexity of the identification and decision versions of the hidden subgroup problem. As a consequence of the bounds, we show that the sample complexity for both of the decision and identification versions is $\Theta(\log|\HH|/\log p)$ for a candidate set $\HH$ of hidden subgroups in the case \REVISE{where the candidate nontrivial subgroups} have the same prime order $p$, which implies that the decision version is at least as hard as the identification version in this case. In particular, it does so for the important \REVISE{cases} such as the dihedral and the symmetric hidden subgroup problems. Moreover, the upper bound of the identification is attained \REVISE{by a variant of the pretty good measurement}. \REVISE{This implies that the concept of the pretty good measurement is quite useful for identification of hidden subgroups over an arbitrary group with optimal sample complexity}.

scholarly journals On solving systems of random linear disequations

2008 ◽  
Vol 8 (6&7) ◽  
pp. 579-594
Author(s):  
G. Ivanyos
Keyword(s):  
Abelian Groups ◽  
Main Idea ◽  
Constant Factor ◽  
Linear Functions ◽  
Important Special Case ◽  
Hidden Subgroup Problem ◽  
Left Hand ◽  
Shift Problem ◽  
Group A ◽  
Subgroup Problem

An important special case of the hidden subgroup problem is equivalent to the hidden shift problem over abelian groups. An efficient solution to the latter problem could serve as a building block of quantum hidden subgroup algorithms over solvable groups. The main idea of a promising approach to the hidden shift problem is a reduction to solving systems of certain random disequations in finite abelian groups. By a disequation we mean a constraint of the form $f(x)\neq 0$. In our case, the functions on the left hand side are generalizations of linear functions. The input is a random sample of functions according to a distribution which is up to a constant factor uniform over the "linear" functions $f$ such that $f(u)\neq 0$ for a fixed, although unknown element $u\in A$. The goal is to find $u$, or, more precisely, all the elements $u'\in A$ satisfying the same disequations as $u$. In this paper we give a classical probabilistic algorithm which solves the problem in an abelian $p$-group $A$ in time polynomial in the sample size $N$, where $N=(\log\size{A})^{O(q^2)}$, and $q$ is the exponent of $A$.

scholarly journals Does the HM mechanism work in string theory?

2013 ◽  
Vol 91 (1) ◽  
pp. 75-80
Author(s):  
Alireza Sepehri ◽  
Somayyeh Shoorvazi ◽  
Mohammad Ebrahim Zomorrodian
Keyword(s):  
Hilbert Space ◽  
Black Hole ◽  
String Theory ◽  
Correspondence Principle ◽  
Black Hole Entropy ◽  
Closed String ◽  
Centre Of Mass ◽  
Final State ◽  
Information Transformation ◽  
Left And Right

The correspondence principle offers a unique opportunity to test the Horowitz and Maldacena mechanism at the correspondence point “the centre of mass energies around (Ms/(gs)2)”. First by using the Horowitz and Maldacena proposal, the black hole final state for closed strings is studied and the entropy of these states is calculated. Then, to consider the closed string states, a copy of the original Hilbert space is constructed with a set of creation–annihilation operators that have the same commutation properties as the original ones. The total Hilbert space is the tensor product of the two spaces Hright ⊗ Hleft, where in this case Hleft/right denote the physical quantum state space of the closed string. It is shown that closed string states can be represented by a maximally entangled two-mode squeezed state of the left and right spaces of closed string. Also, the entropy for these string states is calculated. It is found that black hole entropy matches the closed string entropy at transition point. This means that our result is consistent with correspondence principle and thus HM mechanism in string theory works. Consequently the unitarity of the black hole in string theory can be reconciled. However Gottesman and Preskill point out that, in this scenario, departures from unitarity can arise due to interactions between the collapsing body and the infalling Hawking radiation inside the event horizon and information can be lost. By extending the Gottesman and Preskill method to string theory, the amount of information transformation from the matter to the state of outgoing Hagedorn radiation for closed strings is obtained. It is observed that information is lost for closed strings.

scholarly journals Hilbert space valued Gabor frames in weighted amalgam spaces

2019 ◽  
Vol 10 (4) ◽  
pp. 377-394
Author(s):  
Anirudha Poria ◽  
Jitendriya Swain
Keyword(s):  
Hilbert Space ◽  
Separable Hilbert Space ◽  
Gabor Frame ◽  
Window Function ◽  
Gabor Frames ◽  
Frame Operator ◽  
Wiener Amalgam Space ◽  
Amalgam Spaces ◽  
Special Case

AbstractLet {\mathbb{H}} be a separable Hilbert space. In this paper, we establish a generalization of Walnut’s representation and Janssen’s representation of the {\mathbb{H}}-valued Gabor frame operator on {\mathbb{H}}-valued weighted amalgam spaces {W_{\mathbb{H}}(L^{p},L^{q}_{v})}, {1\leq p,q\leq\infty}. Also, we show that the frame operator is invertible on {W_{\mathbb{H}}(L^{p},L^{q}_{v})}, {1\leq p,q\leq\infty}, if the window function is in the Wiener amalgam space {W_{\mathbb{H}}(L^{\infty},L^{1}_{w})}. Further, we obtain the Walnut representation and invertibility of the frame operator corresponding to Gabor superframes and multi-window Gabor frames on {W_{\mathbb{H}}(L^{p},L^{q}_{v})}, {1\leq p,q\leq\infty}, as a special case by choosing the appropriate Hilbert space {\mathbb{H}}.

On Operator Algebras and Invariant Subspaces

1969 ◽  
Vol 21 ◽  
pp. 1178-1181 ◽  
Author(s):  
Chandler Davis ◽  
Heydar Radjavi ◽  
Peter Rosenthal
Keyword(s):  
Hilbert Space ◽  
Elementary Proof ◽  
Operator Algebras ◽  
Equivalent Form ◽  
Invariant Subspaces ◽  
Complex Hilbert Space ◽  
Closed Algebra ◽  
Weakly Closed ◽  
Special Case

If is a collection of operators on the complex Hilbert space , then the lattice of all subspaces of which are invariant under every operator in is denoted by Lat . An algebra of operators on is defined (3; 4) to be reflexive if for every operator B on the inclusion Lat ⊆ Lat B implies .Arveson (1) has proved the following theorem. (The abbreviation “m.a.s.a.” stands for “maximal abelian self-adjoint algebra”.)ARVESON's THEOREM. Ifis a weakly closed algebra which contains an m.a.s.a.y and if Lat, then is the algebra of all operators on .A generalization of Arveson's Theorem was given in (3). Another generalization is Theorem 2 below, an equivalent form of which is Corollary 3. This theorem was motivated by the following very elementary proof of a special case of Arveson's Theorem.

Sign in / Sign up

Export Citation Format

Share Document