{
  "abstract": "Traditional discrete randomized compiling (RC) tailors errors with random control frames at logical-gate boundaries, but fails to capture intra-instrument control evolution or persistent system-environment coupling. In memory-bearing environments, errors correlate across times, not just single gates. We build continuous-process randomized compilation (CPRC) in the continuous process tensor (cPT) framework, unifying random unitary control trajectories, pointwise-covariant finite-duration instruments, and environmental dynamics on one time axis. We study four protocols: fixed Pauli refresh, bounded Cayley paths, unitary Brownian motion, Ornstein-Uhlenbeck driving. We obtain three key results: (1) Pointwise covariance ensures each trajectory exactly reproduces the target logic without system-environment coupling; a closed-frame counterexample proves endpoint-only compensation causes first-order instrument errors. (2) Independent Pauli conjugations over full intervals diagonalize error histories at boundaries, but classical labels retain environment-induced correlations, confirmed by an exact static-bath solution. (3) We derive a total-variation error bound for full adaptive output records under bounded centered coupling and mixing conditions. We prove the Fock norm convergence of the entire trajectory-averaged cPT for finite non-Gaussian environments and Gaussian baths with time-integrable covariance, including the uncut Drude spectrum. We numerically validate the theory in a qubit model via output probabilities, operator conditional mutual information, and all two-particle coefficients for both qubit and thermal Drude baths. This work extends RC from discrete circuits to continuous-time memory-bearing quantum processes, offering a unified framework, quantitative tools, implementable schemes, and benchmarks for non-Markovian error tailoring.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.01521",
  "author_total": 1,
  "authors": [
    {
      "name": "He Wang"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/8bfn9vcjfzk7z.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.01521",
  "fulltext_url": null,
  "id": "8bfn9vcjfzk7z",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.01521",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "quant-ph"
    ],
    [
      "openalex",
      "1702|Quantum Computing Algorithms and Architecture"
    ]
  ],
  "openalex": "W7216437414",
  "pdf_url": "https://arxiv.org/pdf/2610.01521",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-03",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/8bfn9vcjfzk7z.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:27:01Z",
      "native_id": "2610.01521",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.01521"
    }
  ],
  "subjects": [
    {
      "field": "physics",
      "origin": "arxiv:quant-ph",
      "subfield": "quantum"
    }
  ],
  "title": "Continuous-Process Randomized Compilation for Quantum Process Tensors",
  "title_text": "Continuous-Process Randomized Compilation for Quantum Process Tensors",
  "type": "preprint",
  "updated_at": "2026-10-30T12:27:01Z",
  "url": "https://research.draconitic.com/paper/8bfn9vcjfzk7z",
  "venue": "arXiv",
  "versions": []
}