Category Archives: quantum
spin swapping from NIST
http://www.nist.gov/pml/dance-080307.cfm Good high level article on how spin swapping related to practical entanglement (and non separability)
Turings quantum random walk
Lets see if we can relate alpha, below http://turingarchive.org/viewer/?id=133&title=29 to the earlier work of the paper expressed in permutation group theory http://turingarchive.org/viewer/?id=133&title=05a http://turingarchive.org/viewer/?id=133&title=03 We look at a “small wheel’s” 2-element rotation (α0 α1) as – under the conjugating effect … Continue reading
bubble sort, quantum superpositions, and quantum unitaries arrays
Quantum computing may seem difficult, until you translate it into the language of Turing and enigma analysis. If someone tells you about superposition and vector spaces, this just means a boolean truth table. The sum has n terms, one per … Continue reading
quantum chemistry cryptanalysis for kids
Take a look back at https://yorkporc.wordpress.com/2012/03/14/tunnycolossus-setting-vs-des-differential-cryptanalysis/. Also, recall the basic principles of error-correcting codes in which the decoder iterates through the constraints of hamming relations imposed on the set of plaintext bits created by the originator and finds probabilistically – … Continue reading
wigner vs fourier
Grover and Tunny/Colossus–similarities
In their book Quantum Computing for Computer Scientists, Noson S. Yanofsky; Mirco A. Mannucci develop the ideas of a quantum algorithm. We will now investigate our thesis that the 1930s notion for the design of a “computable” discrete state machine … Continue reading
expectation from inner product
see quantum book be interesting now to read the GCHQ recent release of Turing papers on repeat rates, and the notebooks of the research section discussion Tunny – explaining why setting works, given a “quantum mechanics” explanation. Wonder who wrote … Continue reading
bras, kets and “transition amplitudes”
We get to link together two ideas to understand the bra-ket. It’s not that the bra is the encoding of the history of the operator (as used several times to induce some particular start state to become some particular final … Continue reading
orbits are now easy (as are actions); turings quantum model for crypto
ok so a subgroup “acting on” a set is just an operator acting on a state (in that set). See quantum book If the “program” is a matrix and we apply the matrix multiple times, we evolve the system. If … Continue reading
second coming
cyclotrons, resonances, photodiodes, carbon nano-tubes
http://www.condmat.physics.manchester.ac.uk/fullpub/27%20Phys%20Rev%20B%2076%20081406R%202007.pdf From a “photoconductance” study, they should be able to measure (indirectly) the quantum state.
on quantum codes and networks
notes for later http://www.ma.rhul.ac.uk/static/techrep/2009/RHUL-MA-2009-11.pdf
colossus era capable binary circuit for walsh
Consider the following circuit: from patent office Lets assume an old 1940s report discusses the application of binary implementations of Walsh transforms. Lets assume that modern wireless modulators use (modern) walsh transforms. Would one wish to highlight the connection between … Continue reading
maypoles, weighty products; car-size nuclear reactors and cryptanalysis computation
from (ii) seems useful. If one wants to multiply large ints (in what algorithm!?), wouldn’t it be nice (just so!) if there were a weights of evidence argument, such that the intersection of common bit values tells one just a … Continue reading
Simulating qubits; Grover in a box; tunny-era Fourier
We have a solid understanding now of hadamard and Walsh – linking back to Fourier “description” of the faltung correlations/convolutions used to “theorize” about why the processes actually used to break Tunny messages back in 1944 actually worked. We also … Continue reading
systematic to dual to quantum gates
The term “systematic” is new to me, but makes perfect sense: from http://errorcorrectingcodes.wordpress.com/2010/01/12/lecture-material-1-introduction-linear-codes/ Building on dual codes (subtly distinguished from the related notion of orthogonal complement vector spaces, recall), we get to hadamard codes: we can look at this … Continue reading