Long-time low-latency quantum memory by dynamical decoupling
This disclosure relates to preserving a quantum state in a quantum memory. A controller of the quantum memory determines based on a characteristic of noise that causes deterioration of the quantum state a dynamical decoupling base sequence. The duration of the base sequence is shorter than or equal to an access latency time of the quantum memory to allow access to the quantum state within the access latency time. Further, the deterioration of the quantum state is bounded to an upper deterioration limit when the base sequence is repeatedly applied to the quantum system. This provides acceptable access times while simultaneously allowing long term storage of data in the quantum state with low error rates. Repeatedly applying the base sequence to the quantum system will first yield an increasing deterioration but that deterioration will eventually reach the upper limit. As a result, over time the error rates will not exceed that upper limit and the quantum state is stable.
1. A method for preserving a quantum state of a quantum system in a quantum memory, the method comprising:
determining based on a characteristic of noise that causes deterioration of the quantum state a dynamical decoupling base sequence
such that the duration of the base sequence is shorter than or equal to an access latency time of the quantum memory to allow access to the quantum state within the access latency time, and
such that the deterioration of the quantum state is bounded to an upper deterioration limit when the base sequence is repeatedly applied to the quantum system.
2. The method of claim 1 , further comprising repeatedly applying the base sequence to the quantum system.
3. The method of claim 1 , wherein determining the base sequence is based on a filter function of the base sequence, the filter function of the base sequence characterising the filtering of the noise by the base sequence.
4. The method of claim 3 , wherein the base sequence comprises multiple pulses and the filter function of the base sequence is based on time values of the multiple pulses.
5. The method of claim 3 , wherein determining the base sequence is based on an order of error suppression of the filter function of the base sequence.
6. The method of claim 5 , wherein determining the base sequence comprises selecting one of multiple base sequences such that the order of error suppression of the filter function of the selected base sequence is above a first minimum value that is based on the noise data.
7. The method of claim 5 , wherein the noise data comprises a dominant exponent s in the noise power spectrum and the order of error suppression α P of the filter function of the base sequence satisfies the constraint s+2α P >1.
8. The method of claim 3 , wherein the base sequence comprises multiple instances of a pulse and the filter function of the base sequence is based on a filter function of the pulse, the filter function of the pulse characterising the influence of the pulse on the filtering of the noise.
9. The method of claim 8 , wherein determining the base sequence is based on an order of error suppression of the filter function of the pulse.
10. The method of claim 9 , wherein determining the base sequence comprises selecting one of multiple base sequences such that the order of error suppression of the pulse of the selected base sequence is above a second minimum value that is based on the noise data.
11. The method of claim 9 , wherein the noise data comprises a dominant exponent s in the noise power spectrum and the order of error suppression α Pul of the filter function of the pulse satisfies the constraint s+2α Pul >1.
12. The method of claim 1 , wherein the noise data comprises a cut-off frequency of the noise and the duration of the base sequence is based on the cut-off frequency of the noise.
13. The method of claim 12 , wherein determining the base sequence comprises selecting one of multiple base sequences such that the duration of the selected base sequence is below a second maximum value that is based on the cut-off frequency of the noise.
14. The method of claim 12 , wherein the duration T p of the base sequence satisfies the constraint T p ω c <2π, with ω c being the cut-off frequency of the noise.
15. The method of claim 1 , wherein the base sequence is based on one or more Walsh functions.
16. A non-transitory computer readable medium with an executable program stored thereon that when executed causes the computer to perform the method of claim 1 .
17. A non-transitory computer readable medium with a dynamical decoupling sequence stored thereon that when applied to a quantum system preserves a quantum state in the quantum system of a quantum memory having an access latency time, the sequence comprising:
multiple instances of a base sequence, the duration of the base sequence being shorter than or equal to the access latency time to allow access to the quantum state within the access latency time and having a configuration such that the deterioration of the quantum state is bounded to an upper deterioration limit when the base sequence is repeatedly applied to the quantum system.
18. A method for storing data in a quantum system of a quantum memory accessible within an access latency time, the method comprising:
receiving the data to be stored in the quantum memory;
creating a quantum state in the quantum memory to represent the data; and
applying a sequence of stimulation pulses to the quantum system to preserve the quantum state, wherein the sequence of stimulation pulses comprises multiple instances of a base sequence, the duration of the base sequence being shorter than or equal to the access latency time to allow access to the quantum state within the access latency time and having a configuration such that the deterioration of the quantum state is bounded to an upper deterioration limit when the base sequence is repeatedly applied to the quantum system.