{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T03:13:28Z","timestamp":1784171608940,"version":"3.55.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T00:00:00Z","timestamp":1678838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T00:00:00Z","timestamp":1678838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The intrinsic high parallelism and entanglement characteristics of quantum computing have made quantum image processing techniques a focus of great interest. One of the most widely used techniques in image processing is segmentation, which in one of their most basic forms can be carried out using thresholding algorithms. In this paper, a fault-tolerant quantum dual-threshold algorithm has been proposed. This algorithm has been built using only Clifford+<jats:italic>T<\/jats:italic> gates for compatibility with error detection and correction codes. Because fault-tolerant implementation of<jats:italic> T<\/jats:italic> gates has a much higher cost than other quantum gates, our focus has been on reducing the number of these gates. This has allowed adding noise tolerance, computational cost reduction, and fault tolerance to the state-of-the-art dual-threshold segmentation circuits. Since the dual-threshold image segmentation involves the comparison operation, as part of this work we have implemented two full comparator circuits. These circuits optimize the metrics<jats:italic> T<\/jats:italic>-count and<jats:italic> T<\/jats:italic>-depth with respect to the best circuit comparators currently available in the literature.<\/jats:p>","DOI":"10.1007\/s11227-023-05148-9","type":"journal-article","created":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T23:26:04Z","timestamp":1679873164000},"page":"12549-12562","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fault-tolerant quantum algorithm for dual-threshold image segmentation"],"prefix":"10.1007","volume":"79","author":[{"given":"Luis O.","family":"L\u00f3pez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francisco","family":"Orts","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vicente","family":"Gonz\u00e1lez-Ruiz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,15]]},"reference":[{"key":"5148_CR1","doi-asserted-by":"publisher","unstructured":"Yan F, Venegas-Andraca S (2020). Quantum image processing. https:\/\/doi.org\/10.1007\/978-981-32-9331-1. Springer, Berlin","DOI":"10.1007\/978-981-32-9331-1"},{"issue":"3","key":"5148_CR2","doi-asserted-by":"publisher","first-page":"17300017","DOI":"10.1142\/S0219749917300017","volume":"15","author":"F Yan","year":"2017","unstructured":"Yan F, Abdullah I, Le P (2017) Quantum image processing: a review of advances in its security technologies. Int J Quantum Inform 15(3):17300017. https:\/\/doi.org\/10.1142\/S0219749917300017","journal-title":"Int J Quantum Inform"},{"key":"5148_CR3","unstructured":"Gonzalez R, Woods, R (2008) Digital image processing, 3rd edn. Pearson Education, London"},{"issue":"1","key":"5148_CR4","doi-asserted-by":"publisher","first-page":"13879","DOI":"10.1038\/s41598-021-93471-7","volume":"11","author":"J Su","year":"2021","unstructured":"Su J, Guo X, Liu C, Lu S, Li L (2021) An improved novel quantum image representation and its experimental test on IBM quantum experience. Sci Rep 11(1):13879. https:\/\/doi.org\/10.1038\/s41598-021-93471-7","journal-title":"Sci Rep"},{"key":"5148_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s11128-010-0177-y","volume":"10","author":"LQ Phuc","year":"2011","unstructured":"Phuc LQ, Fangyang D, Kaoru H (2011) A flexible representation of quantum images for polynomial preparation, image compression, and processing operations. Quantum Inf Process 10:63\u201384. https:\/\/doi.org\/10.1007\/s11128-010-0177-y","journal-title":"Quantum Inf Process"},{"issue":"8","key":"5148_CR6","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1007\/s11128-013-0567-z","volume":"12","author":"Y Zhang","year":"2013","unstructured":"Zhang Y, Lu K, Gao Y, Wang M (2013) NEQR: a novel enhanced quantum representation of digital images. Quantum Inf Process 12(8):2833\u20132860. https:\/\/doi.org\/10.1007\/s11128-013-0567-z","journal-title":"Quantum Inf Process"},{"issue":"12","key":"5148_CR7","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s11128-020-02932-x","volume":"19","author":"S Yuan","year":"2020","unstructured":"Yuan S, Wen C, Hang B, Gong Y (2020) The dual-threshold quantum image segmentation algorithm and its simulation. Quantum Inf. Process. 19(12):425. https:\/\/doi.org\/10.1007\/s11128-020-02932-x","journal-title":"Quantum Inf. Process."},{"key":"5148_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2013.08.005","volume":"529","author":"S Caraiman","year":"2014","unstructured":"Caraiman S, Manta VI (2014) Histogram-based segmentation of quantum images. Theor Comput Sci 529:46\u201360. https:\/\/doi.org\/10.1016\/j.tcs.2013.08.005","journal-title":"Theor Comput Sci"},{"issue":"5","key":"5148_CR9","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1007\/s11128-015-0932-1","volume":"14","author":"S Caraiman","year":"2015","unstructured":"Caraiman S, Manta VI (2015) Image segmentation on a quantum computer. Quantum Inf Process 14(5):1693\u20131715. https:\/\/doi.org\/10.1007\/s11128-015-0932-1","journal-title":"Quantum Inf Process"},{"issue":"6","key":"5148_CR10","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1007\/s11128-012-0521-5","volume":"12","author":"H-S Li","year":"2013","unstructured":"Li H-S, Qingxin Z, Lan S, Shen C-Y, Zhou R, Mo J (2013) Image storage, retrieval, compression and segmentation in a quantum system. Quantum Inf Process 12(6):2269\u20132290. https:\/\/doi.org\/10.1007\/s11128-012-0521-5","journal-title":"Quantum Inf Process"},{"issue":"8","key":"5148_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-022-03624-4","volume":"21","author":"L Wang","year":"2022","unstructured":"Wang L, Deng Z, Liu W (2022) An improved two-threshold quantum segmentation algorithm for NEQR image. Quantum Inf Process 21(8):1\u201320. https:\/\/doi.org\/10.1007\/s11128-022-03624-4","journal-title":"Quantum Inf Process"},{"key":"5148_CR12","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1155\/2016\/9514707","volume":"9","author":"I Yan","year":"2016","unstructured":"Yan I, Zhu R, Mi L, Yihui C, Yao D (2016) Segmentation of white blood cell from acute lymphoblastic leukemia images using dual-threshold method. Comput Math Methods Med 9:206. https:\/\/doi.org\/10.1155\/2016\/9514707","journal-title":"Comput Math Methods Med"},{"key":"5148_CR13","doi-asserted-by":"publisher","first-page":"2704","DOI":"10.3389\/fpls.2021.789911","volume":"12","author":"C Chen","year":"2021","unstructured":"Chen C, Wang X, Heidari AA, Yu H, Chen H (2021) Multi-threshold image segmentation of maize diseases based on elite comprehensive particle swarm optimization and Otsu. Front Plant Sci 12:2704. https:\/\/doi.org\/10.3389\/fpls.2021.789911","journal-title":"Front Plant Sci"},{"key":"5148_CR14","doi-asserted-by":"publisher","first-page":"872","DOI":"10.3390\/electronics10070872","volume":"10","author":"Y Sun","year":"2021","unstructured":"Sun Y, Luo Y, Chai X, Zhang P, Zhang Q, Xu L, Wei L (2021) Double-threshold segmentation of panicle and clustering adaptive density estimation for mature rice plants based on 3D point cloud. Electronics 10:872. https:\/\/doi.org\/10.3390\/electronics10070872","journal-title":"Electronics"},{"issue":"2","key":"5148_CR15","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa66eb","volume":"2","author":"A Paler","year":"2017","unstructured":"Paler A, Polian I, Nemoto K, Devitt SJ (2017) Fault-tolerant, high-level quantum circuits: form, compilation and description. Quantum Sci Technol 2(2):025003. https:\/\/doi.org\/10.1088\/2058-9565\/aa66eb","journal-title":"Quantum Sci Technol"},{"issue":"1","key":"5148_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms3524","volume":"4","author":"SJ Devitt","year":"2013","unstructured":"Devitt SJ, Stephens AM, Munro WJ, Nemoto K (2013) Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nat Commun 4(1):1\u20138. https:\/\/doi.org\/10.1038\/ncomms3524","journal-title":"Nat Commun"},{"issue":"5","key":"5148_CR17","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TC.2018.2882774","volume":"68","author":"E Mu\u00f1oz-Coreas","year":"2019","unstructured":"Mu\u00f1oz-Coreas E, Thapliyal H (2019) Quantum circuit design of a T-count optimized integer multiplier. IEEE Trans Comput 68(5):729\u2013739. https:\/\/doi.org\/10.1109\/TC.2018.2882774","journal-title":"IEEE Trans Comput"},{"key":"5148_CR18","doi-asserted-by":"publisher","first-page":"8433","DOI":"10.1007\/s11227-020-03576-5","volume":"77","author":"F Orts","year":"2021","unstructured":"Orts F, Ortega G, Cucura AC, Filatovas E, Garz\u00f3n EM (2021) Optimal fault-tolerant quantum comparators for image binarization. J Supercomput 77:8433\u20138444. https:\/\/doi.org\/10.1007\/s11227-020-03576-5","journal-title":"J Supercomput"},{"key":"5148_CR19","unstructured":"Zhang F, Chen J (2019) Optimizing T gates in Clifford+T circuit as $$\\pi \/4$$ rotations around Paulis. arXiv: Quantum Physics"},{"issue":"6","key":"5148_CR20","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1109\/TCAD.2005.855930","volume":"25","author":"VV Shende","year":"2006","unstructured":"Shende VV, Bullock SS, Markov IL (2006) Synthesis of quantum-logic circuits. IEEE Trans Comput Aided Design Integr Circuits Syst 25(6):1000\u20131010. https:\/\/doi.org\/10.1109\/TCAD.2005.855930","journal-title":"IEEE Trans Comput Aided Design Integr Circuits Syst"},{"key":"5148_CR21","doi-asserted-by":"publisher","unstructured":"Paler A, Devitt SJ (2015) An introduction into fault-tolerant quantum computing. In: Proceedings of the 52nd Annual Design Automation Conference. Dac \u201915. Association for Computing Machinery, New York. https:\/\/doi.org\/10.1145\/2744769.2747911","DOI":"10.1145\/2744769.2747911"},{"key":"5148_CR22","doi-asserted-by":"publisher","unstructured":"Polian, I., Fowler, A.G.: Design automation challenges for scalable quantum architectures. In: 2015 52nd ACM\/EDAC\/IEEE Design Automation Conference (DAC), pp. 1\u20136 (2015). https:\/\/doi.org\/10.1145\/2744769.2747921","DOI":"10.1145\/2744769.2747921"},{"key":"5148_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.92.062309","volume":"92","author":"P Webster","year":"2015","unstructured":"Webster P, Bartlett SD, Poulin D (2015) Reducing the overhead for quantum computation when noise is biased. Phys. Rev. A 92:062309. https:\/\/doi.org\/10.1103\/PhysRevA.92.062309","journal-title":"Phys. Rev. A"},{"key":"5148_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.052316","volume":"62","author":"X Zhou","year":"2000","unstructured":"Zhou X, Leung DW, Chuang IL (2000) Methodology for quantum logic gate construction. Phys. Rev. A 62:052316. https:\/\/doi.org\/10.1103\/PhysRevA.62.052316","journal-title":"Phys. Rev. A"},{"issue":"10","key":"5148_CR25","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/tcad.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy M, Maslov D, Mosca M (2014) Polynomial-time T-Depth optimization of Clifford+T circuits via matroid partitioning. IEEE Trans Comput Aided Design Integr Circuits Syst 33(10):1476\u20131489. https:\/\/doi.org\/10.1109\/tcad.2014.2341953","journal-title":"IEEE Trans Comput Aided Design Integr Circuits Syst"},{"key":"5148_CR26","doi-asserted-by":"crossref","unstructured":"Gidney C (2018) Halving the cost of quantum addition. Quantum 2:74. https:\/\/doi.org\/10.22331\/q-2018-06-18-74","DOI":"10.22331\/q-2018-06-18-74"},{"issue":"6","key":"5148_CR27","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett CH (1973) Logical reversibility of computation. IBM J Res Dev 17(6):525\u2013532. https:\/\/doi.org\/10.1147\/rd.176.0525","journal-title":"IBM J Res Dev"},{"issue":"7","key":"5148_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-019-2334-2","volume":"18","author":"H Xia","year":"2019","unstructured":"Xia H, Li H, Zhang H, Liang Y, Xin J (2019) Novel multi-bit quantum comparators and their application in image binarization. Quantum Inf Process 18(7):1\u201317. https:\/\/doi.org\/10.1007\/s11128-019-2334-2","journal-title":"Quantum Inf Process"},{"issue":"8","key":"5148_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11433-020-1582-8","volume":"63","author":"H-S Li","year":"2020","unstructured":"Li H-S, Fan P, Xia H, Peng H, Long G-L (2020) Efficient quantum arithmetic operation circuits for quantum image processing. Sci China Phys Mecha Astron 63(8):1\u201313. https:\/\/doi.org\/10.1007\/s11433-020-1582-8","journal-title":"Sci China Phys Mecha Astron"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05148-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05148-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05148-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T07:21:05Z","timestamp":1686295265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05148-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,15]]},"references-count":29,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["5148"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05148-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,15]]},"assertion":[{"value":"27 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}