qleisli 0.2.2

Experimental quantum language with linear ownership, exact contracts and independent finite IR verification
Documentation
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
// Copyright 2026 Masahiko G. Yamada. SPDX-License-Identifier: Apache-2.0
//! Bounded, untrusted Fourier factoring from complete actual-body traces.
//! Original nodes and source remain retained. Fresh native Fourier checking is
//! still required; this producer comparison does not issue semantic evidence.
use super::*;
use crate::interchange::json::{self, Value};

// This is a producer optimization budget, not an acceptance capacity. Exceeding
// it leaves the original graph unchanged. Repetition is never expanded.
const TRACE_WORK: usize = 1_000_000;
const TRACE_EVENTS: usize = 4096;

#[derive(Clone, Debug, PartialEq, Eq)]
enum Event {
    H(usize),
    Phase(usize, u64, u32),
    Controlled(usize, usize, u64, u32),
}
impl Event {
    fn map(&self, route: &[usize]) -> Option<Self> {
        Some(match *self {
            Self::H(a) => Self::H(*route.get(a)?),
            Self::Phase(a, j, k) => Self::Phase(*route.get(a)?, j, k),
            Self::Controlled(a, b, j, k) => Self::Controlled(*route.get(a)?, *route.get(b)?, j, k),
        })
    }
}
#[derive(Clone, Debug)]
struct Trace {
    // Output positions expressed in the original input coordinates.
    route: Vec<usize>,
    events: Vec<Event>,
}
fn nat(value: &Value, field: &str) -> Option<usize> {
    usize::try_from(value.field(field).ok()?.number().ok()?).ok()
}
fn ns(value: &Value) -> Option<Vec<usize>> {
    value
        .array()
        .ok()?
        .iter()
        .map(|v| usize::try_from(v.number().ok()?).ok())
        .collect()
}
fn permutation(xs: &[usize], width: usize) -> bool {
    xs.len() == width && xs.iter().copied().collect::<BTreeSet<_>>() == (0..width).collect()
}
fn spend(work: &mut usize, amount: usize) -> Option<()> {
    *work = work.checked_sub(amount)?;
    Some(())
}
fn h_leaf(node: &Node, body: &Value) -> Option<()> {
    if node.before.len() != 1 || node.after.len() != 1 || !node.before[0].bit || !node.after[0].bit
    {
        return None;
    }
    let bytes = body.field("program").ok()?.text().ok()?.as_bytes();
    // The only supported leaf is a complete single-H finite program.
    if bytes.len() > 4096 {
        return None;
    }
    let imported = interchange::import(bytes, None).ok()?;
    let raw = imported.program.raw();
    let [
        RawOp::Gate {
            gate: SingleGate::H,
            input,
            output,
        },
    ] = raw.operations.as_slice()
    else {
        return None;
    };
    let a = &node.before[0];
    let b = &node.after[0];
    if *input != TokenId(a.owner)
        || *output != TokenId(b.owner)
        || raw.quantum_inputs
            != vec![QuantumPort {
                token: TokenId(a.owner),
                wires: a.axes.iter().copied().map(WireId).collect(),
                shape: BasisShape::BIT,
            }]
        || imported.program.output_ports()
            != [QuantumPort {
                token: TokenId(b.owner),
                wires: b.axes.iter().copied().map(WireId).collect(),
                shape: BasisShape::BIT,
            }]
        || !raw.classical_inputs.is_empty()
        || !raw.classical_outputs.is_empty()
        || raw.quantum_outputs != [TokenId(b.owner)]
        || raw.declared_effect != Effect::Unitary
        || imported.root_interface
            != Some(RootInterface {
                input: BasisType::Bit,
                output: BasisType::Bit,
            })
    {
        return None;
    }
    Some(())
}
fn structural_route(node: &Node, body: &Value) -> Option<Vec<usize>> {
    let op = body.field("operation").ok()?;
    let tag = op.field("tag").ok()?.text().ok()?;
    let (register, pair, take) = match tag {
        "take_bit" => (&node.before, &node.after, true),
        "put_bit" => (&node.after, &node.before, false),
        "pack_empty_bits"
            if node.before.is_empty()
                && node.after.len() == 1
                && !node.after[0].bit
                && node.after[0].axes.is_empty() =>
        {
            return Some(vec![]);
        }
        "unpack_empty_bits"
            if node.after.is_empty()
                && node.before.len() == 1
                && !node.before[0].bit
                && node.before[0].axes.is_empty() =>
        {
            return Some(vec![]);
        }
        _ => return None,
    };
    let width = nat(op, "width")?;
    let position = nat(op, "position")?;
    if register.len() != 1
        || pair.len() != 2
        || register[0].bit
        || !pair[0].bit
        || pair[1].bit
        || register[0].axes.len() != width
        || position >= width
        || pair[0].axes.len() != 1
        || pair[0].axes[0] != register[0].axes[position]
        || pair[1].axes
            != register[0]
                .axes
                .iter()
                .enumerate()
                .filter_map(|(i, w)| (i != position).then_some(*w))
                .collect::<Vec<_>>()
    {
        return None;
    }
    let mut route: Vec<_> = (0..width).collect();
    route.remove(position);
    route.insert(0, position);
    if !take {
        let mut inverse = vec![0; width];
        for (i, &j) in route.iter().enumerate() {
            inverse[j] = i;
        }
        route = inverse;
    }
    Some(route)
}
fn node_trace(
    graph: &Graph,
    index: usize,
    cache: &[Option<Trace>],
    work: &mut usize,
) -> Option<Trace> {
    let node = graph.nodes.get(index)?;
    spend(work, node.definition.len())?;
    let definition = json::parse(node.definition.as_bytes()).ok()?;
    if definition.field("effect").ok()?.text().ok()? != "unitary"
        || definition.field("interface").ok()?
            != &json::parse(header(&node.before, &node.after).as_bytes()).ok()?
        || validate(&node.before).is_err()
        || validate(&node.after).is_err()
    {
        return None;
    }
    let body = definition.field("body").ok()?;
    let width = axes(&node.before).len();
    if axes(&node.after).len() != width {
        return None;
    }
    let identity: Vec<_> = (0..width).collect();
    let child = |i: usize| -> Option<(&Node, &Trace)> {
        Some((graph.nodes.get(i)?, cache.get(i)?.as_ref()?))
    };
    let trace = match body.field("tag").ok()?.text().ok()? {
        "leaf" => {
            h_leaf(node, body)?;
            Trace {
                route: identity,
                events: vec![Event::H(0)],
            }
        }
        "dyadic_phase" => {
            if node.before != node.after
                || node.before.len() != 1
                || !node.before[0].bit
                || nat(body, "target")? != node.before[0].owner as usize
            {
                return None;
            }
            let j = body.field("j").ok()?.number().ok()?;
            let k = u32::try_from(nat(body, "k")?).ok()?;
            if k > 8 {
                return None;
            }
            Trace {
                route: identity,
                events: vec![Event::Phase(0, j, k)],
            }
        }
        "rewire" => {
            let p = body.field("permutation").ok()?;
            let owners = ns(p.field("owners").ok()?)?;
            let route = ns(p.field("axes").ok()?)?;
            if !p.field("classical").ok()?.array().ok()?.is_empty()
                || !permutation(&owners, node.before.len())
                || node.after.len() != owners.len()
                || !permutation(&route, width)
            {
                return None;
            }
            let mut output_start = 0;
            for (out, &input) in node.after.iter().zip(&owners) {
                let input_start: usize = node.before[..input].iter().map(|p| p.axes.len()).sum();
                if out.bit != node.before[input].bit
                    || out.axes.len() != node.before[input].axes.len()
                    || route[output_start..output_start + out.axes.len()]
                        != (input_start..input_start + out.axes.len()).collect::<Vec<_>>()
                {
                    return None;
                }
                output_start += out.axes.len();
            }
            Trace {
                route,
                events: vec![],
            }
        }
        "structural" => Trace {
            route: structural_route(node, body)?,
            events: vec![],
        },
        "sequence" => {
            let children = ns(body.field("children").ok()?)?;
            if children.is_empty() {
                return None;
            }
            let mut route = identity;
            let mut events = vec![];
            let mut current = &node.before;
            for i in children {
                let (d, t) = child(i)?;
                if current != &d.before || t.route.len() != width {
                    return None;
                }
                spend(work, width.checked_add(t.events.len().checked_mul(3)?)?)?;
                if events.len().checked_add(t.events.len())? > TRACE_EVENTS {
                    return None;
                }
                for event in &t.events {
                    events.push(event.map(&route)?);
                }
                route = t
                    .route
                    .iter()
                    .map(|&j| route.get(j).copied())
                    .collect::<Option<Vec<_>>>()?;
                current = &d.after;
            }
            if current != &node.after {
                return None;
            }
            Trace { route, events }
        }
        "tensor" => {
            let (a, at) = child(nat(body, "left")?)?;
            let (b, bt) = child(nat(body, "right")?)?;
            if node.before != [a.before.clone(), b.before.clone()].concat()
                || node.after != [a.after.clone(), b.after.clone()].concat()
            {
                return None;
            }
            let offset = at.route.len();
            spend(
                work,
                width.checked_add(
                    at.events
                        .len()
                        .checked_add(bt.events.len())?
                        .checked_mul(3)?,
                )?,
            )?;
            if at.events.len().checked_add(bt.events.len())? > TRACE_EVENTS {
                return None;
            }
            let mut events = at.events.clone();
            let shift: Vec<_> = (offset..width).collect();
            for e in &bt.events {
                events.push(e.map(&shift)?);
            }
            Trace {
                route: at
                    .route
                    .iter()
                    .copied()
                    .chain(bt.route.iter().map(|j| j + offset))
                    .collect(),
                events,
            }
        }
        "control" => {
            let (d, t) = child(nat(body, "definition")?)?;
            if !body.field("polarity").ok()?.boolean().ok()?
                || node.before != node.after
                || node.before.is_empty()
                || !node.before[0].bit
                || node.before[1..] != d.before
                || d.before != d.after
                || t.route != (0..t.route.len()).collect::<Vec<_>>()
            {
                return None;
            }
            spend(work, t.events.len().checked_mul(3)?)?;
            let events = t
                .events
                .iter()
                .map(|e| match *e {
                    Event::Phase(a, j, k) => Some(Event::Controlled(0, a + 1, j, k)),
                    _ => None,
                })
                .collect::<Option<Vec<_>>>()?;
            Trace {
                route: identity,
                events,
            }
        }
        "repeat" => {
            let (d, t) = child(nat(body, "definition")?)?;
            if node.before != d.before
                || node.after != d.after
                || d.before != d.after
                || t.route != identity
            {
                return None;
            }
            let count = body.field("count").ok()?.number().ok()?;
            spend(work, t.events.len().checked_mul(3)?)?;
            let events = t
                .events
                .iter()
                .map(|e| match *e {
                    Event::Phase(a, j, k) => Some(Event::Phase(a, j.checked_mul(count)?, k)),
                    _ => None,
                })
                .collect::<Option<Vec<_>>>()?;
            Trace {
                route: identity,
                events,
            }
        }
        _ => return None,
    };
    if !permutation(&trace.route, width) {
        return None;
    }
    Some(trace)
}
fn trace(graph: &Graph, root: usize) -> Option<Trace> {
    let mut work = TRACE_WORK;
    let mut cache = Vec::with_capacity(root.checked_add(1)?);
    for index in 0..=root {
        let t = node_trace(graph, index, &cache, &mut work);
        cache.push(t);
        if work == 0 {
            return None;
        }
    }
    cache.pop()?
}
fn fraction(mut j: u64, mut k: u32) -> (u64, u32) {
    while k > 0 && j % 2 == 0 {
        j /= 2;
        k -= 1;
    }
    (j, k)
}
fn staircase(trace: &Trace, width: usize) -> bool {
    if !(1..=8).contains(&width) || trace.route != (0..width).rev().collect::<Vec<_>>() {
        return false;
    }
    let mut index = 0;
    for target in (0..width).rev() {
        if trace.events.get(index) != Some(&Event::H(target)) {
            return false;
        }
        index += 1;
        let mut found = vec![];
        while let Some(Event::Controlled(a, b, j, k)) = trace.events.get(index) {
            found.push(((*a).min(*b), (*a).max(*b), fraction(*j, *k)));
            index += 1;
        }
        found.sort_unstable();
        let expected: Vec<_> = (0..target)
            .map(|control| (control, target, (1, (target - control + 1) as u32)))
            .collect();
        if found != expected {
            return false;
        }
    }
    index == trace.events.len()
}

struct Builder<'a, 'b> {
    lower: &'a mut Lower<'b>,
    precision: usize,
    registers: Vec<Port>,
    highs: Vec<Port>,
    gradients: BTreeMap<usize, usize>,
}
impl Builder<'_, '_> {
    fn fresh(&mut self, bit: bool, axes: Vec<u32>) -> Result<Port> {
        self.lower.owner = self
            .lower
            .owner
            .checked_add(1)
            .ok_or_else(|| limit("owner identities exhausted"))?;
        Ok(Port {
            owner: self.lower.owner,
            bit,
            axes,
        })
    }
    fn boundary(&mut self, width: usize) -> Result<(Port, Port, usize, usize)> {
        let register = self.registers[width].clone();
        let high = self.highs[width - 1].clone();
        let rest = self.registers[width - 1].clone();
        let ns = [width as u32, (width - 1) as u32];
        let take = self.lower.graph.structural(
            vec![register.clone()],
            vec![high.clone(), rest.clone()],
            "take_bit",
            &ns,
        )?;
        let put = self.lower.graph.structural(
            vec![high.clone(), rest.clone()],
            vec![register],
            "put_bit",
            &ns,
        )?;
        Ok((high, rest, take, put))
    }
    fn gradient(&mut self, width: usize) -> Result<usize> {
        if let Some(&index) = self.gradients.get(&width) {
            return Ok(index);
        }
        let index = if width == 0 {
            self.lower.graph.identity(vec![self.registers[0].clone()])?
        } else {
            let (high, _, take, put) = self.boundary(width)?;
            let phase = self
                .lower
                .phase(&high, &[1, (self.precision - width + 1) as u32])?;
            let rest = self.gradient(width - 1)?;
            let middle = self.lower.graph.tensor(phase, rest)?;
            self.lower.graph.sequence(vec![take, middle, put])?
        };
        self.gradients.insert(width, index);
        Ok(index)
    }
    fn recursive(&mut self, width: usize) -> Result<usize> {
        if width == 0 {
            return self.lower.graph.identity(vec![self.registers[0].clone()]);
        }
        let (high, rest, take, put) = self.boundary(width)?;
        let output = self.fresh(true, high.axes.clone())?;
        let leaf = self.lower.finite_gate(SingleGate::H, &high, &output)?;
        let rename = self.lower.graph.rename(vec![output], vec![high.clone()])?;
        let h = self.lower.graph.sequence(vec![leaf, rename])?;
        let idle = self.lower.graph.identity(vec![rest.clone()])?;
        let first = self.lower.graph.tensor(h, idle)?;
        let mut children = vec![take, first];
        if width > 1 {
            let mut gradient = self.gradient(width - 1)?;
            let count = 1usize << (self.precision - width);
            if count > 1 {
                gradient = self.lower.graph.add(
                    vec![rest.clone()],
                    vec![rest.clone()],
                    tagged(
                        "repeat",
                        &[
                            ("definition", gradient.to_string()),
                            ("count", count.to_string()),
                        ],
                    ),
                    tagged(
                        "power",
                        &[
                            ("child", gradient.to_string()),
                            ("count", count.to_string()),
                        ],
                    ),
                    "repeat",
                    vec![gradient],
                )?;
            }
            children.push(self.lower.control(vec![high.clone(), rest], gradient)?);
        }
        let idle = self.lower.graph.identity(vec![high])?;
        let recursive = self.recursive(width - 1)?;
        children.push(self.lower.graph.tensor(idle, recursive)?);
        children.push(put);
        self.lower.graph.sequence(children)
    }
    fn reversal(&mut self, register: Port) -> Result<usize> {
        let width = register.axes.len();
        if width <= 1 {
            return self.lower.graph.identity(vec![register]);
        }
        let bit = self.fresh(true, register.axes[..1].to_vec())?;
        let rest = self.fresh(false, register.axes[1..].to_vec())?;
        let result = Port {
            axes: register.axes[1..]
                .iter()
                .chain(&register.axes[..1])
                .copied()
                .collect(),
            ..register.clone()
        };
        let take = self.lower.graph.structural(
            vec![register.clone()],
            vec![bit.clone(), rest.clone()],
            "take_bit",
            &[width as u32, 0],
        )?;
        let idle = self.lower.graph.identity(vec![bit.clone()])?;
        let reverse = self.reversal(rest.clone())?;
        let middle = self.lower.graph.tensor(idle, reverse)?;
        let put = self.lower.graph.structural(
            vec![bit, rest],
            vec![result.clone()],
            "put_bit",
            &[width as u32, (width - 1) as u32],
        )?;
        let rename = self.lower.graph.rename(vec![result], vec![register])?;
        self.lower.graph.sequence(vec![take, middle, put, rename])
    }
}
impl Lower<'_> {
    pub(super) fn factor_fourier(&mut self, original: usize) -> Result<usize> {
        let node = &self.graph.nodes[original];
        if node.before != node.after || node.before.len() != 1 || node.before[0].bit {
            return Ok(original);
        }
        let outer = node.before[0].clone();
        let width = outer.axes.len();
        let Some(original_trace) = trace(&self.graph, original) else {
            return Ok(original);
        };
        if !staircase(&original_trace, width) {
            return Ok(original);
        }
        let saved = (
            self.graph.nodes.len(),
            self.graph.encodings.len(),
            self.graph.bytes,
            self.owner,
        );
        let attempt = (|| -> Result<usize> {
            let mut b = Builder {
                lower: &mut *self,
                precision: width,
                registers: vec![],
                highs: vec![],
                gradients: BTreeMap::new(),
            };
            for n in 0..=width {
                let p = b.fresh(false, (0..n as u32).collect())?;
                b.registers.push(p);
                if n > 0 {
                    let p = b.fresh(true, vec![(n - 1) as u32])?;
                    b.highs.push(p);
                }
            }
            let inner = b.registers[width].clone();
            let enter = b
                .lower
                .graph
                .rename(vec![outer.clone()], vec![inner.clone()])?;
            let body = b.recursive(width)?;
            let leave = b.lower.graph.rename(vec![inner], vec![outer.clone()])?;
            let reverse = b.reversal(outer)?;
            let candidate = b.lower.graph.sequence(vec![enter, body, leave, reverse])?;
            let candidate_trace = trace(&b.lower.graph, candidate)
                .ok_or_else(|| limit("Fourier candidate trace exceeded its bounded profile"))?;
            // Both complete traces normalize to exactly the same positive-sign
            // staircase, with only diagonal gates within an H stage commuted.
            if !staircase(&candidate_trace, width)
                || b.lower.graph.nodes[candidate].before != b.lower.graph.nodes[original].before
                || b.lower.graph.nodes[candidate].after != b.lower.graph.nodes[original].after
            {
                return Err(fail(
                    "Fourier candidate differs from the complete source trace",
                ));
            }
            Ok(candidate)
        })();
        match attempt {
            Ok(candidate) => Ok(candidate),
            Err(error) => {
                // Optional factoring must not reduce the existing producer
                // capacity. No partially appended candidate survives failure.
                self.graph.nodes.truncate(saved.0);
                self.graph.encodings.truncate(saved.1);
                self.graph.cache.retain(|_, index| *index < saved.0);
                self.graph
                    .encoding_cache
                    .retain(|_, index| *index < saved.1);
                self.graph.bytes = saved.2;
                self.owner = saved.3;
                if error.code() == "limit" {
                    Ok(original)
                } else {
                    Err(error)
                }
            }
        }
    }
}

// Compact only when serializing. The producer graph remains available for the
// source trace and translation record. The checker requires every emitted row
// to be reachable; unused source/candidate rows must not be smuggled into it.
fn remap_body(body: &Value, indices: &BTreeMap<usize, usize>) -> Option<Value> {
    let Value::Object(mut fields) = body.clone() else {
        return None;
    };
    let tag = body.field("tag").ok()?.text().ok()?;
    let keys: &[&str] = match tag {
        "tensor" => &["left", "right"],
        "inverse" | "control" => {
            if fields.contains_key("definition") {
                &["definition"]
            } else {
                &["child"]
            }
        }
        "repeat" => &["definition"],
        "power" => &["child"],
        "leaf" | "finite" | "rewire" | "structural" | "dyadic_phase" | "phase" => &[],
        "sequence" => {
            let children = ns(body.field("children").ok()?)?;
            fields.insert(
                "children".into(),
                Value::Array(
                    children
                        .iter()
                        .map(|i| {
                            indices
                                .get(i)
                                .and_then(|&j| u64::try_from(j).ok())
                                .map(Value::Number)
                        })
                        .collect::<Option<Vec<_>>>()?,
                ),
            );
            &[]
        }
        _ => return None,
    };
    for key in keys {
        let old = nat(body, key)?;
        fields.insert(
            (*key).into(),
            Value::Number(u64::try_from(*indices.get(&old)?).ok()?),
        );
    }
    Some(Value::Object(fields))
}
fn encoded(value: &Value) -> Result<String> {
    String::from_utf8(json::encode(value).map_err(|e| fail(e.to_string()))?)
        .map_err(|_| fail("graph JSON is not UTF-8"))
}
impl Graph {
    /// A complete reachable export with consistent definition/meaning/proof
    /// indices. Input/output encodings are reconstructed as exact identities.
    pub(super) fn compact_export(
        &self,
        root: usize,
    ) -> Result<(Graph, usize, BTreeMap<usize, usize>)> {
        let mut live = BTreeSet::new();
        let mut pending = vec![root];
        while let Some(index) = pending.pop() {
            if !live.insert(index) {
                continue;
            }
            let node = self
                .nodes
                .get(index)
                .ok_or_else(|| fail("missing compact graph node"))?;
            let proof = json::parse(node.proof.as_bytes()).map_err(|e| fail(e.to_string()))?;
            let children = ns(proof.field("premises").map_err(|e| fail(e.to_string()))?)
                .ok_or_else(|| fail("invalid compact graph premises"))?;
            if children.iter().any(|&child| child >= index) {
                return Err(fail("compact graph is not topological"));
            }
            pending.extend(children);
        }
        let mut compact = Graph::new();
        let mut indices = BTreeMap::new();
        for index in live {
            let node = &self.nodes[index];
            let definition =
                json::parse(node.definition.as_bytes()).map_err(|e| fail(e.to_string()))?;
            let meaning = json::parse(node.meaning.as_bytes()).map_err(|e| fail(e.to_string()))?;
            let proof = json::parse(node.proof.as_bytes()).map_err(|e| fail(e.to_string()))?;
            let remap = |v: &Value| -> Result<String> {
                let body = v.field("body").map_err(|e| fail(e.to_string()))?;
                encoded(
                    &remap_body(body, &indices)
                        .ok_or_else(|| fail("unsupported compact graph body"))?,
                )
            };
            let premises = ns(proof.field("premises").map_err(|e| fail(e.to_string()))?)
                .ok_or_else(|| fail("invalid compact graph premises"))?
                .iter()
                .map(|i| {
                    indices
                        .get(i)
                        .copied()
                        .ok_or_else(|| fail("missing compact premise"))
                })
                .collect::<Result<Vec<_>>>()?;
            let rule = proof
                .field("rule")
                .and_then(|v| v.field("tag"))
                .and_then(Value::text)
                .map_err(|e| fail(e.to_string()))?;
            let new = compact.add(
                node.before.clone(),
                node.after.clone(),
                remap(&definition)?,
                remap(&meaning)?,
                rule,
                premises,
            )?;
            indices.insert(index, new);
        }
        let entry = indices
            .get(&root)
            .copied()
            .ok_or_else(|| fail("missing compact entry"))?;
        Ok((compact, entry, indices))
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::frontend::sized::ParsedProgram;
    const SOURCE: &str = include_str!("../../../corpus/sized/qualtran_qft/fourier.qli");

    fn source(text: &str, width: u32) -> ElaboratedProgram {
        ParsedProgram::parse(BTreeMap::from([("fourier".into(), text.into())]))
            .unwrap()
            .instantiate(
                "fourier::fourier",
                BTreeMap::from([("n".into(), width)]),
                BTreeMap::new(),
            )
            .unwrap()
            .elaborate()
            .unwrap()
    }
    fn factor(source: &ElaboratedProgram) -> (Lower<'_>, usize, usize) {
        let mut lower = Lower {
            source,
            graph: Graph::new(),
            owner: 100,
            pure: BTreeMap::new(),
            gate_cache: BTreeMap::new(),
            finite_gates: BTreeMap::new(),
            inline_visits: 0,
        };
        let input = Port {
            owner: 1,
            bit: true,
            axes: vec![0],
        };
        let output = Port {
            owner: 2,
            ..input.clone()
        };
        let h = lower.finite_gate(SingleGate::H, &input, &output).unwrap();
        lower.finite_gates.insert(0, h);
        let child = lower.pure_definition(source.root()).unwrap();
        let before = lower.graph.nodes[child].before.clone();
        let after = lower.graph.nodes[child].after.clone();
        let enter = lower.graph.identity(before.clone()).unwrap();
        let restore = lower.graph.rename(after, before).unwrap();
        let original = lower.graph.sequence(vec![enter, child, restore]).unwrap();
        let candidate = lower.factor_fourier(original).unwrap();
        (lower, original, candidate)
    }
    #[test]
    fn actual_source_fourier_factoring_preserves_complete_phase_trace() {
        for width in 1..=3 {
            let source = source(SOURCE, width);
            let (mut lower, original, candidate) = factor(&source);
            assert_ne!(original, candidate);
            assert!(staircase(
                &trace(&lower.graph, original).unwrap(),
                width as usize
            ));
            assert!(staircase(
                &trace(&lower.graph, candidate).unwrap(),
                width as usize
            ));
            let (compact, root, map) = lower.graph.compact_export(candidate).unwrap();
            assert!(!map.contains_key(&original));
            assert!(compact.nodes.len() < lower.graph.nodes.len());
            assert!(staircase(&trace(&compact, root).unwrap(), width as usize));
            if let Some(directory) = std::env::var_os("QLEISLI_FOURIER_PROPOSALS") {
                let path = std::path::PathBuf::from(directory);
                std::fs::create_dir_all(&path).unwrap();
                std::fs::write(
                    path.join(format!("candidate-{width}.json")),
                    compact.artifact(root),
                )
                .unwrap();
                let (old, root, _) = lower.graph.compact_export(original).unwrap();
                std::fs::write(
                    path.join(format!("original-{width}.json")),
                    old.artifact(root),
                )
                .unwrap();
            }
            let saved = (
                lower.graph.nodes.len(),
                lower.graph.encodings.len(),
                lower.owner,
            );
            lower.graph.bytes = (16 << 20) - 1;
            assert_eq!(lower.factor_fourier(original).unwrap(), original);
            assert_eq!(
                (
                    lower.graph.nodes.len(),
                    lower.graph.encodings.len(),
                    lower.owner
                ),
                saved
            );
            assert_eq!(lower.graph.bytes, (16 << 20) - 1);
        }
        let equivalent = SOURCE.replace(
            "controlled_phase[1,n-stage-k]",
            "controlled_phase[2,n-stage-k+1]",
        );
        let source = source(&equivalent, 3);
        let (_, original, candidate) = factor(&source);
        assert_ne!(
            original, candidate,
            "exact equivalent dyadic representations must factor"
        );
    }
    #[test]
    fn actual_source_fourier_factoring_rejects_phase_order_and_reversal_changes() {
        for changed in [
            SOURCE.replace(
                "controlled_phase[1,n-stage-k]",
                "controlled_phase[3,n-stage-k]",
            ),
            SOURCE.replace("if static k+k+2 <= n", "if static n+1 <= n"),
            SOURCE.replace(
                "let target = h(target);",
                "let target = h(target); let target = h(target);",
            ),
        ] {
            let source = source(&changed, 3);
            let (_, original, candidate) = factor(&source);
            assert_eq!(
                original, candidate,
                "changed quantum meaning must remain unfactored"
            );
        }
        let mut t = Trace {
            route: vec![1, 0],
            events: vec![Event::H(1), Event::Controlled(0, 1, 1, 2), Event::H(0)],
        };
        assert!(staircase(&t, 2));
        t.events.swap(0, 1);
        assert!(!staircase(&t, 2));
        t.events.swap(0, 1);
        t.events.insert(2, Event::Phase(1, 1, 1));
        assert!(!staircase(&t, 2));
    }
}