QRAM - Revision history

Mol: /* Theory */

2020-11-29T17:45:46Z

Theory

← Older revision		Revision as of 20:45, 29 November 2020
Line 7:		Line 7:
	The direct implementation of classical binary tree (using transistors) is rather impractical, as the exponential number of transistors is needed.		The direct implementation of classical binary tree (using transistors) is rather impractical, as the exponential number of transistors is needed.

	Bucket Brigade ~~implementation~~.		At least three different methods: Quantum Bus, Fanout and Bucket Brigade implementations.

	[[File:Qram.png\|thumb]]		[[File:Qram.png\|thumb]]

2020-11-29T17:44:40Z

References

← Older revision		Revision as of 20:44, 29 November 2020
Line 30:		Line 30:

	https://github.com/qsharp-community/qram Nice animation.		https://github.com/qsharp-community/qram Nice animation.

			https://www.cs.umd.edu/class/fall2019/cmsc657/projects/group_11.pdf

2020-11-29T11:02:47Z

Theory

← Older revision		Revision as of 14:02, 29 November 2020
Line 6:		Line 6:

	The direct implementation of classical binary tree (using transistors) is rather impractical, as the exponential number of transistors is needed.		The direct implementation of classical binary tree (using transistors) is rather impractical, as the exponential number of transistors is needed.

			Bucket Brigade implementation.

	[[File:Qram.png\|thumb]]		[[File:Qram.png\|thumb]]

2020-11-29T10:53:29Z

Theory

← Older revision		Revision as of 13:53, 29 November 2020
Line 2:		Line 2:

	== Theory ==		== Theory ==

			[[File:QramBinaryTree.svg\|thumb\|Qram binary tree or a bifurcation graph.]]

			The direct implementation of classical binary tree (using transistors) is rather impractical, as the exponential number of transistors is needed.

	[[File:Qram.png\|thumb]]		[[File:Qram.png\|thumb]]

2020-11-29T10:16:28Z

References

← Older revision		Revision as of 13:16, 29 November 2020
Line 22:		Line 22:

	https://arxiv.org/pdf/2006.11761.pdf		https://arxiv.org/pdf/2006.11761.pdf

			https://github.com/qsharp-community/qram Nice animation.

2020-11-29T10:08:52Z

References

2020-11-29T10:05:49Z

Example

← Older revision		Revision as of 13:05, 29 November 2020
Line 15:		Line 15:
	=== Example ===		=== Example ===

	Store the data array <math>[1,2,5,7]=[1,10,101,111]_2</math> into a Qram addresses <math>[\|0~~\rangle_a~~ , \|1~~\rangle_a~~ ]</math>. Address register is <math>\sum_{i=0}^1 \alpha_i \|i\rangle_a = \alpha_0 \|0\rangle_a + \alpha_1 \|1\rangle_a </math>.		Store the data array <math>[1,2,5,7]=[1,10,101,111]_2</math> into a Qram addresses <math>[0,1]</math>. Address register is <math>\sum_{i=0}^1 \alpha_i \|i\rangle_a = \alpha_0 \|0\rangle_a + \alpha_1 \|1\rangle_a </math>.

	== References ==		== References ==

	https://arxiv.org/pdf/0708.1879.pdf		https://arxiv.org/pdf/0708.1879.pdf

2020-11-29T10:04:56Z

Example

← Older revision		Revision as of 13:04, 29 November 2020
Line 15:		Line 15:
	=== Example ===		=== Example ===

	Store the data array <math>[1,2,5,7]=[1,10,101,111]_2</math> into a Qram addresses <math>[0, 1]_a</math>.		Store the data array <math>[1,2,5,7]=[1,10,101,111]_2</math> into a Qram addresses <math>[\|0\rangle_a , \|1\rangle_a ]</math>. Address register is <math>\sum_{i=0}^1 \alpha_i \|i\rangle_a = \alpha_0 \|0\rangle_a + \alpha_1 \|1\rangle_a </math>.

	Address register is <math>\sum_{i=0}^1 \alpha_i \|i\rangle_a = \alpha_0 \|0\rangle_a + \alpha_1 \|1\rangle_a </math>.

	== References ==		== References ==

	https://arxiv.org/pdf/0708.1879.pdf		https://arxiv.org/pdf/0708.1879.pdf

2020-11-29T09:58:23Z

Theory

← Older revision		Revision as of 12:58, 29 November 2020
Line 11:		Line 11:

	Data register <math>d</math> with <math>D_i</math> being the content of <math>i</math>th memory cell. QRAM is the operation <math>\sum_i \alpha_i \|i\rangle_a \to \sum_i \alpha_i \|i\rangle_a\|D_i\rangle_d </math>.		Data register <math>d</math> with <math>D_i</math> being the content of <math>i</math>th memory cell. QRAM is the operation <math>\sum_i \alpha_i \|i\rangle_a \to \sum_i \alpha_i \|i\rangle_a\|D_i\rangle_d </math>.


			=== Example ===

			Store the data array <math>[1,2,5,7]=[1,10,101,111]_2</math> into a Qram addresses <math>[0, 1]_a</math>.

			Address register is <math>\sum_{i=0}^1 \alpha_i \|i\rangle_a = \alpha_0 \|0\rangle_a + \alpha_1 \|1\rangle_a </math>.

	== References ==		== References ==

	https://arxiv.org/pdf/0708.1879.pdf		https://arxiv.org/pdf/0708.1879.pdf

2020-11-28T10:53:55Z

Theory

← Older revision		Revision as of 13:53, 28 November 2020
Line 2:		Line 2:

	== Theory ==		== Theory ==

			[[File:Qram.png\|thumb]]

	The address and output registers of QRAM are composed of qubits instead of bits, though the memory array can be either quantum or		The address and output registers of QRAM are composed of qubits instead of bits, though the memory array can be either quantum or