1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
use crate::errors::CircuitError;
use crate::pipeline::*;
use crate::types::Precision;
use crate::Complex;
use std::cmp::Ordering;
use std::fmt;
use std::rc::Rc;
#[derive(Debug)]
pub enum Parent {
Owned(Vec<Register>, Option<StateModifier>),
Shared(Rc<Register>),
}
pub struct Register {
pub indices: Vec<u64>,
pub(crate) parent: Option<Parent>,
pub(crate) deps: Option<Vec<Rc<Register>>>,
pub(crate) id: u64,
}
impl Register {
pub(crate) fn new(id: u64, indices: Vec<u64>) -> Result<Register, CircuitError> {
if indices.is_empty() {
CircuitError::make_str_err("Register must have at least one index assigned.")
} else {
Ok(Register {
indices,
parent: None,
deps: None,
id,
})
}
}
pub fn handle(&self) -> RegisterHandle {
RegisterHandle {
indices: self.indices.clone(),
}
}
pub fn merge_with_modifier(
id: u64,
registers: Vec<Register>,
modifier: Option<StateModifier>,
) -> Result<Register, CircuitError> {
if registers.is_empty() {
CircuitError::make_str_err("Cannot merge zero registers.")
} else {
let all_indices = registers
.iter()
.map(|r| r.indices.clone())
.flatten()
.collect();
Ok(Register {
indices: all_indices,
parent: Some(Parent::Owned(registers, modifier)),
deps: None,
id,
})
}
}
pub fn split(
ida: u64,
idb: u64,
r: Register,
indices: &[u64],
) -> Result<(Register, Register), CircuitError> {
for indx in indices {
if *indx > r.n() {
let message = format!(
"All indices for splitting must be below r.n={:?}, found indx={:?}",
r.n(),
*indx
);
return CircuitError::make_err(message);
}
}
if indices.len() == r.indices.len() {
CircuitError::make_str_err("Cannot split out all indices into own Registers.")
} else if indices.is_empty() {
CircuitError::make_str_err("Must provide indices to split.")
} else {
let selected_indices: Vec<u64> = indices
.iter()
.map(|i| r.indices[(*i) as usize])
.collect();
Self::split_absolute(ida, idb, r, &selected_indices)
}
}
pub fn split_absolute(
ida: u64,
idb: u64,
r: Register,
selected_indices: &[u64],
) -> Result<(Register, Register), CircuitError> {
if selected_indices.len() == r.indices.len() {
return CircuitError::make_str_err("Cannot split out all indices into own Registers.");
} else if selected_indices.is_empty() {
return CircuitError::make_str_err("Must provide indices to split.");
}
for indx in selected_indices {
if !r.indices.contains(indx) {
let message = format!(
"Index {:?} not found in Register with indices {:?}",
indx, r.indices
);
return CircuitError::make_err(message);
}
}
let remaining = r
.indices
.clone()
.into_iter()
.filter(|x| !selected_indices.contains(x))
.collect();
let shared_parent = Rc::new(r);
Ok((
Register {
indices: selected_indices.to_vec(),
parent: Some(Parent::Shared(shared_parent.clone())),
deps: None,
id: ida,
},
Register {
indices: remaining,
parent: Some(Parent::Shared(shared_parent.clone())),
deps: None,
id: idb,
},
))
}
pub fn make_measurement_handle(id: u64, r: Register) -> (Register, MeasurementHandle) {
let indices = r.indices.clone();
let shared_parent = Rc::new(r);
let handle = MeasurementHandle::new(&shared_parent);
(
Register {
indices,
parent: Some(Parent::Shared(shared_parent)),
deps: None,
id,
},
handle,
)
}
pub fn add_deps(r: Register, deps: Vec<Rc<Register>>) -> Register {
Register {
indices: r.indices,
parent: r.parent,
deps: Some(deps),
id: r.id,
}
}
pub fn n(&self) -> u64 {
self.indices.len() as u64
}
}
impl Eq for Register {}
impl PartialEq for Register {
fn eq(&self, other: &Register) -> bool {
self.id == other.id
}
}
impl Ord for Register {
fn cmp(&self, other: &Self) -> Ordering {
self.id.cmp(&other.id)
}
}
impl PartialOrd for Register {
fn partial_cmp(&self, other: &Register) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl fmt::Debug for Register {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
let int_strings = self
.indices
.iter()
.map(|x| x.clone().to_string())
.collect::<Vec<String>>();
write!(
f,
"Register[{}][{}]",
self.id.to_string(),
int_strings.join(", ")
)
}
}
#[derive(Debug)]
pub struct RegisterHandle {
indices: Vec<u64>,
}
impl RegisterHandle {
pub fn make_init_from_index<P: Precision>(
&self,
index: u64,
) -> Result<RegisterInitialState<P>, CircuitError> {
let n = self.indices.len();
if index < (1 << n) as u64 {
Ok((self.indices.clone(), InitialState::Index(index)))
} else {
let message = format!(
"Index {:?} is too large, must be less than 2^{:?}",
index, n
);
CircuitError::make_err(message)
}
}
pub fn make_init_from_state<P: Precision>(
&self,
state: Vec<Complex<P>>,
) -> Result<RegisterInitialState<P>, CircuitError> {
let n = self.indices.len();
if state.len() == 1 << n {
Ok((self.indices.clone(), InitialState::FullState(state)))
} else {
let message = format!(
"State not correct size for RegisterHandle (is {}, must be 2^{})",
state.len(),
n
);
CircuitError::make_err(message)
}
}
}