-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathdense_optimizer.py
More file actions
1394 lines (1274 loc) · 64.4 KB
/
Copy pathdense_optimizer.py
File metadata and controls
1394 lines (1274 loc) · 64.4 KB
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
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Thu Aug 10 13:07:10 2023
@author: crotello
"""
# =============================================================================
# GPU PORTING STRATEGY (branch: gpuOptim)
# =============================================================================
# This is the HIGHEST-VALUE file for GPU porting in the entire repo.
# It contains ~8 annealing solve methods, all running statevector simulation
# on CPU. Swapping the backend here unlocks GPU for all of them at once.
#
# IMPORT FIX NEEDED BEFORE GPU PORTING:
# Line below uses deprecated APIs from Qiskit 2.x. When porting:
# OLD: from qiskit import QuantumCircuit, Aer
# NEW: from qiskit import QuantumCircuit
# from qiskit_aer import Aer
#
# OLD: from qiskit.tools.visualization import plot_histogram
# NEW: from qiskit.visualization import plot_histogram
#
# OLD: from qiskit.extensions import Initialize
# NEW: qiskit.extensions was removed in Qiskit 2.x;
# use qiskit.circuit.library.Initialize or build a StatePreparation gate
#
# TIER 1 -- Drop-in GPU backend swap (8 locations, all marked GPU-SWAP below):
# Replace every:
# Aer.get_backend('statevector_simulator')
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
# Aer.get_backend('aer_simulator_statevector')
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
# Aer.get_backend('aer_simulator')
# With the unified GPU-enabled backend:
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
# (On CPU fallback: device='CPU'; the rest of the call syntax stays the same)
#
# TIER 2 -- Transpile once, not per solve call:
# Every solve method calls transpile() independently. Create a single
# transpiled circuit at the start of each DQA loop and reuse it.
#
# TIER 2b -- Batch shots with executor= parameter:
# AerSimulator accepts executor= for chunked GPU evaluation when the
# statevector does not fit in GPU VRAM. Add:
# simulator = AerSimulator(method='statevector', device='GPU',
# blocking_enable=True, blocking_qubits=23)
# to auto-slice large circuits across memory blocks.
#
# TIER 3 -- cuStateVec acceleration:
# For >20-qubit circuits enable NVIDIA cuStateVec:
# AerSimulator(method='statevector', device='GPU', cuStateVec_enable=True)
# cuStateVec is the fastest path on H100 and is already installed in the
# qiskit/aer-gpu module (cuquantum-cu12 26.3.0).
# =============================================================================
import optimizer_utils
import matplotlib.pyplot as plt
from itertools import permutations
from sympy.utilities.iterables import multiset_permutations
from qiskit import QuantumCircuit, Aer
from qiskit.compiler import transpile
from qiskit.tools.visualization import plot_histogram
from qiskit.extensions import Initialize
import numpy as np
class Optimizer_Dense:
"""Quantum optimizer that keeps wind scenarios in superposition (dense encoding).
Encodes gas + wind turbine decisions in decision registers and wind scenarios
in a PDF register, all in the same quantum state simultaneously. The PDF
register is initialized with $\\sqrt{\\Pr[\\xi]}$ amplitudes so that measuring
the decision register alone gives the marginal over scenarios.
This is the approach that makes QAE applicable: the oracle only needs to act
on the combined system, and the expected cost appears as the amplitude on the
ancilla qubit after the oracle is applied.
Qubit layout (in order):
gas registers, wind registers [, slack register], pdf registers
Args:
system: A `PowerSystem_1Bus` instance defining the UC problem.
encoding: `'binary'` or `'unary'` — how integers are encoded in qubit registers.
slack_register: If `True`, add a slack variable for soft demand constraints.
"""
def __init__(self, system, encoding, slack_register=False):
'''Initialize the optimizer from a PowerSystem and allocate qubit registers.'''
assert(encoding == 'binary' or encoding == 'unary')
self.system = system
self.encoding = encoding
self.num_scenarios = len(system.pdf.keys())
if slack_register:
self.num_decision_variables = system.num_gas_generators + system.num_wind_turbines + 1
else:
self.num_decision_variables = system.num_gas_generators + system.num_wind_turbines
self.num_pdf_variables = system.num_wind_turbines
# Get cost for each variable in this problem encoding
if slack_register:
self.variable_costs = system.gas_costs + system.wind_costs + [system.undersatisfied_cost]
else:
self.variable_costs = system.gas_costs + system.wind_costs #+ [system.undersatisfied_cost]
# Normalize the costs
#self.normalization = normalization
#if normalization is not None:
# mvar = max(self.variable_costs)
# print(mvar)
# Declare variables
# Assign varids, expect order gas, wind, slack
self.decision_varids = list(range(self.num_decision_variables))
# Reserve gas,wind variables
self.decision_variables = [optimizer_utils.VariableRegister(system.decision_levels-1, encoding)
for _ in range(system.num_gas_generators + system.num_wind_turbines)]
# Slack variable
if slack_register:
self.decision_variables.append(optimizer_utils.VariableRegister(system.demand, encoding))
# Gas varids
self.gas_varids = self.decision_varids[:system.num_gas_generators]
# Wind varids
self.wind_varids = self.decision_varids[system.num_gas_generators : system.num_gas_generators + system.num_wind_turbines]
# Declare pdf variables
self.pdf_varids = list(range(self.num_decision_variables, self.num_decision_variables+system.num_wind_turbines))
# Reserve pdf variables
self.pdf_variables = {i: optimizer_utils.VariableRegister(system.decision_levels-1, encoding) for i in self.pdf_varids}
# reserve qubits
self.num_qubits = sum([var.width for var in self.decision_variables + list(self.pdf_variables.values())])
self.varid_to_qubits = {}
qubit = 0
# decision qubits
for i,reg in enumerate(self.decision_variables):
self.varid_to_qubits[i] = list(range(qubit, qubit+reg.width))
qubit += reg.width
# pdf qubits
for i in self.pdf_varids:
reg = self.pdf_variables[i]
self.varid_to_qubits[i] = list(range(qubit, qubit+reg.width))
qubit += reg.width
self.decision_qubits = [q for varid in self.decision_varids for q in self.varid_to_qubits[varid]]
self.pdf_qubits = [q for varid in self.pdf_varids for q in self.varid_to_qubits[varid]]
def __str__(self):
s = 'Optimizer_Dense\n'
s += '\t#Decision Variables: ' + str(self.num_decision_variables) + '\n'
s += '\t#PDF Variables: ' + str(self.num_pdf_variables) + '\n'
s += '\t#Qubits: ' + str(self.num_qubits) + '\n'
s += '\tDecision Variables: \n'
for varid,var in enumerate(self.decision_variables):
s += '\t\tVar({}): Q={}, c={} \n'.format(varid, self.varid_to_qubits[varid], self.variable_costs[varid])
s += '\tPDF Variables: \n'
for varid,var in self.pdf_variables.items():
s += '\t\tVar({}): Q={} \n'.format(varid, self.varid_to_qubits[varid])
s += '\tScenarios \n'
for scenario_id, scenario in enumerate(self.system.scenarios):
s += '\t\tScen({})={}, Pr({})={}\n'.format(scenario_id, scenario, scenario_id, self.system.pdf[scenario])
#s += '\tNormalization = {}'.format(self.normalization)
return s
####
# Phase/Price/Cost Operators
####
def priceOperator(self, amp, scenario_weight=1.):
''' The price of x in each register
'''
qc = QuantumCircuit(len(self.decision_qubits))
for varid in self.decision_varids:
reg = self.decision_variables[varid]
cost = self.variable_costs[varid]
amp_varid = amp
#if varid in self.wind_varids:
amp_varid *= scenario_weight
qc.append(reg.numberOperator(cost*amp_varid), self.varid_to_qubits[varid])
return qc
def scenarioOperator(self, amp):
''' The price of wind w > weather xi
'''
qc = QuantumCircuit(self.num_qubits)
for i,varid in enumerate(self.wind_varids):
pdf_varid = self.pdf_varids[i]
wind_reg = self.decision_variables[varid]
pdf_reg = self.pdf_variables[pdf_varid]
qc.append(wind_reg.lessThanOperator(pdf_reg, self.system.undersatisfied_cost*amp),
self.varid_to_qubits[varid]+self.varid_to_qubits[pdf_varid])
return qc
def penaltyOperator(self, amp, penalty):
''' The price of (x+w+y-d)^2
'''
qc = QuantumCircuit(len(self.decision_qubits))
for varid_j in self.decision_varids:
reg_j = self.decision_variables[varid_j]
qc.append(reg_j.numberOperator((-2 * penalty * self.system.demand)* amp), self.varid_to_qubits[varid_j])
qc.append(reg_j.squaredOperator((penalty) * amp), self.varid_to_qubits[varid_j])
for varid_k in self.decision_varids[varid_j+1:]:
reg_k = self.decision_variables[varid_k]
qc.append(reg_j.productOperator(reg_k, (2 * penalty)* amp),
self.varid_to_qubits[varid_j] + self.varid_to_qubits[varid_k])
return qc
def solveAnnealing(self, time, method='QUBO', num_meas=10_000, penalty=1):
''' solveAnnealing
*DEPRECATED* need to update this
Solve the optimization problem with an annealing routine, specify if we use
a Dicke state and constraint preserving mixer or QUBO with a penalty Hamiltonian
'''
qc = QuantumCircuit(self.num_qubits + 1, self.num_qubits)
if method == 'QUBO':
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(qubit)
else:
print("Unimplemented annealing solution method: {}".format(method))
return 0
qc.append(self.initializePDF(), self.pdf_qubits)
#demand = self.system.demand
for t in range(1,time+1):
f = t/time
####
# cost operator
####
# cost operator
# for varid in self.decision_varids:
# reg = self.decision_variables[varid]
# cost = self.variable_costs[varid]
# qc.append(reg.numberOperator(cost*f), self.varid_to_qubits[varid])
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# for i,varid in enumerate(self.wind_varids):
# pdf_varid = self.pdf_varids[i]
# wind_reg = self.decision_variables[varid]
# pdf_reg = self.pdf_variables[pdf_varid]
# qc.append(wind_reg.lessThanOperator(pdf_reg, self.system.undersatisfied_cost*f),
# #qc.append(wind_reg.lessThanOperator(pdf_reg, self.system.undersatisfied_cost),
# self.varid_to_qubits[varid]+self.varid_to_qubits[pdf_varid])
# #self.varid_to_qubits[pdf_varid]+self.varid_to_qubits[varid])
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# cost operator - penalty term
# for varid_j in self.decision_varids:
# reg_j = self.decision_variables[varid_j]
# qc.append(reg_j.numberOperator((-2 * penalty * self.system.demand)* f), self.varid_to_qubits[varid_j])
# qc.append(reg_j.squaredOperator((penalty) * f), self.varid_to_qubits[varid_j])
# for varid_k in self.decision_varids[varid_j+1:]:
# reg_k = self.decision_variables[varid_k]
# qc.append(reg_j.productOperator(reg_k, (2 * penalty)* f),
# self.varid_to_qubits[varid_j] + self.varid_to_qubits[varid_k])
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
qc.barrier()
####
# mixing operator
####
if method == 'QUBO':
for i in self.decision_qubits:#range(self.num_qubits):
qc.rx(1-f, i)
else:
print("Unimplemented mixing operator for method: {}".format(method))
qc.measure(list(range(self.num_qubits)), list(range(self.num_qubits)))
# Transpile for simulator
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
simulator = Aer.get_backend('statevector_simulator')
print('transpiling...')
qc = transpile(qc, simulator)
# Run and get statevector
print('getting results...')
result = simulator.run(qc, shots=num_meas).result()
counts = result.get_counts(qc)
counts = {key:value/num_meas for key,value in counts.items()}
return counts
def solveAnnealingAlternating(self, total_time, time_steps, penalty=1, num_meas=1_000, init_cond='XGS', mixer='X', phase='PEN'):
''' solveAnnealingAlternating
The same dense->serial seperation of labor, but we start a different annealing schedule at layer 2
'''
#if self.system.normalization
qc = QuantumCircuit(self.num_qubits, self.num_qubits)
# Initial condition
if init_cond == 'XGS':
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(qubit)
elif init_cond == 'DICKE':
qc.append(self.dickeState(), self.decision_qubits)
else:
print("Unimplemented initial state: {}".format(init_cond))
return 0
qc.append(self.initializePDF(), self.pdf_qubits)
# PARAM-TRANSPILE: priceOperator(f), scenarioOperator(f), penaltyOperator(f, penalty),
# and the mixer sub-circuits are all rebuilt with a numeric f baked in every iteration.
# Transpile-once pattern (from bayesianQC/optimize_10epoch_performance.py):
# 1. from qiskit.circuit import Parameter
# f_param = Parameter('f')
# 2. price_tmpl = self.priceOperator(f_param) # build ONCE symbolically
# scene_tmpl = self.scenarioOperator(f_param) # build ONCE symbolically
# penalty_tmpl = self.penaltyOperator(f_param, penalty) # build ONCE symbolically
# mixer_tmpl = ... (rx or swapOperator with f_param) # build ONCE symbolically
# 3. from qiskit.transpiler.preset_passmanagers import generate_preset_pass_manager
# pm = generate_preset_pass_manager(optimization_level=1, backend=gpu_simulator)
# price_t = pm.run(price_tmpl); scene_t = pm.run(scene_tmpl); ... # transpile ONCE each
# 4. Inside loop: qc.append(price_t.assign_parameters({f_param: f_val}), ...)
# Benefit: eliminates repeated Python gate-construction + retranspile for every Trotter step.
for j in range(time_steps):
dt_1 = total_time/time_steps
f = (dt_1*j + 1)/(total_time + 1)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# TODO stochastic
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator number 2 - deterministic
qc.append(self.initializePDF(inverse=True), self.pdf_qubits)
for sample, pr in self.system.pdf.items():
qc_set_var = self.setVariables(self.pdf_variables, sample)
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
qc.append(self.scenarioOperator(.5*pr*f), range(self.num_qubits))
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
qc.append(self.initializePDF(), self.pdf_qubits)
# scenario operator
qc.append(self.scenarioOperator(.5*f), range(self.num_qubits))
else:
print("Unimplemented phase operator: {}".format(phase))
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = self.varid_to_qubits[varid_j]
qubits_k = self.varid_to_qubits[varid_k]
qc.append(var_j.swapOperator(var_k, 1/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
#qc.append(self.initializePDF(inverse=True), self.pdf_qubits)
#for q in self.pdf_qubits:
# qc.reset(q)
gas_qubits = [q for varid in self.gas_varids for q in self.varid_to_qubits[varid]]
qc.measure(gas_qubits, gas_qubits)
#print(qc)
# Transpile for simulator
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
simulator = Aer.get_backend('aer_simulator_statevector')#aer_simulator_matrix_product_state')
#print('transpiling...')
qc = transpile(qc, simulator)
# Run and get statevector
result = simulator.run(qc, shots=num_meas).result()
counts = result.get_counts(qc)
counts = {key:value/num_meas for key,value in counts.items()}
return counts
def solveAnnealingDenseStochHam2Layers(self, t1_time, t1_steps, t2_time, t2_steps, penalty=1, num_meas=1_000, init_cond='XGS', mixer='X', phase='PEN'):
''' solveAnnealingStochHam2Layers
The same dense->serial seperation of labor, but we start a different annealing schedule at layer 2
'''
#if self.system.normalization
qc = QuantumCircuit(self.num_qubits, self.num_qubits)
# Initial condition
if init_cond == 'XGS':
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(qubit)
elif init_cond == 'DICKE':
qc.append(self.dickeState(), self.decision_qubits)
else:
print("Unimplemented initial state: {}".format(init_cond))
return 0
qc.append(self.initializePDF(), self.pdf_qubits)
for j in range(t1_steps):
dt_1 = t1_time/t1_steps
f = (dt_1*j + 1)/(t1_time + 1)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# TODO stochastic
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
qc.append(self.scenarioOperator(f), range(self.num_qubits))
else:
print("Unimplemented phase operator: {}".format(phase))
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = self.varid_to_qubits[varid_j]
qubits_k = self.varid_to_qubits[varid_k]
qc.append(var_j.swapOperator(var_k, 1/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
qc.append(self.initializePDF(inverse=True), self.pdf_qubits)
#for q in self.pdf_qubits:
# qc.reset(q)
# Phase 2
for j in range(t2_steps):
dt_2 = (t2_time)/(t2_steps)
f = (dt_2 + 1)/(t2_time + 1)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# TODO stochastic
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
for sample, pr in self.system.pdf.items():
qc_set_var = self.setVariables(self.pdf_variables, sample)
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
qc.append(self.scenarioOperator(pr*f), range(self.num_qubits))
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
#for varid_j,var_j in enumerate(self.decision_variables):
# for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
# qubits_j = self.varid_to_qubits[varid_j]
# qubits_k = self.varid_to_qubits[varid_k]
# qc.append(var_j.swapOperator(var_k, pr/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented phase operator: {}".format(phase))
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = self.varid_to_qubits[varid_j]
qubits_k = self.varid_to_qubits[varid_k]
qc.append(var_j.swapOperator(var_k, 1/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
gas_qubits = [q for varid in self.gas_varids for q in self.varid_to_qubits[varid]]
qc.measure(gas_qubits, gas_qubits)
#print(qc)
# Transpile for simulator
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
simulator = Aer.get_backend('aer_simulator_statevector')#aer_simulator_matrix_product_state')
#print('transpiling...')
qc = transpile(qc, simulator)
# Run and get statevector
result = simulator.run(qc, shots=num_meas).result()
counts = result.get_counts(qc)
counts = {key:value/num_meas for key,value in counts.items()}
return counts
def solveAnnealingDenseStochHam(self, total_time, t2, t1_steps, t2_steps,
penalty=1, num_meas=1_000, reset_pdf=False,
init_cond='XGS', mixer='X', phase='PEN'):
''' solveAnnealingStochHam
'''
#if self.system.normalization
qc = QuantumCircuit(self.num_qubits, self.num_qubits)
# Initial condition
if init_cond == 'XGS':
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(qubit)
elif init_cond == 'DICKE':
qc.append(self.dickeState(), self.decision_qubits)
else:
print("Unimplemented initial state: {}".format(init_cond))
return 0
qc.append(self.initializePDF(), self.pdf_qubits)
for j in range(t1_steps):
dt_1 = t2/t1_steps
f = (dt_1*j + 1)/(total_time + 1)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# TODO stochastic
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
qc.append(self.scenarioOperator(f), range(self.num_qubits))
else:
print("Unimplemented phase operator: {}".format(phase))
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = self.varid_to_qubits[varid_j]
qubits_k = self.varid_to_qubits[varid_k]
qc.append(var_j.swapOperator(var_k, 1/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
if reset_pdf:
for q in self.pdf_qubits:
qc.reset(q)
else:
qc.append(self.initializePDF(inverse=True), self.pdf_qubits)
# Phase 2
for j in range(t2_steps):
dt_2 = (total_time-t2)/(t2_steps) # NOTE not sure about this form exactly
f = (dt_2*(j+1) + (t2 - dt_1) + 1)/(total_time + 1)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# TODO stochastic
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
for sample, pr in self.system.pdf.items():
qc_set_var = self.setVariables(self.pdf_variables, sample)
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
qc.append(self.scenarioOperator(pr*f), range(self.num_qubits))
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
#for varid_j,var_j in enumerate(self.decision_variables):
# for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
# qubits_j = self.varid_to_qubits[varid_j]
# qubits_k = self.varid_to_qubits[varid_k]
# qc.append(var_j.swapOperator(var_k, pr/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented phase operator: {}".format(phase))
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = self.varid_to_qubits[varid_j]
qubits_k = self.varid_to_qubits[varid_k]
qc.append(var_j.swapOperator(var_k, 1/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
gas_qubits = [q for varid in self.gas_varids for q in self.varid_to_qubits[varid]]
qc.measure(gas_qubits, gas_qubits)
#print(qc)
# Transpile for simulator
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
simulator = Aer.get_backend('aer_simulator_statevector')#aer_simulator_matrix_product_state')
#print('transpiling...')
qc = transpile(qc, simulator)
# Run and get statevector
result = simulator.run(qc, shots=num_meas).result()
counts = result.get_counts(qc)
counts = {key:value/num_meas for key,value in counts.items()}
return counts
def solveAnnealingStochHam(self, total_time, t_steps, penalty=1, num_meas=1_000, init_cond='XGS', mixer='X', phase='PEN'):
''' solveAnnealingStochHam
'''
#if self.system.normalization
qc = QuantumCircuit(self.num_qubits, self.num_qubits)
# Initial condition
if init_cond == 'XGS':
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(qubit)
elif init_cond == 'DICKE':
qc.append(self.dickeState(), self.decision_qubits)
else:
print("Unimplemented initial state: {}".format(init_cond))
return 0
# PARAM-TRANSPILE: Same pattern as solveAnnealingAlternating -- priceOperator, scenarioOperator,
# penaltyOperator, and mixer rebuild their circuits with a new numeric f every iteration.
# Apply the ParameterVector / assign_parameters approach described above that loop.
for j in range(t_steps):
dt = (total_time+1)/t_steps
f = (dt*j + 1)/(total_time + 1)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
# TODO stochastic
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
for sample, pr in self.system.pdf.items():
qc_set_var = self.setVariables(self.pdf_variables, sample)
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
qc.append(self.scenarioOperator(pr*f), range(self.num_qubits))
qc.append(qc_set_var, range(self.num_qubits))#self.pdf_qubits)
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = self.varid_to_qubits[varid_j]
qubits_k = self.varid_to_qubits[varid_k]
qc.append(var_j.swapOperator(var_k, pr/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented phase operator: {}".format(phase))
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
0
#for varid_j,var_j in enumerate(self.decision_variables):
# for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
# qubits_j = self.varid_to_qubits[varid_j]
# qubits_k = self.varid_to_qubits[varid_k]
# qc.append(var_j.swapOperator(var_k, 1/np.pi*(1-f)), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
gas_qubits = [q for varid in self.gas_varids for q in self.varid_to_qubits[varid]]
qc.measure(gas_qubits, gas_qubits)
#print(qc)
# Transpile for simulator
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
simulator = Aer.get_backend('aer_simulator_statevector')#aer_simulator_matrix_product_state')
#print('transpiling...')
qc = transpile(qc, simulator)
# Run and get statevector
result = simulator.run(qc, shots=num_meas).result()
counts = result.get_counts(qc)
counts = {key:value/num_meas for key,value in counts.items()}
return counts
def solveECAnnealing(self, total_time, gamma, penalty=1, num_meas=1_000, init_cond='XGS', mixer='X', phase='PEN'):
''' solveECAnnealing
'''
#if self.system.normalization
copies = 2
qc = QuantumCircuit(copies*self.num_qubits, self.num_qubits)
# Initial condition
if init_cond == 'XGS':
# TODO: fix for copies
for c in range(copies):
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(c*self.num_qubits+qubit)
elif init_cond == 'DICKE':
for c in range(copies):
qc.append(self.dickeState(), [c*self.num_qubits+q for q in self.decision_qubits])
#qc.append(self.dickeState(), self.decision_qubits)
else:
print("Unimplemented initial state: {}".format(init_cond))
return 0
for c in range(copies):
qc.append(self.initializePDF(), [c*self.num_qubits+q for q in self.pdf_qubits])
for t in range(total_time):
f = (t+1)**2/(total_time+1)**2
####
# phase operator
####
if phase == 'PEN':
# TODO: fix for copies
for c in range(copies):
# price
qc.append(self.priceOperator(f), [c*self.num_qubits+q for q in self.decision_qubits])
# scenario operator
qc.append(self.scenarioOperator(f), [c*self.num_qubits+q for q in range(self.num_qubits)])
# penalty term
qc.append(self.penaltyOperator(f, penalty), [c*self.num_qubits+q for q in self.decision_qubits])
elif phase == 'COST':
for c in range(copies):
# price
qc.append(self.priceOperator(f), [c*self.num_qubits+q for q in self.decision_qubits])
# scenario operator
qc.append(self.scenarioOperator(f), [c*self.num_qubits+q for q in range(self.num_qubits)])
else:
print("Unimplemented phase operator: {}".format(phase))
###
# Non-anticipativity constraint
###
for c_j in range(copies):
for c_k in range(copies):
if c_j != c_k:
#for q in self.gas
for q in [q for varid in self.gas_varids for q in self.varid_to_qubits[varid]]:
qc.rzz(gamma*f, c_k*self.num_qubits+q, c_j*self.num_qubits+q)
qc.barrier()
####
# mixing operator
####
if mixer == 'X':
# TODO: fix for copies
for c in range(copies):
for i in self.decision_qubits:
qc.rx(1-f, c*self.num_qubits+i)
elif mixer == 'SWAP':
for c in range(copies):
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qubits_j = [c*self.num_qubits+q for q in self.varid_to_qubits[varid_j]]
qubits_k = [c*self.num_qubits+q for q in self.varid_to_qubits[varid_k]]
qc.append(var_j.swapOperator(var_k, 1-f), qubits_j + qubits_k)
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
gas_qubits = [q for varid in self.gas_varids for q in self.varid_to_qubits[varid]]
qc.measure(gas_qubits, gas_qubits)
#print(qc)
# Transpile for simulator
# GPU-SWAP TIER 1: replace next line with
# from qiskit_aer import AerSimulator
# simulator = AerSimulator(method='statevector', device='GPU')
simulator = Aer.get_backend('aer_simulator_statevector')#aer_simulator_matrix_product_state')
#print('transpiling...')
qc = transpile(qc, simulator)
# Run and get statevector
result = simulator.run(qc, shots=num_meas).result()
counts = result.get_counts(qc)
counts = {key:value/num_meas for key,value in counts.items()}
return counts
def solveThreePhaseAnnealing(self, total_time, time_1_steps, time_2, time_3, time_3_steps, num_permutations, samples_repeats=1, num_meas=10_000, penalty=None,
init_cond='XGS', mixer="X", phase='PEN'):
''' solveThreePhaseAnnealing
Use an annealing routine; in the first phase, optimize for a given sample. In the second phase, exchange this for
other samples. In the third phase, prepare the PDF and sample the gas.
Repeat for a few permutations of the order of the samples
'''
if self.system.normalization is not None and penalty is not None:
#penalty *= self.system.normalization[1]/self.system.normalization[0]
penalty = self.system.normalize(penalty)
# warning
if phase!='PEN' and penalty is not None:
print("WARNING: specified a penalty but the penalty cost Hamiltonian is not used")
if penalty is None and phase == 'PEN':
print("ERROR: if PEN is specified (penalty Hamiltonian) we need a penalty specified")
exit(1)
# Take a few different permutations of the samples
# TODO: get a better random sample of permutations
#all_permutations = list(multiset_permutations(self.system.sample_list))#[:num_permutations]
#if num_permutations is not None:
# permutations_list = all_permutations[::int(len(all_permutations)/num_permutations)]
#else:
# permutations_list = all_permutations
permutations_list = [self.system.sample_list[::-1],]
#permutations_list = [list(self.system.pdf.keys()),] # pdf impl
all_counts = {tuple(permutation): None for permutation in permutations_list}
for p_i, permutation in enumerate(permutations_list):
qc = QuantumCircuit(self.num_qubits, self.num_qubits)
# Initial condition
if init_cond == 'XGS':
for qubit in self.decision_qubits:#range(self.num_qubits):
qc.h(qubit)
elif init_cond == 'DICKE':
qc.append(self.dickeState(), self.decision_qubits)
else:
print("Unimplemented initial state: {}".format(init_cond))
return 0
#qc.append(self.initializePDF(), self.pdf_qubits)
sample_idx = 0
qc_set_var = self.setVariables(self.pdf_variables, permutation[sample_idx])
qc.append(qc_set_var, list(range(self.num_qubits)))
display = False
###
# Phase 1
###
dt_1 = time_2/time_1_steps
for j in range(time_1_steps):
f = (dt_1*j + 1)/(total_time + 1)
a = 1
if display:
print("phase 1", f, j, time_2)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
#qc.append(self.priceOperator(f,self.system.sample_hist[permutation[sample_idx]]), self.decision_qubits)
# scenario operator
qc.append(self.scenarioOperator(a*f), range(self.num_qubits))
#qc.append(self.scenarioOperator(
# #self.system.sample_hist[permutation[sample_idx]]/(len(self.system.sample_list)*1)*f),
# self.system.sample_hist[permutation[sample_idx]]*f),
# range(self.num_qubits))
else:
print("Unimplemented phase operator: {}".format(phase))
qc.barrier()
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qc.append(var_j.swapOperator(var_k, 1-f), self.varid_to_qubits[varid_j] + self.varid_to_qubits[varid_k])
else:
print("Unimplemented mixing operator: {}".format(mixer))
qc.barrier()
###
# Phase 2
###
# undo previous sample
qc_set_var = self.setVariables(self.pdf_variables, permutation[sample_idx])
qc.append(qc_set_var, list(range(self.num_qubits)))
# this phase needs M-1 steps
dt_2 = (time_3 - time_2)/(len(permutation)*samples_repeats - 1)
#for j in range(len(permutation)-1):
for j in range(1, len(permutation)*samples_repeats):
sample_idx += 1
sample_idx %= len(permutation)
f = (dt_2*(j-1) + time_2 + 1)/(total_time + 1)
a = 1/(len(permutation))*(1+1*(j+1)/len(permutation)*samples_repeats)
if display:
print("phase 2", f, j, time_2, time_3, 'sample weight', a)
qc_set_var = self.setVariables(self.pdf_variables, permutation[sample_idx])
qc.append(qc_set_var, list(range(self.num_qubits)))
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator
#qc.append(self.scenarioOperator((1+1*(j+1)/len(permutation))*f), range(self.num_qubits))
qc.append(self.scenarioOperator(f), range(self.num_qubits))
# penalty term
qc.append(self.penaltyOperator(f, penalty), self.decision_qubits)
elif phase == 'COST':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
#qc.append(self.priceOperator(f,
# self.system.sample_hist[permutation[sample_idx]]*(1+1*(j+1)/len(permutation))),
# self.decision_qubits)
# scenario operator
qc.append(self.scenarioOperator(a*f), range(self.num_qubits))
#qc.append(self.scenarioOperator(
# #self.system.sample_hist[permutation[sample_idx]]/(len(self.system.sample_list)*1)*(1+1*(j+1)/len(permutation))*f),
# self.system.sample_hist[permutation[sample_idx]]*(1+1*(j+1)/len(permutation))*f),
# range(self.num_qubits))
else:
print("Unimplemented phase operator: {}".format(phase))
qc.barrier()
####
# mixing operator
####
if mixer == 'X':
for i in self.decision_qubits:
qc.rx(1-f, i)
elif mixer == 'SWAP':
for varid_j,var_j in enumerate(self.decision_variables):
for varid_k,var_k in enumerate(self.decision_variables[:varid_j]):
qc.append(var_j.swapOperator(var_k, 1-f), self.varid_to_qubits[varid_j] + self.varid_to_qubits[varid_k])
else:
print("Unimplemented mixing operator: {}".format(mixer))
# Undo the sample
qc_set_var = self.setVariables(self.pdf_variables, permutation[sample_idx])
qc.append(qc_set_var, list(range(self.num_qubits)))
qc.barrier()
###
# Phase 3
###
# Optimize with the entire PDF
qc.append(self.initializePDF(), self.pdf_qubits)
for j in range(time_3_steps):
dt_3 = (total_time-time_3)/time_3_steps
f = (dt_3*j + time_3 + 1)/(total_time + 1)
if display:
print('phase 3', f, j, time_3, total_time)
####
# phase operator
####
if phase == 'PEN':
# price
qc.append(self.priceOperator(f), self.decision_qubits)
# scenario operator