Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0308157

Novel Identification of Symmetric and Anti-Symmetric Quantum Functions

John Robert Burger

Published Aug 28, 2003• 0 citations
arXivHTMLPDF

Abstract

Procedures are given below to construct symmetric and anti-symmetric quantum functions. If hidden in an oracle, such functions can be identified exactly, without iterative interrogation. This is another example of quantum search. The resulting positive (or negative) functions also serve to uniquely reorganize a superposition of states to give a basis state for testing purposes.

DOI
10.48550/arxiv.quant-ph/0308157

Related papers

Symmetric and anti-symmetric quantum functions

John Robert Burger

This paper introduces and analyzes symmetric and anti-symmetric quantum binary functions. Generally, such functions uniquely convert a given computational basis state into a different basis state, but with either a plus or a minus sign. Such functions may serve along with a constant function (in a Deutsch-Jozsa type of algorithm) to provide 2**n deterministic qubit combinations (for n qubits) instead of just one.

arXiv:cs/0304016•Apr 10, 2003•2 citations

Quantum search algorithm in unstructured database

A. D. Kozhukhivskyi

Grover's quantum algorithm was developed to solve the problem of searching an unstructured database for a certain unique element. In general, this problem can be formulated as follows: an unstructured database consists of elements and contains one unique element that has a certain property that can be tested with polynomial complexity, and which must be found with minimal time and complexity. Classical methods require querying the database to find the desired element, while Grover's algorithm allows you to perform only approximately steps, which are iterations of the procedure, to the database and be sure that the resulting element will be exactly the desired element with a probability close to 1. As in quantum algorithms aimed at cryptanalysis of symmetric transformations, Grover's algorithm repeats the procedure (Grover's iteration) to increase the probability of obtaining the correct result. Similarly to such algorithms in Grover's method, when iterations are continued after reaching the required number of iterations, the probability of obtaining the correct result decreases. This is due to the fact that during the execution of Grover's iteration, a rotation is performed in the complex space. Thus, each iteration, making a turn, brings the register closer and closer to the desired state, but at a certain point a maximum closeness is reached, at which the continued use of iterations will lead to a turn past the desired state, which will move the state of the system away from the desired state. The database for this algorithm can be any search space consisting of a certain number of elements. So, for example, it can be applied to find a secret key for a symmetric cryptograms formation or to find a collision for a hashing function.

Scientific Notes of the State University of Telecommunications•Jan 1, 2022•2 citations

Quantum Algorithms Are Determining the Property of a Certain Function

Koji Nagata, Tadao Nakamura, Han J.F. Geurdes +3 more

We discuss a character of quantum algorithms. In fact, all of them determine the property of a certain function. The function under study must have the property $f(x) = f(-x)$ when $f(x)\neq 0$.

•Mar 1, 2017•0 citations

Symmetric and Antisymmeteric Functions, a New Way to Test a Quantum Computer

John Robert Burger

•Apr 10, 2003•0 citations

Bell's paradoxes without the introduction of hidden variables

Aleksandr V. Belinskii

A hidden-variable theory is the traditional, but not unique, basis for constructing various types of Bell's theorem. The starting point may also be a recognition of the existence of a positive-definite probability distribution function. This assumption alone is used to formulate and prove Bell's paradoxes of different types. A specific example is used to show that a formal quantum calculation can sometimes give negative values of the joint probabilities that are used in the proof. An attempt is made to identify the physical meaning of this result and an algorithm for determination of negative joint probabilities of this type is proposed.

Physics-Uspekhi•Apr 30, 1994•19 citations

Resolving problems with the continuum limit in coherent-state path integrals

Oliwier Urbański

The paper solves the problem of continuum limit in bosonic thermal coherent-state path integrals. For this purpose, exact discrete versions of the path integral are constructed for three different orderings of the Hamiltonian: normal, anti-normal and symmetric (Weyl order). Subsequently, their different continuum versions are checked on the harmonic oscillator, to choose the symmetric ordering as a possibly correct choice for all polynomial Hamiltonians. Spotted mathematical subtleties in the simple case serve as a clue to the general solution. Finally, a general justification for the symmetric order is provided by deriving the continuum path integral starting from the exact discrete case using a renormalization procedure in the imaginary time frequency domain. While the role of Weyl order has already been found, the paper provides the missing proof of its suitability for every polynomial Hamiltonian and simplifies the previously established construction by referring only to creation and annihilation operators (without position and momentum operators).

quant-pharXiv:2602.02466•Feb 3, 2026•0 citations
Procedures are given below to construct symmetric and anti-symmetric quantum functions. If hidden in an oracle, such functions can be identified exactly, without iterative interrogation. This is another example of quantum search. The resulting positive (or negative) functions also serve to uniquely reorganize a superposition of states to give a basis state for testing purposes.
Grover's quantum algorithm was developed to solve the problem of searching an unstructured database for a certain unique element. In general, this problem can be formulated as follows: an unstructured database consists of elements and contains one unique element that has a certain property that can be tested with polynomial complexity, and which must be found with minimal time and complexity. Classical methods require querying the database to find the desired element, while Grover's algorithm allows you to perform only approximately steps, which are iterations of the procedure, to the database and be sure that the resulting element will be exactly the desired element with a probability close to 1. As in quantum algorithms aimed at cryptanalysis of symmetric transformations, Grover's algorithm repeats the procedure (Grover's iteration) to increase the probability of obtaining the correct result. Similarly to such algorithms in Grover's method, when iterations are continued after reaching the required number of iterations, the probability of obtaining the correct result decreases. This is due to the fact that during the execution of Grover's iteration, a rotation is performed in the complex space. Thus, each iteration, making a turn, brings the register closer and closer to the desired state, but at a certain point a maximum closeness is reached, at which the continued use of iterations will lead to a turn past the desired state, which will move the state of the system away from the desired state. The database for this algorithm can be any search space consisting of a certain number of elements. So, for example, it can be applied to find a secret key for a symmetric cryptograms formation or to find a collision for a hashing function.
We discuss a character of quantum algorithms. In fact, all of them determine the property of a certain function. The function under study must have the property f(x)=f(−x)f(x) = f(-x)f(x)=f(−x) when f(x)≠0f(x)\neq 0f(x)=0.
A hidden-variable theory is the traditional, but not unique, basis for constructing various types of Bell's theorem. The starting point may also be a recognition of the existence of a positive-definite probability distribution function. This assumption alone is used to formulate and prove Bell's paradoxes of different types. A specific example is used to show that a formal quantum calculation can sometimes give negative values of the joint probabilities that are used in the proof. An attempt is made to identify the physical meaning of this result and an algorithm for determination of negative joint probabilities of this type is proposed.
The paper solves the problem of continuum limit in bosonic thermal coherent-state path integrals. For this purpose, exact discrete versions of the path integral are constructed for three different orderings of the Hamiltonian: normal, anti-normal and symmetric (Weyl order). Subsequently, their different continuum versions are checked on the harmonic oscillator, to choose the symmetric ordering as a possibly correct choice for all polynomial Hamiltonians. Spotted mathematical subtleties in the simple case serve as a clue to the general solution. Finally, a general justification for the symmetric order is provided by deriving the continuum path integral starting from the exact discrete case using a renormalization procedure in the imaginary time frequency domain. While the role of Weyl order has already been found, the paper provides the missing proof of its suitability for every polynomial Hamiltonian and simplifies the previously established construction by referring only to creation and annihilation operators (without position and momentum operators).